A New Efficient Algorithm for Computing the Longest Common Subsequence.

Costas S. Iliopoulos Mohammad Sohel Rahman

Published in: Theory Comput. Syst. (2009)

Keyphrases

dynamic programming
longest common subsequence
np hard
objective function
computational complexity
computationally efficient
matching algorithm
optimal solution
worst case
similarity measure
pairwise
data points
similarity function