A longest common subsequence algorithm suitable for similar text strings
Narao Nakatsu, Yahiko Kambayashi, Shuzo Yajima · Acta Informatica · 1982
Cited by 164 works. doi:10.1007/bf00264437
Authors
References
- A fast algorithm for computing longest common subsequences
- Algorithms for the Longest Common Subsequence Problem
- Bounds on the Complexity of the Longest Common Subsequence Problem
- An information-theoretic lower bound for the longest common subsequence problem
- A fast algorithm for the longest-common-subsequence problem
- Hierarchical string pattern matching using dynamic pattern matching machines