Related articles:
Diff
Dynamic programming
Levenshtein distance
Key terms:
y
lcs
ga
sequences
overset
ag
leftarrow
gc
longest
uparrow
hash
prefixes
subsequences
mbox
two sequences
subproblems
comparisons
appended
t match
arrows
diff
else if
optimization
inspection
comparing
drawback
checksum
source code
dynamic programming
last element
c matrix
lcs problem
length of the lcs
subscript
longest common subsequence
final cell
memoization
reading out
lcs between
these sequences
longest sequences
each sequence
empty sequence
second property
naive algorithm
input sequences
longest subsequences common
dynamic programming approach
longest of the two sequences
contains the two subsequences
Search external links cited by footnotes on Wikipedia page Longest common subsequence problem:
|
|