Phylogenetic Networks that Display a Tree Twice
- 135 Downloads
In the last decade, the use of phylogenetic networks to analyze the evolution of species whose past is likely to include reticulation events, such as horizontal gene transfer or hybridization, has gained popularity among evolutionary biologists. Nevertheless, the evolution of a particular gene can generally be described without reticulation events and therefore be represented by a phylogenetic tree. While this is not in contrast to each other, it places emphasis on the necessity of algorithms that analyze and summarize the tree-like information that is contained in a phylogenetic network. We contribute to the toolbox of such algorithms by investigating the question of whether or not a phylogenetic network embeds a tree twice and give a quadratic-time algorithm to solve this problem for a class of networks that is more general than tree-child networks.
KeywordsDisplaying Phylogenetic network Phylogenetic tree Tree-child Tree-path Tree-sibling
We thank the two anonymous referees for their helpful comments.
- Linz S, St. John K, Semple C (2013) Counting trees in a phylogenetic network is #P-complete. SIAM J Comput 42:1768–1776Google Scholar
- McDiarmid C, Semple C, Welsh D (in press) Counting phylogenetic networks. Ann CombGoogle Scholar
- Nakhleh L, Jin G, Zhao F, Mellor-Crummey J (2005) Reconstructing phylogenetic networks using maximum parsimony. In: IEEE computational systems bioinformatics conference, pp 440–442Google Scholar