Incremental string comparison

SIAM Journal on Computing

Volumn 27, Issue 2, 1998, Pages 557-582

  Landau, Gad M ^a   Myers, Eugene W ^b   Schmidt, Jeanette P ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

^b University of Arizona   (United States)

Author keywords

Dynamic programming; Edit distance; String matching

Indexed keywords

EID: 0001282046     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794264810     Document Type: Article

References (28)

1. [BV-93] O. BERKMAN AND U. VISHKIN, Recursive star-tree parallel data-structure, SIAM J. Comput, 22 (1993), pp. 221-242.
2. [GP-90] Z. GALIL AND Q. PARK, An improved algorithm for approximate string matching, SIAM J. Comput., 19 (1990), pp. 989-999.
3. [Go-81] J. GOSLING, A redisplay algorithm, in Proc. ACM SIGPLAN/SIGOA Symposium on Text Manipulation, ACM, New York, 1991, pp. 123-129.
4. [GLS-92] D. GUSFIELD, G. M. LANDAU, AND B. SCHIEBER, An efficient algorithm for the all pairs suffix-prefix problem. Inform. Process. Lett., 41 (1992), pp. 181-185.
5. [HD-80] P. A. HALL AND G. R. DOWLING, Approximate string matching, Comput. Surveys, 12 (1980), pp. 381-402.
6. [HT-84] D. HAREL AND R. E. TARJAN, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), pp. 338-355.
7. [Hi-77] D. S. HIRSCHBERG, Algorithms for the longest common subsequence problem, J. ACM, 24 (1977), pp. 664-675.
8. [HS-77] J. W. HUNT AND T. G. SZYMANSKI, An algorithm for differential file comparison, Comm. ACM, 20 (1977), pp. 350-353.
9. [KM-94] J. KECECIOGLU AND E. MYERS, Exact and approximate algorithms for the sequence reconstruction problem, Algorithmica, 13 (1995), pp. 180-210.
10. [LS-93] G. M. LANDAU AND J. P. SCHMIDT, An algorithm for approximate tandem repeats, in Proc. 4th Symp. Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 648, Springer-Verlag, New York, 1993, pp. 120-133.
11. [LV-88] G. M. LANDAU AND U. VISHKIN, Fast string matching with k differences, J. Comput. System Sci., 37 (1988), pp. 63-78.
12. [LV-89] G. M. LANDAU AND U. VISHKIN, Fast parallel and serial approximate string matching, J. Algorithms, 10 (1989), pp. 157-169.
13. [Ma-90] M. MAES, On a cyclic string-to-string correction problem, Inform. Process. Lett., 35 (1990), pp. 73-78.
14. [Mc-76] E. M. MCCREIGHT, A space-economical suffix tree construction algorithm, J. ACM, 23 (1976), pp. 262-272.
15. [My-86a] E. MYERS, An O(ND) difference algorithm and its variations, Algorithmica, 1 (1986), pp. 251-266.
16. [My-86b] E. MYERS, Incremental Alignment Algorithms and Their Applications, Tech. report 86-22, Dept. of Computer Science, University of Arizona, Tucson, AZ, 1986.
17. [MM-89] E. MYERS AND W. MILLER, Row replacement algorithms for screen editors, ACM Trans. Prog. Lang. Systems, 11 (1989), pp. 33-56.
18. [NKY-82] N. NAKATSU, Y. KAMBAYASHI, AND S. YAJIMA, A longest common subsequence algorithm suitable for similar text string, Acta Inform., 18 (1982), pp. 171-179.
19. [NW-70] S. B. NEEDLEMAN AND C. D. WUNSCH, A general method applicable to the search for similarities in the amino acid sequence of two proteins, J. Mol. Bio., 48 (1970), pp. 443-453.
20. [SV-88] B. SCHIEBER AND U. VISHKIN, On finding lowest common ancestors: Simplification and parallelization, SIAM J. Comput, 17 (1988), pp. 1253-1262.
21. [Se-80] P. H. SELLERS, The theory and computation of evolutionary distances: Pattern recognition, J. Algorithms, 1 (1980), pp. 359-373.
22. [SW-81] T. F. SMITH AND M. S. WATERMAN, Identification of common molecular subsequences, J. Mol. Bio., 147 (1981), pp. 195-197.
23. [Uk-85a] E. UKKONEN, Algorithms for approximate string matching, Inform. Control, 64 (1985), pp. 100-118.
24. [Uk-85b] E. UKKONEN, On approximate string matching, J. Algorithms, 6 (1985), pp. 132-137.
25. [WF-74] R. A. WAGNER AND M. J. FISCHER, The string-to-string correction problem, J. ACM, 21 (1974), pp. 168-173.
26. [Wn-73] P. WEINER, Linear pattern matching algorithm, in Proc. 14th IEEE Symposium on Switching and Automata Theory, IEEE Computer Society Press, Los Alamitos, CA, 1973, pp. 1-11.
27. [Ws-85] M. WEISER, CWSH: The windowing shell of the Maryland window system, Software-Practice and Experience, 15 (1985), pp. 515-519.
28. [WM-92] S. Wu AND U. MANBER, Fast text searching allowing errors, Comm. ACM, 35 (1992), pp. 83-91.