Related articles:
Levenshtein distance
Longest increasing subsequence
Subsequence
Longest common substring problem
Dynamic programming
Substring
Optimal substructure
Diff
Key terms:
lcs
y
sequences
code
j
longest
element
prefixes
length
problem
two sequences
subsequence
solution
algorithm
ga
hash
comparisons
reduce
else
longest common
dynamic programming
matrix
empty
optimization
subproblems
appended
strings
backtrack
longest common subsequence
print
remove
last element
substring
gc
comparing
source code
else if
mbox
notice
naive
checksum
arrows
ag
diff
dynamic programming approach
naive algorithm
input sequences
if c
subscript
one element
complexity
arbitrary
Search external links cited by footnotes on Wikipedia page Longest common subsequence problem:
|
|