Asynchronous Pattern Matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4009 LNCS, Issue , 2006, Pages 1-10

  Amir, Amihood ^a,b  

^a BAR ILAN UNIVERSITY   (Israel)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; DATA HANDLING; MEDICAL COMPUTING; PROBLEM SOLVING;

ASYNCHRONOUS PATTERN MATCHING; COMPUTATIONAL BIOLOGY; TEXT EDITING; TRADITIONAL PATTERN MATCHING;

PATTERN MATCHING;

EID: 33746093527     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_1     Document Type: Conference Paper

References (26)

1. K. Abrahamson. Generalized string matching. SIAM J. Comp., 16(6):1039-1051, 1987.
2. A. Amir, A. Aumann, and A. Levy. Pattern matching with address bit errors. Submitted for publication, 2006.
3. A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky, E. Porat, S. Skiena, and U. Vishne. Pattern matching with address errors: rearrangement distances. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1221-1229, 2006.
4. A. Amir, R. Cole, R. Hariharan, M. Lewenstein, and E. Porat. Overlap matching. Information and Computation, 181(1):57-74, 2003.
5. A. Amir, T. Hartman, O. Kapah, and A. Levy. Interchange and weighted-interchange rearrangement distances in strings. submitted for publication, 2006.
6. A. Amir, M. Lewenstein, and E. Porat. Approximate swapped matching. Information Processing Letters, 83(1):33-39, 2002.
7. A. Amir, M. Lewenstein, and E. Porat. Faster algorithms for string matching with k mismatches. J. Algorithms, 2004.
8. V. Bafna and P.A. Pevzner. Sorting by transpositions, SIAM J. on Discrete Mathematics, 11:221-240, 1998.
9. M. A. Bender, D. Ge, S. He, H. Hu, R. Y. Pinter, S. Skiena, and F. Swidan. Improved bounds on sorting with length-weighted reversals. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 912-921, 2004.
10. M. A. Bender, D. Ge, S. He, H. Hu, R. Y. Pinter, and F. Swidan. Sorting by length-weighted reversals: Dealing with signs and circularity. In Proc. 15th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 3109 of LNCS, pages 32-46. Springer, 2004.
11. P. Berman and S. Hannenhalli. Fast sorting by reversal. In D.S. Hirsehberg and E.W. Myers, editors, Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 1075 of LNCS, pages 168-185. Springer, 1996.
12. A. Carpara. Sorting by reversals is difficult. In Proc. 1st Annual Intl. Conf. on Research in Computational Biology (RECOMB), pages 75-83. ACM Press, 1997.
13. D. A. Christie. Sorting by block-interchanges. Information Processing Letters, 60:165-169, 1996.
14. R. Cole, L. Gottlieb, and M. Lewenstein. Dictionary matching and indexing with errors and don't cares. In Proc. 36th annual ACM Symposium on the Theory of Computing (STOC), pages 91-100. ACM Press, 2004.
15. R. Cole and R. Hariharan. Approximate string matching: A faster simpler algorithm. In Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 463-472, 1998.
16. P. Ferragina and R. Grossi. Fast incremental text editing. Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pages 531-540, 1995.
17. 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.
18. Z. Galil and R. Giancarlo. Improved string matching with k mismatches. SIGACT News, 17(4):52-54, 1986.
19. M. Gu, M. Farach, and R. Beigel. An efficient algorithm for dynamic text indexing. Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 697-704, 1994.
20. J. L. Hennessy and D. A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufftmann, 3rd edition, 2002.
21. H. Karloff. Fast algorithms for approximately counting mismatches. Information Processing Letters, 48(2):53-60, 1993.
22. R. Karp, R. Miller, and A. Rosenberg. Rapid identification of repeated patterns in strings, arrays and trees. Symposium on the Theory of Computing, 4:125-136, 1972.
23. G. M. Landau and U. Vishkin. Efficient string matching with k mismatches. Theoretical Computer Science, 43:239-249, 1986.
24. V. I. Levenshtein. Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl., 10:707-710, 1966.
25. R. Lowrance and R. A. Wagner. An extension of the string-to-string correction problem. J. of the ACM, pages 177-183, 1975.
26. S. C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm. Proc. 37th FOCS, pages 320-328, 1996.