Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable

@inproceedings{Bulteau2014MinimumCS,
  title={Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable},
  author={Laurent Bulteau and Christian Komusiewicz},
  booktitle={SODA},
  year={2014}
}
The NP-hard Minimum Common String Partition problem asks whether two strings x and y can each be partitioned into at most k substrings such that both partitions use exactly the same substrings in a different order. We present the first fixed-parameter algorithm for Minimum Common String Partition using only parameter k. 

Figures from this paper

Parameterized Algorithms for Minimum Tree Cut/Paste Distance and Minimum Common Integer Partition
TLDR
This work studies two NP-hard problems formulated in computational biology and gives parameterized algorithms for both problems, the minimum tree cut/paste distance problem and the minimum common integer partition.
Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem
Minimum Common String Partition: Exact Algorithms
TLDR
It is shown that the case of constant size alphabet can be solved in subexponential time 2O(n log log n/ log n) by a hybrid strategy: enumerate all long pieces and use dynamic programming over histograms of short pieces and it is proved almost matching lower bounds assuming the Exponential Time Hypothesis.
An Integer Programming Formulation of the Minimum Common String Partition Problem
TLDR
This paper maps the MCSP problem into a graph applying a prior technique and using this graph, an Integer Linear Programming (ILP) formulation for the problem is developed, which is an NP-hard problem.
Multivariate Algorithmics for NP-Hard String Problems
TLDR
This work surveys parameterized and multivariate algorithmics results for NP-hard string problems and identifies challenges for future research.
On the Exact Block Cover Problem
TLDR
This paper considers the decision version of the one-sided MCSP problem, how to decide whether the other sequence can be partitioned accordingly, and shows that if each letter is allowed to appear at most twice twice, then the problem is polynomially solvable.
A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem
TLDR
This paper presents a simple 7/2-approximation algorithm for the Maximum Duo-Preservation String Mapping (MPSM) problem, which improves on the previously best-known 4-app approximation algorithm by computing a simple local optimum.
Parameterized String Equations
TLDR
This work investigates systems of String Equations under a multivariate complexity framework, searching for tractable special cases such as systems of equations with few block variables or few equations, and studies a variant where few deletions are allowed in the target string, and gives XP algorithms in this setting when the number of block variables is constant.
...
...

References

SHOWING 1-10 OF 18 REFERENCES
Minimum Common String Partition Parameterized
TLDR
It is shown that MCSP is fixed-parameter tractable in suitable parameters, so that practical instances can be efficiently solved to optimality.
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
TLDR
This work presents an efficient fixed-parameter algorithm for the parameters number k of blocks and maximum occurrence d of a letter in either string, and evaluates this algorithm on bacteria genomes and synthetic data.
Minimum common string partition revisited
TLDR
It is shown that MCSPc is NP-hard when c≥2, and an FPT algorithm for the special case x-balanced MCSP parameterized on both k and x is devised, which runs in O∗((d!)2k) time.
Exponential and Polynomial Time Algorithms for the Minimum Common String Partition Problem
TLDR
An O(2nnO(1) time algorithm for the general case of the Minimum Common String Partition (MCSP), which solves the case for almost all strings S and S′if the length of each block in their minimum common partition is at least d0 log n/log t for some positive constant d0, where t is the size of the alphabet Σ.
Minimum Common String Partition Problem: Hardness and Approximations
TLDR
The minimum common string partition problem (MCSP) is addressed, a string comparison problem with tight connection to the problem of sorting by reversals with duplicates, a key problem in genome rearrangement and 2-MCSP is shown to be NP-hard and even APX-hard.
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
TLDR
A Θ(k)-approximation algorithm for k-SBR, a version of SBR in which each symbol is allowed to appear up to k times in each string, for some k≥1 is considered.
Edit Distance with Move Operations
Approximating the true evolutionary distance between two genomes
TLDR
The approach to compute distances between two arbitrary genomes is generalized, but focus on approximating the true evolutionary distance rather than the edit distance, and the distances produced are good enough to enable the simple neighbor-joining procedure to reconstruct the authors' test trees with high accuracy.
Assignment of orthologous genes via genome rearrangement
TLDR
A new approach to ortholog assignment that takes into account both sequence similarity and evolutionary events at a genome level, where orthologous genes are assumed to correspond to each other in the most parsimonious evolving scenario under genome rearrangement is presented.
Sorting by Transpositions
TLDR
The paper addresses the problem of genome comparison versus classical gene comparison and presents algorithms to analyze rearrangements in genomes evolving by transpositions and derive lower bounds on {\em transposition distance} between permutations and present approximation algorithms for sorting byTranspositions.
...
...