Approximate string matching with stuck address bits

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

Volumn 6393 LNCS, Issue , 2010, Pages 395-405

  Amir, Amihood ^a,d   Eisenberg, Estrella ^a   Keller, Orgad ^a   Levy, Avivit ^b,c   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b SHENKAR COLLEGE OF ENGINEERING AND DESIGN   (Israel)

^c UNIVERSITY OF HAIFA   (Israel)

^d Johns Hopkins University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE PATTERN MATCHING; APPROXIMATE STRING MATCHING; BIT-ERRORS; EFFICIENT ALGORITHM; STRING MATCHING;

ERRORS; INFORMATION RETRIEVAL; TOWERS;

PATTERN MATCHING;

EID: 78449275849     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16321-0_41     Document Type: Conference Paper

References (20)

1. Amir, A.: Asynchronous pattern matching. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 1-10. Springer, Heidelberg (2006) (invited talk)
2. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. In: Proc. 17th ACM-SIAM Symp. on Discrete Algorithms, SODA (2006)
3. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. Journal of Computer and System Sciences 75(6), 359-370 (2009)
4. ∞ rearrangement distances. Theoretical Computer Science 410(43), 4382-4390 (2009)
5. Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 118-129. Springer, Heidelberg (2008)
6. Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. Theoretical Computer Science 410(51), 5334-5346 (2009); Special Issue of CPM 2008 Best Papers
7. Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Information and Computation 181(1), 57-74 (2003)
8. Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. Algorithmica 45(1), 109-120 (2006)
9. Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. SIAM Journal on Computing 39(4), 1444-1461 (2009)
10. Amir, A., Levy, A.: String rearrangement metrics: A survey. In: Algorithms and Applications, pp. 1-33 (2010)
11. Amir, A., Lewenstein, M., Porat, E.: Approximate swapped matching. Information Processing Letters 83(1), 33-39 (2002)
12. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. on Discrete Mathematics 11, 221-240 (1998)
13. Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Myers, E.W. (eds.) CPM 1996. LNCS, vol. 1075, pp. 168-185. Springer, Heidelberg (1996)
14. Carpara, A.: Sorting by reversals is difficult. In: Proc. 1st Annual Intl. Conf. on Research in Computational Biology (RECOMB), pp. 75-83. ACM Press, New York (1997)
15. Christie, D.A.: Sorting by block-interchanges. Information Processing Letters 60, 165-169 (1996)
16. Goldberg, A., Rao, S.: Beyond the flow decomposition barrier. J. of the ACM 45(5), 783-797 (1998)
17. Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach, 3rd edn. Morgan Kaufmann, San Francisco (2002)
18. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Computing 2(4), 225-231 (1973)
19. Kapah, O., Landau, G.M., Levy, A., Oz, N.: Interchange rearrangement: The element-cost model. Theoretical Computer Science 410(43), 4315-4326 (2009)
20. Lowrance, R., Wagner, R.A.: An extension of the string-to-string correction problem. J. of the ACM, 177-183 (1975)