Overlap matching

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 279-288

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

^a BAR ILAN UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

^c INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

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

References (22)

1. A. Amir, Y. Aumann, G. Landau, M. Lewenstein, and N. Lewenstein. Pattern matching with swaps. Submitted for publication.
2. A. Amir , Y. Aumann , G. M. Landau , M. Lewenstein , N. Lewenstein, Pattern matching with swaps, Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS '97), p.144, October 19-22, 1997
3. Amihood Amir , Martin Farach, Efficient 2-dimensional approximate matching of halfrectangular figures, Information and Computation, v.118 n.1, p.1-11, April 1995 [doi〉10.1006/inco.1995.1047 ]
4. Amihood Amir , Martin Farach , S. Muthukrishnan, Alphabet dependence in parameterized matching, Information Processing Letters, v.49 n.3, p.111-115, Feb. 11, 1994 [doi〉10.1016/0020-0190(94)90086-8 ]
5. Amihood Amir , Gad M. Landau , Moshe Lewenstein , Noa Lewenstein, Efficient special cases of Pattern Matching with Swaps, Information Processing Letters, v.68 n.3, p.125-132, Nov. 15, 1998 [doi〉10.1016/S0020-0190(98) 00151-3 ]
6. Amihood Amir , Moshe Lewenstein , Ely Porat, Faster algorithms for string matching with k mismatches, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.794-803, January 09-11, 2000, San Francisco, California, United States 7 Alberto Apostolico , Zvi Galil, Pattern matching algorithms, Oxford University Press, Oxford, 1997
7. Brenda S. Baker, A theory of parameterized pattern matching: algorithms and applications, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.71-80, May 16-18, 1993, San Diego, California, United States [doi〉10.1145/167088.167115]
8. R. Cole , R. Hariharan, Randomized Swap Matching in $O(m \log m \log |\Sigma| )$ time, New York University, New York, NY, 1999
9. Richard Cole , Ramesh Hariharan, Approximate string matching: a simpler faster algorithm, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.463-472, January 25-27, 1998, San Francisco, California, United States
10. Maxime Crochemore , Wojciech Rytter, Text algorithms, Oxford University Press, Inc., New York, NY, 1994
11. M.J. Fischer and M.S. Paterson. String matching and other products. Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings, 7:113- 125, 1974.
12. Zvi Galil , Kunsoo Park, An improved algorithm for approximate string matching, SIAM Journal on Computing, v.19 n.6, p.989-999, Dec. 1990 [doi〉10.1137/0219067] 14 J. Jurka. Human repetitive elements. In R. A. Meyers, editor, Molecular Biology and Biotechnology, pages 438-441. VCH Publishers, New York, 1995.
13. J. Jurka. Origin and evolution of alu repetitive elements. In R. J. Maxaia, editor, The Impact of Short Interspersed Elements (SINEs) on the Host Genome, pages 25-41. R. G. Landes, New York, 1995.
14. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM J. Comp., 6:323-350, 1977.
15. G. M. Landau , U. Vishkin, Fast parallel and serial approximate string matching, Journal of Algorithms, v.10 n.2, p.157-169, June 1989 [doi〉10.1016/0196-6774(89)90010-2]
16. Gad M. Landau , Eugene W. Myers , Jeanette P. Schmidt, Incremental String Comparison, SIAM Journal on Computing, v.27 n.2, p.557-582, April 1998 [doi〉10.1137/S0097539794264810]
17. V. I. Levenshtein. Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl., 10:707-710, 1966.
18. Robert A. Wagner , Roy Lowrance, An Extension of the String-to-String Correction Problem, Journal of the ACM (JACM), v.22 n.2, p.177-183, April 1975 [doi〉10.1145/321879.321880]
19. S. Muthukrishnan. New results and open problems related to non-standard stringology. In Proc. 6th Combinatorial Pattern Matching Conference, pages 298- 317. Lecture Notes in Computer Science 937, Springer- Verlag, 1995.
20. S. Muthukrishnan , H. Ramesh, String matching under a general matching relation, Information and Computation, v.122 n.1, p.140-148, Oct. 1995 [doi〉10.1006/inco.1995.1144]
21. Joseph Naor , Moni Naor, Small-bias probability spaces: efficient constructions and applications, SIAM Journal on Computing, v.22 n.4, p.838-856, Aug. 1993 [doi〉10.1137/0222053]
22. Robert A. Wagner, On the complexity of the Extended String-to-String Correction Problem, Proceedings of seventh annual ACM symposium on Theory of computing, p.218-223, May 05-07, 1975, Albuquerque, New Mexico, United States [doi〉10.1145/800116.803771]