Keywords and Synonyms
Block edit distance
Problem Definition
Given two strings \( S=s_1s_2\,\ldots\,s_n \) and \( R=r_1r_2\,\ldots\,r_m \) (wlog let \( n \geq m \)) over an alphabet \( \sigma=\{\sigma_1,\,\sigma_2,\,\ldots\,\sigma_{\ell}\} \), the standard edit distance between S and R, denoted ED(S, R) is the minimum number of single character edits, specifically insertions, deletions and replacements, to transform S into R (equivalently R into S).
If the input strings S and R are permutations of the alphabet σ (so that \( |S| = |R| = |\sigma| \)) then an analogous permutation edit distance between S and R, denoted PED(S, R) can be defined as the minimum number of single character moves, to transform S into R (or vice versa).
A generalization of the standard edit distance is edit distance with moves, which, for input strings S and R is denoted EDM(S, R), and is defined as the minimum number of character edits and substring (block) movesto transform one of the strings into the other....
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Bafna, V., Pevzner, P.A.: Sorting by Transpositions. SIAM J. Discret. Math. 11(2), 224–240 (1998)
Batu, T., Ergün, F., Sahinalp, S.C.: Oblivious string embeddings and edit distance approximations. Proc. ACM-SIAM SODA 792–801 (2006)
Besmaphyatnikh, S., Segal, M.: Enumerating longest increasing subsequences and patience sorting. Inform. Proc. Lett. 76(1–2), 7–11 (2000)
Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. Proc. ACM-SIAM SODA 667–676 (2002)
Cormode, G., Paterson, M., Sahinalp, S.C., Vishkin, U.: Communication complexity of document exchange. Proc. ACM-SIAM SODA 197–206 (2000)
Indyk, P., Motwani, R.: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. Proc. ACM STOC 604–613 (1998)
Kaplan, H., Shafrir, N.: The greedy algorithm for shortest superstrings. Inform. Proc. Lett. 93(1), 13–17 (2005)
Landau, G., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10, 157–169 (1989)
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)
Lopresti, D.P., Tomkins, A.: Block Edit Models for Approximate String Matching. Theoretical. Comput. Sci. 181(1), 159–179 (1997)
Masek, W., Paterson, M.: A faster algorithm for computing string edit distances. J. Comput. Syst. Sci. 20, 18–31 (1980)
Muthukrishnan, S., Sahinalp, S.C.: Approximate nearest neighbors and sequence comparison with block operations. Proc. ACM STOC 416–424 (2000)
Sahinalp, S.C., Vishkin, U.: Symmetry breaking for suffix tree construction. ACM STOC 300–309 (1994)
Sahinalp, S.C., Vishkin, U.: Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm. Proc. IEEE FOCS 320–328 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Sahinalp, S. (2008). Edit Distance Under Block Operations. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_122
Download citation
DOI: https://doi.org/10.1007/978-0-387-30162-4_122
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30770-1
Online ISBN: 978-0-387-30162-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering