On the existence of a cherry-picking sequence

  title={On the existence of a cherry-picking sequence},
  author={Janosch D{\"o}cker and Simone Linz},
  journal={Theor. Comput. Sci.},
1 Citations

Figures from this paper


Cherry Picking: A Characterization of the Temporal Hybridization Number for a Set of Phylogenies
The first characterization of the problem for the minimum–temporal-hybridization number for a set of rooted binary phylogenetic trees being arbitrarily large is given, in terms of cherries and the existence of a particular type of sequence.
Computing the minimum number of hybridization events for a consistent evolutionary history
On the complexity of computing the temporal hybridization number for two phylogenies
Comparison of Tree-Child Phylogenetic Networks
An injective representation of these networks as multisets of vectors of natural numbers, their path multiplicity vectors are provided, and this representation is used to define a distance on this class that extends the well-known Robinson-Foulds distance for phylogenetic trees and to give an alignment method for pairs of networks in this class.
This chapter focuses on the problem for when the initial set consists of two rooted binary phylogenetic trees, and finds a general solution rather than one that is restricted in some way.
A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees
Here, we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6rr!) · poly(n),
Hybrids in real time.
A simple result is presented to show that, despite the presence of Reticulation, there is always a well-defined underlying tree that corresponds to those parts of life that do not have a history of reticulation.
Accurate Reconstruction of Insertion-Deletion Histories by Statistical Phylogenetics
Results of a simulation-based benchmark of several methods for reconstruction of indel history are reported, including a relatively new algorithm for statistical marginalization of MSAs that sums over a stochastically-sampled ensemble of the most probable evolutionary histories.
Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees
Simulation results on biological and simulated datasets show that the new practical method presented is more efficient and robust than an existing method to compute the exact hybridization number.
Bounding the Number of Hybridisation Events for a Consistent Evolutionary History
In this paper, the theoretical performance of some related bounds that result when merging pairs of trees into networks are described.