On the existence of a cherrypicking sequence
Abstract
Recently, the minimum number of reticulation events that is required to simultaneously embed a collection P of rooted binary phylogenetic trees into a socalled temporal network has been characterized in terms of cherrypicking sequences. Such a sequence is a particular ordering on the leaves of the trees in P. However, it is wellknown that not all collections of phylogenetic trees have a cherrypicking sequence. In this paper, we show that the problem of deciding whether or not P has a cherrypicking sequence is NPcomplete for when P contains at least eight rooted binary phylogenetic trees. Moreover, we use automata theory to show that the problem can be solved in polynomial time if the number of trees in P and the number of cherries in each such tree are bounded by a constant.
 Publication:

arXiv eprints
 Pub Date:
 December 2017
 arXiv:
 arXiv:1712.04127
 Bibcode:
 2017arXiv171204127D
 Keywords:

 Quantitative Biology  Populations and Evolution;
 Computer Science  Data Structures and Algorithms
 EPrint:
 Accepted for publication in Theoretical Computer Science