A two-step string-matching procedure
- 31 December 1991
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 24 (7) , 711-716
- https://doi.org/10.1016/0031-3203(91)90038-7
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974