Efficient computations of ℓ1 and ℓ∞ rearrangement distances

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

Volumn 4726 LNCS, Issue , 2007, Pages 39-49

  Amir, Amihood ^a,b   Aumann, Yonatan ^a   Indyk, Piotr ^c   Levy, Avivit ^a   Porat, Ely ^a  

^a BAR ILAN UNIVERSITY   (Israel)

^b Johns Hopkins University   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ERROR ANALYSIS; LINEAR EQUATIONS; PROBLEM SOLVING;

REARRANGEMENT DISTANCES; STRING MATCHING PROBLEMS;

PATTERN MATCHING;

EID: 38049011009     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75530-2_4     Document Type: Conference Paper

References (22)

1. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2), 257-275 (2004)
2. Galil, Z., Giancarlo, R.: Improved string matching with k mismatches. SIGACT News 17(4), 52-54 (1986)
3. Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science 43, 239-249 (1986)
4. Abrahamson, K.: Generalized string matching. SIAM J. Comp. 16(6), 1039-1051 (1987)
5. Karloff, H.: Fast algorithms for approximately counting mismatches. Information Processing Letters 48(2), 53-60 (1993)
6. Cole, R., Hariharan, R.: Approximate string matching: A faster simpler algorithm. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 463-472. ACM Press, New York (1998)
7. Levenshtein, V.I.: Binary codes capable of correcting, deletions, insertions and reversals. Soviet Phys. Dokl. 10, 707-710 (1966)
8. Cole, R., Gottlieb, L., Lewenstein, M.: Dictionary matching and indexing with errors and don't cares. In: STOC 2004: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pp. 91-100. ACM Press, New York (2004)
9. Ferragina, P., Grossi, R.: Fast incremental text editing. In: Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 531-540. ACM Press, New York (1995)
10. Gu, M., Farach, M., Beigel, R.: An efficient algorithm for dynamic text indexing. In: Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 697-704. ACM Press, New York (1994)
11. Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: Proc. 37th FOCS, pp. 320-328 (1996)
12. Lowrance, R., Wagner, R.A.: An extension of the string-to-string correction problem. J. of the ACM, 177-183 (1975)
13. Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 168-185. Springer, Heidelberg (1996)
14. Carpara, A.: Sorting by reversals is difficult. In: RECOMB 1997, pp. 75-83. ACM Press, New York (1997)
15. Bafna, V., Pevzner, P.: Sorting by transpositions. SIAM J. on Discrete Mathematics 11, 221-240 (1998)
16. Christie, D.A.: Sorting by block-interchanges. Information Processing Letters 60, 165-169 (1996)
17. 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 SODA, pp. 1221-1229 (2006)
18. Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors Manuscript
19. Amir, A., Hartman, T., Kapah, O., Levy, A., Porat, E.: On the cost of interchange rearrangement in strings. In: Arge, L., Welzl, E. (eds.) ESA. LNCS, vol. 4698, Springer, Heidelberg (2007)
20. Zolotarev, V.: One-dimensional stable distributions. Translations of Mathematical Monographs 65 (1986)
21. Indyk, P.: Stable distributions, pseudorandom generators, embeddings and data stream computation. In: FOCS, pp. 189-197 (2000)
22. Indyk, P., Lewenstein, M., Lipsky, O., Porat, E.: Closest pair problems in very high dimensions. In: Diaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 782-792. Springer, Heidelberg (2004)