Block edit models for approximate string matching

Theoretical Computer Science

Volumn 181, Issue 1, 1997, Pages 159-179

  Lopresti, Daniel ^a   Tomkins, Andrew ^a  

^a Panasonic Corporation of North America   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

POLYNOMIAL TIME ALGORITHM; STRING BLOCK EDIT DISTANCE;

COMPUTATION THEORY;

EID: 0031187745     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00268-X     Document Type: Article

References (27)

1. S.F. Altschul, W. Gish, W. Miller, E.W. Myers and D.J. Lipman, Basic local alignment search tool, J. Mol. Biol. 215 (1990) 403-410.
2. W.I. Chang and E.L. Lawler, Approximate string matching in sublinear expected time, in: Proc. Symp. on Foundations of Computer Science (1990) 116-124.
3. Z. Galil and R. Giancarlo, Data Structures and algorithms for approximate string matching, J. Complexity 4 (1988) 33-72.
4. Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM J. Comput. 19 (6) (1990) 989-999.
5. M.R. Garey and D.S. Johnson, A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, 1979).
6. W.B. Goad and M.I. Kanehisa, Pattern recognition in nucleic acid sequences I: A general method for finding local homologies and symmetries, Nucleic Acids Res. 10 (1982) 247-263.
7. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
8. M. Gribskov and J. Devereux, Sequence Analysis Primer (Stockton Press, New York, NY, 1991).
9. J.D. Hall and E.W. Myers, A software tool for finding locally optimal alignments in protein and nucleic acid sequence, CABIOS 4 (1988) 35-40.
10. X. Huang, R.C. Hardison and W. Miller, A space-efficient algorithm for local similarities, CABIOS 6 (1990) 373-381.
11. X. Huang and W. Miller, A time-efficient, linear-space local similarity algorithm, Adv. Appl. Math. 12 (1991) 337-357.
12. G.M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10 (1989) 157-169.
13. V.I. Levenshtein, Binay codes capable of correcting deletions, insertions, and reversals, Cybernet. and Control Theory 10 (8) (1966) 707-710.
14. R.J. Lipton and D.P. Lopresti, A systolic array for rapid string comparison, in: H. Fuchs, ed., Proc. 1985 Chapel Hill Conf. on Very Large Scale Integration (Computer Science Press, Rockville, MD, 1985) 363-376.
15. D. Lopresti and A. Tomkins, On the searchability of electronic ink, in: Proc. 4th Internat. Workshop on Frontiers in Handwriting Recognition, Taipei, Taiwan (1994) 156-165.
16. D. Lopresti and A. Tomkins, Temporal domain matching of hand-drawn pictorial queries, in: M.L. Simner, C.G. Leedham and A.J.W.M. Thomassen, eds., Handwriting and Drawing Research: Basic and Applied Issues (IOS Press, Amsterdam, 1996) 387-401.
17. D. Lopresti, A. Tomkins and J. Zhou, Algorithms for matching hand-drawn sketches, in: Proc. 5th Internat. Workshop on Frontiers in Handwriting Recognition, Colchester, England (1996) 233-238.
18. S.B. Needleman and C.D. Wunsch, A general method applicable to the search for similarities in the amino-acid sequences of two proteins, J. Mol. Biol. 48 (1970) 443-453.
19. F.S. Roberts, Graph Theory and its Applications to Problems of Society (SIAM, Philadelphia, PA, 1978).
20. D. Sankoff and J.B. Kruskal, eds., Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison (Addison-Wesley, Reading, MA, 1983).
21. P.H. Sellers, Pattern recognition in genetic sequences by mismatch density, Bull. Math. Biol. 46 (1984) 652-686.
22. T.F. Smith and M.S. Waterman, Identification of common molecular sequences, J. Mol. Biol. 147 (1981) 195-197.
23. G.A. Stephen, String Searching Algorithms (World Scientific, Singapore, 1994).
24. W.F. Tichy, The string-to-string correction problem with block moves, ACM Trans. Comput. Systems 2 (4) (1984) 309-321.
25. E. Ukkonen, Algorithms for approximate string matching, Inform. and Control 64 (1985) 100-118.
26. R.A. Wagner and M.J. Fischer, The string-to-string correction problem, J. Assoc. Comput. Machinery 21 (1974) 168-173.
27. M.S. Waterman and M. Eggert, A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons, J. Mol. Biol. 197 (1987) 723-728.