A faster algorithm computing string edit distances
William Joseph Masek, Michael S. Paterson · Journal of Computer and System Sciences · 1980
Cited by 651 works. doi:10.1016/0022-0000(80)90002-1
Authors
References
- The Design and Analysis of Computer Algorithms
- The String-to-String Correction Problem
- A linear space algorithm for computing maximal common subsequences
- Proceedings 35th Annual Symposium on Foundations of Computer Science
- An Extension of the String-to-String Correction Problem
- Bounds on the Complexity of the Longest Common Subsequence Problem
- Bounds for the String Editing Problem