Overlap matching

Information and Computation

Volumn 181, Issue 1, 2003, Pages 57-74

  Amir, Amihood ^a,b   Cole, Richard ^c   Hariharan, Ramesh ^d   Lewenstein, Moshe ^e   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b Georgia Institute of Technology   (United States)

^c POLYTECHNIC UNIVERSITY   (United States)

^d INDIAN INSTITUTE OF SCIENCE   (India)

^e IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; CHARACTER SETS; CONTENT BASED RETRIEVAL; PROBLEM SOLVING; TEXT PROCESSING;

OVERLAP MATCHING; STRING MATCHING; STRUCTURAL MATCHING;

PATTERN MATCHING;

EID: 0037465502     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)00035-4     Document Type: Article

References (24)

1. A. Amir, Y. Aumann, G. Landau, M. Lewenstein, N. Lewenstein, Pattern matching with swaps, Proc. 38th IEEE Foundations of Computer Science (1997) 144-153.
2. A. Amir, Y. Aumann, G. Landau, M. Lewenstein, N. Lewenstein, Pattern matching with swaps, J. Algorithms 37 (2) (2000) 247-266.
3. A. Amir, M. Farach, Efficient 2-dimensional approximate matching of half-rectangular figures, Inform. and Comput. 118 (1), (1995) 1-11.
4. A. Amir, M. Farach, S. Muthukrishnan, Alphabet dependence in parameterized matching, Inform. Process. Lett. 49 (1994) 111-115.
5. A. Amir, G.M. Landau, M. Lewenstein, N. Lewenstein, Efficient special cases of pattern matching with swaps, Inform. Process. Lett. 68 (3) (1998) 125-132.
6. A. Amir, M. Lewenstein, E. Porat, Faster algorithms for string matching with k mismatches, in: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 794-803.
7. A. Apostolico, Z. Galil (Eds.), Pattern Matching Algorithms, Oxford University Press, Oxford, 1997.
8. B.S. Baker, A theory of parameterized pattern matching: algorithms and applications, in: Proc. 25th Annual ACM Symposium on the Theory of Computation, 1993, pp. 71-80.
9. R. Cole, R. Hariharan, Approximate string matching: a faster simpler algorithm, in: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 463-472.
10. R. Cole, R. Hariharan, Randomized swap matching in o(m log m log |σ|) time, Technical Report TR1999-789, New York University, Courant Institute, September 1999.
11. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press/McGraw-Hill, Cambridge, MA/New York, 1992.
12. M. Crochemore, W. Rytter, Text Algorithms, Oxford University Press, Oxford, 1994.
13. M.J. Fischer, M.S. Paterson, String matching and other products, in: R.M. Karp (Ed.), Complexity of Computation, SIAM-AMS Proceedings, vol. 7, 1974, pp. 113-125.
14. Z. Galil, K. Park, An improved algorithm for approximate string matching, SIAM J. Comput. 19 (6) (1990) 989-999.
15. J. Jurka, Human repetitive elements, in: R.A. Meyers (Ed.), Molecular Biology and Biotechnology, VCH, New York, 1995, pp. 438-441.
16. J. Jurka, Origin and evolution of alu repetitive elements, in: R.J. Maraia (Ed.) The Impact of Short Interspersed Elements (SINEs) on the Host Genome, R.G. Landes, New York, 1995, pp. 25-41.
17. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977) 323-350.
18. G.M. Landau, U. Vishkin, Fast parallel and serial approximate string matching, J. Algorithms 10 (2) (1989) 157-169.
19. G.M. Landau, E.W. Myers, J.P. Schmidt, Incremental string comparison, SIAM J. Comput. 27 (2) (1998) 557-582.
20. V.I. Levenshtein, Binary codes capable of correcting, deletions, insertions, and reversals, Sov. Phys. Dokl. 10 (1966) 707-710.
21. R. Lowrance, R.A. Wagner, An extension of the string-to-string correction problem, J. ACM (1975) 177-183.
22. S. Muthukrishnan, New results and open problems related to non-standard stringology, in: Proc. 6th Combinatorial Pattern Matching Conference, Lecture Notes in Computer Science, vol. 937, Springer, Berlin, 1995, pp. 298-317.
23. S. Muthukrishnan, H. Ramesh, String matching under a general matching relation, Inform. and Comput. 122 (1) (1995) 140-148.
24. R.A. Wagner, On the complexity of the extended string-to-string correction problem, in: Proc. 7th ACM Symposium on the Theory of Computing, 1975, pp. 218-223.