Block edit models for approximate string matching
Theoretical Computer Science - Special issue: Latin American theoretical informatics
SIAM Journal on Discrete Mathematics
Approximate nearest neighbors and sequence comparison with block operations
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
An Introduction to Data Structures and Algorithms
An Introduction to Data Structures and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Exact and Approximation Algorithms for the Inversion Distance Between Two Chromosomes
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
On the Structure of Syntenic Distance
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Coding and Information Theory
Genome rearrangements and sorting by reversals
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Simple and Practical Sequence Nearest Neighbors with Block Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
XML stream processing using tree-edit distance embeddings
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
The greedy algorithm for the minimum common string partition problem
ACM Transactions on Algorithms (TALG)
The greedy algorithm for edit distance with moves
Information Processing Letters
Fast and simple XML tree differencing by sequence alignment
Proceedings of the 2006 ACM symposium on Document engineering
The string edit distance matching problem with moves
ACM Transactions on Algorithms (TALG)
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics
Approximate schemas, source-consistency and query answering
Journal of Intelligent Information Systems
Machine translation system combination using ITG-based alignments
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
The greedy algorithm for edit distance with moves
Information Processing Letters
Efficient algorithms for the block edit problems
Information and Computation
A novel greedy algorithm for the minimum common string partition problem
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Approximate Satisfiability and Equivalence
SIAM Journal on Computing
Sorting by transpositions is difficult
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Exponential and polynomial time algorithms for the minimum common string partition problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
MEDITE: a unilingual textual aligner
FinTAL'06 Proceedings of the 5th international conference on Advances in Natural Language Processing
Bounding prefix transposition distance for strings and permutations
Theoretical Computer Science
Approximating reversal distance for strings with bounded number of duplicates
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Minimum common string partition problem: hardness and approximations
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Minimum common string partition revisited
Journal of Combinatorial Optimization
User edits classification using document revision histories
EACL '12 Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics
Alignments with non-overlapping moves, inversions and tandem duplications in O(n4) time
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Information Systems
RWS-Diff: flexible and efficient change detection in hierarchical data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.01 |
The traditional edit-distance problem is to find the minimum number of insert-character and delete-character (and sometimes change character) operations required to transform one string into another. Here we consider the more general problem of strings being represented by a singly linked list (one character per node) and being able to apply these operations to the pointer associated with a vertex as well as the character associated with the vertex. That is, in O(1) time, not only can characters be inserted or deleted, but also substrings can be moved or deleted. We limit our attention to the ability to move substrings and leave substring deletions for future research. Note that O(1) time substring move operations imply O(1) substring exchange operations as well, a form of transformation that has been of interest in molecular biology. We show that this problem is NP-complete, show that a "recursive" sequence of moves can be simulated with at most a constant factor increase by a non-recursive sequence, and present a polynomial time greedy algorithm for non-recursive moves with a worst-case log factor approximation to optimal. The development of this greedy algorithm shows how to reduce moves of substrings to moves of characters, and how to convert moves with characters to only insert and deletes of characters.