Pattern matching with address errors: Rearrangement distances

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 1221-1229

  Amir, Amihood ^a,b   Aumann, Yonatan ^a   Benson, Gary ^c   Levy, Avivit ^a   Lipsky, Ohad ^a   Porat, Ely ^a   Skiena, Steven ^d   Vishne, Uzi ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b Georgia Institute of Technology   (United States)

^c BOSTON UNIVERSITY   (United States)

^d Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL REARRANGEMENT SCHEMES; PATTERN MATCHING PROBLEMS; STRING MATCHING PROBLEMS;

ALGORITHMS; DISTANCE MEASUREMENT; PROBLEM SOLVING;

PATTERN MATCHING;

EID: 33244468606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109692     Document Type: Conference Paper

References (27)

1. K. Abrahamson, Generalized string matching, SIAM J. Comp. 16 (1987), no. 6, 1039-1051.
2. A. Amir, A. Aumann, R. Cole, M. Lewenstein, and E. Porat, Function matching: Algorithms, applications, and a lower bound, Proc. 30th ICALP, 2003, pp. 929-942.
3. A. Amir, Y. Aumann, and A. Levy, Pattern matching with address errors: Renaming schemes, Manuscript.
4. A. Amir, R. Cole, R. Hariharan, M. Lewenstein, and E. Porat, Overlap matching, Information and Computation 181 (2003), no. 1, 57-74.
5. A. Amir, M. Lewenstein, and E. Porat, Faster algorithms for string matching with k mismatches., J. Algorithms 50 (2004), no. 2, 257-275.
6. V. Bafna and P.A. Pevzner, Sorting by transpositions, SIAM J. on Discrete Mathematics 11 (1998), 221-240.
7. B. S. Baker, A theory of parameterized pattern matching: algorithms and applications, Proc. 25th Annual ACM Symposium on the Theory of Computation, 1993, pp. 71-80.
8. P. Berman and S. Hannenhalli, Fast sorting by reversal, Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM) (D.S. Hirschberg and E.W. Myers, eds.), LNCS, vol. 1075, Springer, 1996, pp. 168-185.
9. A. Carpara, Sorting by reversals is difficult, Proc. 1st Annual Intl. Conf. on Research in Computational Biology (RECOMB), ACM Press, 1997, pp. 75-83.
10. D. A. Christie, Sorting by block-interchanges, Information Processing Letters 60 (1996), 165-169.
11. R. Cole, L.A. Gottlieb, and M. Lewenstein, Dictionary matching and indexing with errors and don't cares, STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, 2004, pp. 91-100.
12. R. Cole and R. Hariharan, Approximate string matching: A faster simpler algorithm, Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998, pp. 463-472.
13. Y. Dvir, Covering properties of permutation groups, Products of Conjugacy Classes in Groups (Z. Arad and M. Herzog, eds.), Lecture Notes in Mathematics 1112, 1985.
14. P. Ferragina and R. Grossi, Fast incremental text editing, Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (1995), 531-540.
15. M.J. Fischer and M.S. Paterson, String matching and other products, Complexity of Computation, R.M. Karp (editor), SIAM-AMS Proceedings 7 (1974), 113-125.
16. Z. Galil and R. Giancarlo, Improved string matching with k mismatches, SIGACT News 17 (1986), no. 4, 52-54.
17. M. Gu, M. Farach, and R. Beigel, An efficient algorithm for dynamic text indexing, Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (1994), 697-704.
18. H. Karloff, Fast algorithms for approximately counting mismatches, Information Processing Letters 48 (1993), no. 2, 53-60.
19. G. M. Landau and U. Vishkin, Efficient string matching with k mismatches, Theoretical Computer Science 43 (1986), 239-249.
20. V. I. Levenshtein, Binary codes capable of correcting, deletions, insertions and reversals, Soviet Phys. Dokl. 10 (1966), 707-710.
21. R. Lowrance and R. A. Wagner, An extension of the string-to-string correction problem, J. of the ACM (1975), 177-183.
22. S. Muthukrishnan and H. Ramesh, String matching under a general matching relation, Information and Computation 122 (1995), no. 1, 140-148.
23. S. C. Sahinalp and U. Vishkin, Efficient approximate and dynamic matching of patterns using a labeling paradigm, Proc. 37th FOCS (1996), 320-328.
24. J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. of the ACM 27 (1980), 701-717.
25. U. Vishne, Mixing and covering in the symmetric group, Journal of Algebra 205 (1998), no. 1, 119-140.
26. A. C. C. Yao, Some complexity questions related to distributed computing, Proc. 11th Annual Symposium on the Theory of Computing (STOC), 1979, pp. 209-213.
27. R. Zippel, Probabilistic algorithms for sparse polynomials, Proc. EUROSAM, LNCS, vol. 72, Springer, 1979, pp. 216-226.