Approximate string matching with address bit errors

Theoretical Computer Science

Volumn 410, Issue 51, 2009, Pages 5334-5346

  Amir, Amihood ^a,b   Aumann, Yonatan ^a   Kapah, Oren ^a   Levy, Avivit ^c,d   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b Johns Hopkins University   (United States)

^c SHENKAR COLLEGE OF ENGINEERING AND DESIGN   (Israel)

^d UNIVERSITY OF HAIFA   (Israel)

Author keywords

Address errors; Approximate string matching; Strings rearrangement metrics

Indexed keywords

ADDRESS ERRORS; APPROXIMATE PATTERN MATCHING; APPROXIMATE STRING MATCHING; BIT-ERRORS; EFFICIENT ALGORITHM; NOVEL TECHNIQUES; STRINGS REARRANGEMENT METRICS;

ALGORITHMS; PATTERN MATCHING;

ERRORS;

EID: 70349973435     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.09.010     Document Type: Article

References (16)

1. A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky, E. Porat, S. Skiena, U. Vishne, Pattern matching with address errors: Rearrangement distances, in: Proc. 17th ACM-SIAM Symp. on Discrete Algorithms, SODA, 2006
2. A. Amir, Y. Aumann, P. Indyk, A. Levy, E. Porat, Efficient computations of l1 and l-infinity rearrangement distances, in: SPIRE, 2007, pp. 39-49
3. Amir A., Cole R., Hariharan R., Lewenstein M., and Porat E. Overlap matching. Information and Computation 181 1 (2003) 57-74
4. A. Amir, T. Hartman, O. Kapah, A. Levy, E. Porat, On the cost of interchange rearrangement in strings, in: ESA, 2007, pp. 99-110
5. Amir A., Lewenstein M., and Porat E. Approximate swapped matching. Information Processing Letters 83 1 (2002) 33-39
6. Bafna V., and Pevzner P.A. Sorting by transpositions. SIAM Journal on Discrete Mathematics 11 (1998) 221-240
7. Berman P., and Hannenhalli S. Fast sorting by reversal. In: Hirschberg D.S., and Myers E.W. (Eds). Proc. 8th Annual Symposium on Combinatorial Pattern Matching. CPM. LNCS vol. 1075 (1996), Springer 168-185
8. Carpara A. Sorting by reversals is difficult. Proc. 1st Annual Intl. Conf. on Research in Computational Biology. RECOMB (1997), ACM Press 75-83
9. Christie D.A. Sorting by block-interchanges. Information Processing Letters 60 (1996) 165-169
10. R. Cole, R. Hariharan, Verifying candidate matches in sparse and wildcard matching, in: Proc. 34st Annual Symposium on the Theory of Computing, STOC, 2002, pp. 592-601
11. Hennessy J.L., and Patterson D.A. Computer Architecture: A Quantitative Approach. 3rd ed. (2002), Morgan Kauffmann
12. Karp R., Miller R., and Rosenberg A. Rapid identification of repeated patterns in strings, arrays and trees. Symposium on the Theory of Computing 4 (1972) 125-136
13. Lowrance R., and Wagner R.A. An extension of the string-to-string correction problem. Journal of the ACM (1975) 177-183
14. Motwani R., and Raghavan P. Randomized Algorithms (1995), Cambridge University Press
15. Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM 27 (1980) 701-717
16. Zippel R. Probabilistic algorithms for sparse polynomials. Proc. EUROSAM. LNCS vol. 72 (1979), Springer 216-226