Polynomial-Time Algorithms for Phylogenetic Inference Problems

@inproceedings{Iersel2018PolynomialTimeAF,
  title={Polynomial-Time Algorithms for Phylogenetic Inference Problems},
  author={Leo van Iersel and Remie Janssen and Mark Jones and Yukihiro Murakami and Norbert Zeh},
  booktitle={AlCoB},
  year={2018}
}
A common problem in phylogenetics is to try to infer a species phylogeny from gene trees. We consider different variants of this problem. The first variant, called Unrestricted Minimal Episodes Inference, aims at inferring a species tree based on a model of speciation and duplication where duplications are clustered in duplication episodes. The goal is to minimize the number of such episodes. The second variant, Parental Hybridization, aims at inferring a species network based on a model of… Expand
The rigid hybrid number for two phylogenetic trees
TLDR
This paper characterize when two trees can be rigidly displayed by a certain type of phylogenetic network called a temporal tree-child network in terms of fork-picking sequences, and presents an infinite family of pairs of trees which demonstrates that the difference between the rigid hybrid number and the temporal-hybrid number for two phylogenetic trees on the same set of n leaves can grow at least linearly with n. Expand
Weakly displaying trees in temporal tree-child network
TLDR
This paper characterize when two trees can be rigidly displayed by a temporal tree-child network in terms of fork-picking sequences, a concept that is closely related to that of cherry- picking sequences. Expand
Minimizing genomic duplication episodes
TLDR
An efficient quadratic time algorithm to solve the problem of genomic duplication clustering in which input gene trees are rooted, episode locations are restricted to preserve the minimal number of single gene duplications, and clustering rules are described by minimum episodes method. Expand
Heading in the right direction? Using head moves to traverse phylogenetic network space
TLDR
It is proved that finding the shortest sequence of head moves between two networks is NP-hard and makes head moves a good candidate for local search heuristics. Expand
Reconstructibility of unrooted level-k phylogenetic networks from distances
TLDR
It is proved that level-$1$ networks and level-$2 networks are reconstructible from their shortest distances and multisets of distances, respectively, and it is shown that, in general, networks of level higher than~$1$ are not reconstructable from shortest distances or from their multiset of distances. Expand
Solving Phylogenetic Network Containment Problems using Cherry-picking Sequences
Phylogenetic networks are used to represent evolutionary scenarios in biology and linguistics. To find the most probable scenario, it may be necessary to compare candidate networks: to distinguishExpand

References

SHOWING 1-10 OF 36 REFERENCES
From Gene Trees to Species Trees
TLDR
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model and proposes a heuristic method that is significantly better than the existing program in Page's GeneTree 1.0 that starts the search from a random tree. Expand
Computing the minimum number of hybridization events for a consistent evolutionary history
TLDR
The main results of this paper show that computing this smallest number of hybridization events required to explain a given (input) set of data in a single (hybrid) phylogeny is APX- hard, and thus NP-hard, in the case the input is a collection of phylogenetic trees on sets of present-day species. Expand
A Reduction Algorithm for Computing The Hybridization Number of Two Trees
TLDR
A new reduction-based algorithm for computing the minimum number of hybridization events, when the initial data set consists of two trees, which always gives the exact solution and runs efficiently on many real biological problems. Expand
Efficient Algorithms for Genomic Duplication Models
TLDR
This work studies the method of clustering called minimum episodes for several models of allowed evolutionary scenarios with a focus on interval models in which every gene duplication has an interval consisting of allowed locations in the species tree. Expand
On the Multiple Gene Duplication Problem
TLDR
It is shown that the general form of this problem is NP-hard and various parameterized versions are hard for the complexity class W[1]. Expand
Reconciliation with non-binary species trees.
TLDR
This work presents the first formal algorithm for reconciling binary gene trees with non-binary species trees under a duplication-loss parsimony model, and presents a dynamic programming algorithm for a combined loss model, in which losses in sibling species may be represented as a single loss in the common ancestor. Expand
Reconstruction of ancient molecular phylogeny.
TLDR
Under the assumption that differences among gene trees can be explained by gene duplications, and consequent losses, it is developed a method to obtain the global phylogeny minimizing the total number of postulated duplications and losses and to trace back such individual gene duplication to global genome duplications. Expand
Linear-Time Algorithms for the Multiple Gene Duplication Problems
TLDR
Two variations of the MULTIPLE GENE DUPLICATION problems: the EPISODE-CLUSTERING (EC) problem and the MINIMUM EPISODES (ME) problem are studied and an optimal linear-time algorithm is proposed. Expand
Hybridization Number on Three Rooted Binary Trees is EPT
TLDR
The techniques generalize to more than three input trees with the exception of one key lemma that maps nodes in the network to tree nodes and, thus, minimizes the amount of guessing involved in constructing the network. Expand
Locating Multiple Gene Duplications through Reconciled Trees
TLDR
The first exact and efficient algorithm that determines a minimum number of locations for gene duplication events from the gene trees on the species tree is introduced, which can provide hypotheses for precise locations of large-scale gene duplication Events with data from relatively few gene trees. Expand
...
1
2
3
4
...