The string edit distance matching problem with moves

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 667-676

  Cormode, Graham ^a   Muthukrishnan, S ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; PATTERN MATCHING; TEXT PROCESSING; VECTOR SPACES;

COMBINATORIAL PATTERN MATCHING; DETERMINISTIC ALGORITHMS; DYNAMIC PROGRAMMING ALGORITHM; MATCHING PROBLEMS; NEAR-LINEAR TIME; NEAREST NEIGHBORS; STREAMING COMPUTATIONS; SUBQUADRATIC ALGORITHMS;

PROBLEM SOLVING;

EID: 26444481117     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. [Abr87] K. Abrahamson. Generalized string matching. SIAM Journal on Computing, 16(6):1039-1051, 1987.
2. [ABROO] S. Alstrup, G. S. Brodal, and T. Rauhe. Pattern matching in dynamic texts. In Proceedings of the 11th Annual Symposium on Discrete Algorithms, pages 819-828, 2000.
3. [ALPOO] A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching with k-mismatches. In Proceedings of the 11th Annual Symposium on Discrete Algorithms, pages 794-803, 2000.
4. [CH98] R. Cole and R. Hariharan. Approximate string matching: A simpler faster algorithm. In Procedings of the 9th Annual Symposium on Discrete Algorithms, pages 463-472, 1998.
5. [CPSVOO] G. Cormode, M. Paterson, S-C. Sahinalp, and U. Vishkin. Communication complexity of document exchange. In Proceedings of the 11th Symposium on Discrete Algorithms, pages 197-206, 2000.
6. [CV86] R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In 18th Symposium on Theory of Computing, pages 206-219, 1986.
7. [Gal8S] Z. Galil. Open problems in stringology. In Combinatorial Algorithms on Words, pages 1-8. Springer, 1985.
8. [GIV01] A. Goel, P. Indyk, and K. Varadarajan. Reductions among high dimensional proximity problems. In Proceedings of the 12th Annual Symposium on Discrete Algorithms, 2001.
9. [GPS87] A. Goldberg, S. Plotkin, and G. Shannon. Parallel symmetry-breaking in sparse graphs. In 19th Symposium on Theory of Computing, pages 315-324, 1987.
10. [Gus97] D. Gusheld. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. CUP, 1997.
11. [IM98] P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In 30th Symposium on Theory of Computing, pages 604-613, 1998.
12. [Kar93] H. Karloff. Fast algorithms for approximately counting mismatches. Information Processing Letters, 48(2):53-60, November 1993.
13. [KMR72] R. M. Karp, R. E. Miller, and A. L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays. In 4th Symposium on Theory of Computing, pages 125-136, 1972.
14. [KOR98] E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. In 30th Symposium on Theory of Computing, pages 614-623, 1998.
15. [KR87] R. M. Karp and M. O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31(2):249-260, March 1987.
16. [LV86] G. M. Landau and U. Vishkin. Introducing efficient parallelism into approximate string matching and a new serial algorithm. In 18th Symposium on Theory of Computing, pages 220-230, 1986.
17. [MP80] W. J. Masek and M. S. Paterson. A faster algorithm computing suing edit distances. Journal of Computer and System Sciences, 20:18-31, 1980.
18. [MSOO] S. Muthukrishnan and S. C. Sahinalp. Approximate nearest neighbors and sequence comparison with block operations. In 32nd Symposium on Theory of Computing, 2000.
19. [MSU97] K. Mehlhorn, R. Sundar, and C. Uhrig. Maintaining dynamic sequences under equality tests in polylogarithmic time. Algorithmica, 17(2): 183-198, February 1997.
20. [Mye86] E. W. Myers. An 0(ND) difference algorithm and its variations. Algorithmica, 1:251-256, 1986.
21. [SV94] S. C. Sahinalp and U. Vishkin. Symmetry breaking for suffix tree construction. In 26th Symposium on Theory of Computing, pages 300-309, 1994.
22. [SV95] S. C. Sahinalp and U. Vishkin. Data compression using locally consistent parsing, 1995.
23. [SV96] S. C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm. In 37th Symposium on Foundations of Computer Science, pages 320-328, 1996.