Skip to Main content Skip to Navigation
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.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

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 : Wednesday, February 26, 2020 - 7:06:07 PM
Long-term archiving on: : Thursday, May 28, 2015 - 11:56:51 AM

File

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

Licence


Copyright

Identifiers

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. pp.96-107, ⟨10.1007/978-3-319-16706-0_12⟩. ⟨hal-01116231⟩

Share

Metrics

Record views

601

Files downloads

442