The complexity of the breakpoint median problem
نویسنده
چکیده
The breakpoint median problems arise in the problem of determining phylogenetic history from comparative genome data. We prove that the breakpoint median problems, and a number of related and constrained versions, are all NP-hard.
منابع مشابه
The median problems for breakpoints are NP-complete
The breakpoint distance between two n-permutations is the number of pairs that appear consecutively in one but not in the other. In the median problem for breakpoints one is given a set of permutations and has to construct a permutation that minimizes the sum of breakpoint distances to all the original ones. Recently, the problem was suggested as a model for determining the evolutionary history...
متن کاملSCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy
The breakpoint distance is one of the most straightforward genome comparison measures. Surprisingly, when it comes to define it precisely for multichromosomal genomes with both linear and circular chromosomes, there is more than one way to go about it. In this paper we study Single-Cut-or-Join (SCJ), a breakpoint-like rearrangement event for which we present linear and polynomial time algorithm...
متن کاملMultichromosomal Genome Median and Halving Problems
Genome median and halving problems aim at reconstructing ancestral genomes and the evolutionary events leading from the ancestor to extant species. The NP-hardness of the breakpoint distance and reversal distance median problems for unichromosomal genomes do not easily imply the same for the multichromosomal case. Here we find the complexity of several genome median and halving problems, includ...
متن کاملComputing Genomic Midpoints
This paper proposes a new algorithm for the genomic median problem that combines greedy and stochastic search. Our computational experiments suggest that for more complex problems our algorithm finds better solutions than previous approaches. In particular we find an improved midpoint for a human-mouse-rat comparison with 424 markers. In order to understand why such problems are hard, we explor...
متن کاملOn the Complexity of Rearrangement Problems under the Breakpoint Distance
We study the complexity of rearrangement problems in the generalized breakpoint model of Tannier et al. and settle several open questions. We improve the algorithm for the median problem and show that it is equivalent to the problem of finding maximum cardinality nonbipartite matching (under linear reduction). On the other hand, we prove that the more general small phylogeny problem is NP-hard....
متن کامل