Block edit models for approximate string matching
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
Journal of the ACM (JACM)
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
The string-to-string correction problem with block moves
ACM Transactions on Computer Systems (TOCS)
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sorting Strings by Reversals and by Transpositions
SIAM Journal on Discrete Mathematics
Optimal suffix tree construction with large alphabets
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Assignment of Orthologous Genes via Genome Rearrangement
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The greedy algorithm for the minimum common string partition problem
ACM Transactions on Algorithms (TALG)
Edit distance with move operations
Journal of Discrete Algorithms
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
The greedy algorithm for edit distance with moves
Information Processing Letters
Minimum common string partition revisited
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Approximating reversal distance for strings with bounded number of duplicates
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
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
Hi-index | 0.00 |
In the minimum common string partition problem one is given two strings S and T with the same character statistics and one seeks the smallest partition of S into substrings so that T can also be partitioned into the same substring multiset. The problem is fundamental in several variants of edit distance with block operations, e.g. signed reversal distance with duplicates and edit distance with moves. The minimum common string partition problem is known to be NP-complete and the best approximation known is of order O(log n log* n). Since this problem is of utmost practical importance one seeks a heuristic that will (1) usually have a low approximation factor and (2) will run fast. A simple greedy algorithm is known and it has been well-studied from an approximation point of view. It has been shown to have a bad worst case approximation factor. However, all the bad approximation factors presented so far stem from complicated recursive construction. In practice the greedy algorithm seems to have small approximation factors. However, the best current implementation of greedy runs in quadratic time. We propose a novel method to implement greedy in linear time.