Minimum Common String Partition Parameterized

@inproceedings{Damaschke2008MinimumCS,
  title={Minimum Common String Partition Parameterized},
  author={Peter Damaschke},
  booktitle={WABI},
  year={2008}
}
  • P. Damaschke
  • Published in WABI 15 September 2008
  • Computer Science
Minimum Common String Partition (MCSP) and related problems are of interest in, e.g., comparative genomics, DNA fingerprint assembly, and ortholog assignment. Given two strings with equal symbol content, the problem is to partition one string into kblocks, kas small as possible, and to permute them so as to obtain the other string. MCSP is NP-hard, and only approximation algorithms are known. Here we show that MCSP is fixed-parameter tractable in suitable parameters, so that practical instances… 
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 Parameterized by Partition Size Is Fixed-Parameter Tractable
TLDR
This work presents the first fixed-parameter algorithm for Minimum Common String Partition using only parameter k, which is likely to be the first of its kind.
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.
Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
TLDR
A comprehensive experimental comparison using real-world as well as artificially created benchmark instances indicates substantial computational advantages of the new formulation of the ILP model.
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.
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.
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.
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 Σ.
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.
...
...

References

SHOWING 1-10 OF 17 REFERENCES
The greedy algorithm for the minimum common string partition problem
TLDR
A greedy algorithm for MCSP is studied that at each step extracts a longest common substring from the given strings, showing that the approximation ratio of this algorithm is between Ω( n0.43) and O(n0.69).
A Novel Greedy Algorithm for the Minimum Common String Partition Problem
  • Dan He
  • Computer Science
    ISBRA
  • 2007
TLDR
A novel greedy algorithm is proposed for MCSP, where the longest common substring containing a symbol occurring only once at each step whenever there is a such symbol, which achieves a better partition on average than the greedy algorithm does.
Better Approximations for the Minimum Common Integer Partition Problem
TLDR
A key feature of the algorithm is that it can be implemented in almost linear time, improving upon the previous best known (k – 1/3)-approximability for this problem.
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.
The Solution Space of Sorting by Reversals
TLDR
This paper proposes an algorithm which gives one representative for each class of solutions and counts the number of solutions in each class, with a better theoretical and practical complexity than the complete enumeration method.
Developing fixed-parameter algorithms to solve combinatorially explosive biological problems.
TLDR
This chapter surveys five main practical techniques to develop fixed-parameter algorithms, circumstantiated by case studies of applications to biological problems, and presents other known bioinformatics-related applications.
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.
Parameterized Complexity
TLDR
An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.
...
...