Locating a Tree in a Phylogenetic Network in Quadratic Time

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.
Document type :
Conference papers
RECOMB 2015, Apr 2015, Varsovie, Poland. Springer, Proceedings of the 19th Annual International Conference on Research in Computational Molecular Biology, 9029, pp.96-107, 2015, LNCS. <10.1007/978-3-319-16706-0_12>
Liste complète des métadonnées


https://hal-upec-upem.archives-ouvertes.fr/hal-01116231
Contributor : Philippe Gambette <>
Submitted on : Friday, February 13, 2015 - 10:20:07 AM
Last modification on : Monday, March 7, 2016 - 9:38:08 PM
Document(s) archivé(s) le : Thursday, May 28, 2015 - 11:56:51 AM

File

2015GambetteGunawanLabarreVial...
Files produced by the author(s)

Licence


Copyright

Identifiers

Collections

Citation

Philippe Gambette, Andreas D.M. Gunawan, Anthony Labarre, Stéphane Vialette, Louxin Zhang. Locating a Tree in a Phylogenetic Network in Quadratic Time. RECOMB 2015, Apr 2015, Varsovie, Poland. Springer, Proceedings of the 19th Annual International Conference on Research in Computational Molecular Biology, 9029, pp.96-107, 2015, LNCS. <10.1007/978-3-319-16706-0_12>. <hal-01116231>

Share

Metrics

Record views

290

Document downloads

161