On approximate string matching
- 1 January 1983
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A longest common subsequence algorithm suitable for similar text stringsActa Informatica, 1982
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- An Extension of the String-to-String Correction ProblemJournal of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970