 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
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.
Cited literature [15 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-01116231
Contributor : Philippe Gambette Connect in order to contact the contributor
Submitted on : Friday, February 13, 2015 - 10:20:07 AM
Last modification on : Tuesday, October 19, 2021 - 11:26:19 AM
Long-term archiving on: : Thursday, May 28, 2015 - 11:56:51 AM
Contributor : Philippe Gambette Connect in order to contact the contributor
Submitted on : Friday, February 13, 2015 - 10:20:07 AM
Last modification on : Tuesday, October 19, 2021 - 11:26:19 AM
Long-term archiving on: : Thursday, May 28, 2015 - 11:56:51 AM
File
2015GambetteGunawanLabarreVial...
Files produced by the author(s)