A fast algorithm for the longest-common-subsequence problem
Amar Mukhopadhyay · Information Sciences · 1980
Cited by 27 works. doi:10.1016/0020-0255(80)90025-0
Authors
References
- The Art of Computer Programming: Volume 3: Sorting and Searching
- The String-to-String Correction Problem
- Matching Sequences under Deletion/Insertion Constraints
- Spelling correction in systems programs
- An algorithm for the distance between two finite sequences
- A linear space algorithm for computing maximal common subsequences
- Selected combinatorial research problems.
- 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