Encyclopedia of Algorithms

2008 Edition
| Editors: Ming-Yang Kao

Edit Distance Under Block Operations

2000; Cormode, Paterson, Sahinalp, Vishkin2000; Muthukrishnan, Sahinalp
  • S. Cenk Sahinalp
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30162-4_122

Keywords and Synonyms

Block edit distance        

Problem Definition

Given two strings \( S=s_1s_2\,\ldots\,s_n \)

Keywords

Edit Distance Priority Queue Query Time Conjunctive Normal Form Cross Reference 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Bafna, V., Pevzner, P.A.: Sorting by Transpositions. SIAM J. Discret. Math. 11(2), 224–240 (1998)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Batu, T., Ergün, F., Sahinalp, S.C.: Oblivious string embeddings and edit distance approximations. Proc. ACM-SIAM SODA 792–801 (2006)Google Scholar
  3. 3.
    Besmaphyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Inform. Proc. Lett. 76(1–2), 7–11 (2000)Google Scholar
  4. 4.
    Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. Proc. ACM-SIAM SODA 667–676 (2002)Google Scholar
  5. 5.
    Cormode, G., Paterson, M., Sahinalp, S.C., Vishkin, U.: Communication complexity of document exchange. Proc. ACM-SIAM SODA 197–206 (2000)Google Scholar
  6. 6.
    Indyk, P., Motwani, R.: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. Proc. ACM STOC 604–613 (1998)Google Scholar
  7. 7.
    Kaplan, H., Shafrir, N.: The greedy algorithm for shortest superstrings. Inform. Proc. Lett. 93(1), 13–17 (2005)MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Landau, G., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10, 157–169 (1989)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR 163(4):845–848 (1965) (Russian). Soviet Physics Doklady 10(8), 707–710 (1966) (English translation)Google Scholar
  10. 10.
    Lopresti, D.P., Tomkins, A.: Block Edit Models for Approximate String Matching. Theoretical. Comput. Sci. 181(1), 159–179 (1997)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Masek, W., Paterson, M.: A faster algorithm for computing string edit distances. J. Comput. Syst. Sci. 20, 18–31 (1980)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Muthukrishnan, S., Sahinalp, S.C.: Approximate nearest neighbors and sequence comparison with block operations. Proc. ACM STOC 416–424 (2000)Google Scholar
  13. 13.
    Sahinalp, S.C., Vishkin, U.: Symmetry breaking for suffix tree construction. ACM STOC 300–309 (1994)Google Scholar
  14. 14.
    Sahinalp, S.C., Vishkin, U.: Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm. Proc. IEEE FOCS 320–328 (1996)Google Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • S. Cenk Sahinalp
    • 1
  1. 1.Lab for Computational BiologySimon Fraser UniversityBurnabyUSA