Ask
Login
1
15kviews
Explain the longest common subsequence with example.
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 4.1 years ago
analysis of algorithms
ADD COMMENT EDIT
1 Answer
1
954views
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k
  1. The longest common subsequence (LCS) problem is the classic computer science problem.
  2. The longest common subsequence problem is the problem of finding the longest subsequence common to all sequences in the set of sequences.
  3. LCS is widely used by revision control systems and in biometrics.
  4. DNA is represented as strings …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.