Which phylogenetic networks are merely trees with additional arcs?
Populations and Evolution
2015-05-25 v3 Data Structures and Algorithms
Abstract
A binary phylogenetic network may or may not be obtainable from a tree by the addition of directed edges (arcs) between tree arcs. Here, we establish a precise and easily tested criterion (based on `2-SAT') that efficiently determines whether or not any given network can be realized in this way. Moreover, the proof provides a polynomial-time algorithm for finding one or more trees (when they exist) on which the network can be based. A number of interesting consequences are presented as corollaries; these lead to some further relevant questions and observations, which we outline in the conclusion.
Cite
@article{arxiv.1502.07045,
title = {Which phylogenetic networks are merely trees with additional arcs?},
author = {Andrew R. Francis and Mike Steel},
journal= {arXiv preprint arXiv:1502.07045},
year = {2015}
}
Comments
The final version of this article will appear in Systematic Biology. 20 pages, 7 figures