Edit Distance with Multiple Block Operations†

[1]  Hiroshi Sakamoto,et al.  siEDM: an efficient string index and search algorithm for edit distance with moves , 2016, Algorithms.

[2]  Alexandru I. Tomescu,et al.  A Rank-Based Sequence Aligner with Applications in Phylogenetic Analysis , 2014, PloS one.

[3]  Cristina G. Fernandes,et al.  Repetition-free longest common subsequence of random sequences , 2013, Discret. Appl. Math..

[4]  Hsing-Yen Ann,et al.  Efficient Algorithms for the Longest Common Subsequence Problem with Sequential Substring Constraints , 2011, 2011 IEEE 11th International Conference on Bioinformatics and Bioengineering.

[5]  Dana Shapira,et al.  Edit Distance with Block Deletions , 2011, Algorithms.

[6]  Guillaume Fertin,et al.  Sorting by Transpositions Is Difficult , 2010, SIAM J. Discret. Math..

[7]  Hong Zhu,et al.  Minimum common string partition revisited , 2010, J. Comb. Optim..

[8]  Klaus Jansen,et al.  Bin packing with fixed number of bins revisited , 2010, J. Comput. Syst. Sci..

[9]  Hsing-Yen Ann,et al.  Efficient algorithms for the block edit problems , 2010, Inf. Comput..

[10]  Guillaume Fertin,et al.  Combinatorics of Genome Rearrangements , 2009, Computational molecular biology.

[11]  Abdullah N. Arslan.  An algorithm with linear expected running time for string editing with substitutions and substring reversals , 2008, Inf. Process. Lett..

[12]  Hsing-Yen Ann,et al.  Efficient algorithms for finding interleaving relationship between sequences , 2008, Inf. Process. Lett..

[13]  Alexandr Andoni,et al.  The Computational Hardness of Estimating Edit Distance [Extended Abstract] , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[14]  Hsing-Yen Ann,et al.  Dynamic programming algorithms for the mosaic longest common subsequence problem , 2007, Inf. Process. Lett..

[15]  Haim Kaplan,et al.  The greedy algorithm for edit distance with moves , 2006, Inf. Process. Lett..

[16]  Marek Chrobak,et al.  The greedy algorithm for the minimum common string partition problem , 2005, TALG.

[17]  Alessandro Bogliolo,et al.  Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism , 2004, Inf. Process. Lett..

[18]  Dana Shapira,et al.  Edit distance with move operations , 2002, J. Discrete Algorithms.

[19]  Graham Cormode,et al.  The string edit distance matching problem with moves , 2002, SODA '02.

[20]  Vineet Bafna,et al.  Sorting by Transpositions , 1998, SIAM J. Discret. Math..

[21]  Daniel P. Lopresti,et al.  Block Edit Models for Approximate String Matching , 1997, Theor. Comput. Sci..

[22]  Sridhar Hannenhalli,et al.  Polynomial-time Algorithm for Computing Translocation Distance Between Genomes , 1995, Discret. Appl. Math..

[23]  Walter F. Tichy,et al.  The string-to-string correction problem with block moves , 1984, TOCS.

[24]  James A. Storer,et al.  Data compression via textual substitution , 1982, JACM.

[25]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[26]  Mike Paterson,et al.  A Faster Algorithm Computing String Edit Distances , 1980, J. Comput. Syst. Sci..