Abstract
A fundamental problem in the study of phylogenetic networks is to determine whether or not a given phylogenetic network contains a given phylogenetic tree. We develop a quadratic-time algorithm for this problem for binary nearly-stable phylogenetic networks. We also show that the number of reticulations in a reticulation visible or nearly stable phylogenetic network is bounded from above by a function linear in the number of taxa.
Cite
CITATION STYLE
Gambette, P., Gunawan, A. D. M., Labarre, A., Vialette, S., & Zhang, L. (2015). Locating a tree in a phylogenetic network in quadratic time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9029, pp. 96–107). Springer Verlag. https://doi.org/10.1007/978-3-319-16706-0_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
