Results 1 
4 of
4
Ubiquitous Parameterization  Invitation to FixedParameter Algorithms
 In Proc. 29th MFCS, volume 3153 of LNCS
, 2004
"... Problem parameters are ubiquitous. In every area of computer science, we find all kinds of "special aspects" to the problems encountered. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Problem parameters are ubiquitous. In every area of computer science, we find all kinds of "special aspects" to the problems encountered.
Breakpoint Distance and PQTrees
"... Abstract. The PQtree is a fundamental data structure that can encode large sets of permutations. It has recently been used in comparative genomics to model ancestral genomes with some uncertainty: given a phylogeny for some species, extant genomes are represented by permutations on the leaves of th ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The PQtree is a fundamental data structure that can encode large sets of permutations. It has recently been used in comparative genomics to model ancestral genomes with some uncertainty: given a phylogeny for some species, extant genomes are represented by permutations on the leaves of the tree, and each internal node in the phylogenetic tree represents an extinct ancestral genome, represented by a PQtree. An open problem related to this approach is then to quantify the evolution between genomes represented by PQtrees. In this paper we present results for two problems of PQtree comparison motivated by this application. First, we show that the problem of comparing two PQtrees by computing the minimum breakpoint distance among all pairs of permutations generated respectively by the two considered PQtrees is NPcomplete for unsigned permutations. Next, we consider a generalization of the classical Breakpoint Median problem, where an ancestral genome is represented by a PQtree and p permutations are given, with p ≥ 1, and we want to compute a permutation generated by the PQtree that minimizes the sum of the breakpoint distances to the p permutations. We show that this problem is FixedParameter Tractable with respect to the breakpoint distance value. This last result applies both on signed and unsigned permutations, and to unichromosomal and multichromosomal permutations. 1
Running head. Quantifying Hybridization in Realistic Time
"... Key words: reticulate evolution, hybridization, agreement forests, interleaving, fixedparameter ..."
Abstract
 Add to MetaCart
Key words: reticulate evolution, hybridization, agreement forests, interleaving, fixedparameter
Journal of Computational Biology
"... algorithms Recently, numerous practical and theoretical studies in evolutionary biology aim at calculating the extent to which reticulationfor example horizontal gene transfer, hybridization, or recombinationhas influenced the evolution for a set of presentday species. It has been shown that ..."
Abstract
 Add to MetaCart
algorithms Recently, numerous practical and theoretical studies in evolutionary biology aim at calculating the extent to which reticulationfor example horizontal gene transfer, hybridization, or recombinationhas influenced the evolution for a set of presentday species. It has been shown that inferring the minimum number of hybridization events that is needed to simultaneously explain the evolutionary history for a set of trees is an NPhard and also fixedparameter tractable problem. In this paper, we give a new fixedparameter algorithm for computing the minimum number of hybridization events for when two rooted binary phylogenetic trees are given. This newly developed algorithm is based on interleavinga technique using repeated kernelization steps that are applied throughout the exhaustive search part of a fixedparameter algorithm. To show that our algorithm runs efficiently to be applicable to a wide range of practical problem instances, we apply it to a grass data set and highlight the significant improvements in terms of running times in comparison to an algorithm which has previously been implemented.