Block edit models for approximate string matching
Theoretical Computer Science - Special issue: Latin American theoretical informatics
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
Edit Distance with Move Operations
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
The greedy algorithm for shortest superstrings
Information Processing Letters
Assignment of Orthologous Genes via Genome Rearrangement
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
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
Approximating reversal distance for strings with bounded number of duplicates
Discrete Applied Mathematics
Improved Variable-to-Fixed Length Codes
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
Efficient algorithms for the block edit problems
Information and Computation
Information Processing and Management: an International Journal
Quick greedy computation for minimum common string partitions
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Reversal distance for strings with duplicates: linear time approximation using hitting set
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
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
| Hi-index | 0.00 |
In the Minimum Common String Partition problem (MCSP), we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the number of the substrings in the partition. This problem is NP-hard, even for a special case, denoted 2-MCSP, where each letter occurs at most twice in each input string. We study a greedy algorithm for MCSP that at each step extracts a longest common substring from the given strings. We show that the approximation ratio of this algorithm is between Ω(n0.43) and O(n0.69). In the case of 2-MCSP, we show that the approximation ratio is equal to 3. For 4-MCSP, we give a lower bound of Ω(log n).