A Longest Common Subsequence Algorithm Suitable for Similar Text Strings.

Narao Nakatsu Yahiko Kambayashi Shuzo Yajima

Published in: Acta Informatica (1982)

Keyphrases

string matching
longest common subsequence
similarity measure
objective function
optimal solution
dynamic programming
computational complexity
k means
worst case
matching algorithm
np hard
edit distance
suffix tree