Deciding the existence of a cherry-picking sequence is hard on two trees
Preprint
Abstract
Here we show that deciding whether two rooted binary phylogenetic trees on the same set of taxa permit a cherry-picking sequence, a special type of elimination order on the taxa, is NP-complete. This improves on an earlier result which proved hardness for eight or more trees. Via a known equivalence between cherry-picking sequences and temporal phylogenetic networks, our result proves that it is NP-complete to determine the existence of a temporal phylogenetic network that contains topological embeddings of both trees. The hardness result also greatly strengthens previous inapproximability results for the minimum temporal-hybridization number problem. This is the optimization version of the problem where we wish to construct a temporal phylogenetic network that topologically embeds two given rooted binary phylogenetic trees and that has a minimum number of indegree-2 nodes, which represent events such as hybridization and horizontal gene transfer. We end on a positive note, pointing out that fixed parameter tractability results in this area are likely to ensure the continued relevance of the temporal phylogenetic network model.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- On the existence of a cherry-picking sequenceTheoretical Computer Science, 2018
- Kernelizations for the hybridization number problem on multiple nonbinary treesJournal of Computer and System Sciences, 2016
- On Tree-Based Phylogenetic NetworksJournal of Computational Biology, 2016
- Horizontal gene transfer: building the web of lifeNature Reviews Genetics, 2015
- Cherry Picking: A Characterization of the Temporal Hybridization Number for a Set of PhylogeniesBulletin of Mathematical Biology, 2013
- Networks: expanding evolutionary thinkingTrends in Genetics, 2013
- On the complexity of computing the temporal hybridization number for two phylogeniesDiscrete Applied Mathematics, 2013
- Locating a tree in a phylogenetic networkInformation Processing Letters, 2010
- Path lengths in tree-child time consistent hybridization networksInformation Sciences, 2010
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991