Locating a Tree in a Phylogenetic Network in Quadratic Time - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Locating a Tree in a Phylogenetic Network in Quadratic Time

(1) , (2) , (1) , (1) , (2)
1
2

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.
Fichier principal
Vignette du fichier
2015GambetteGunawanLabarreVialetteZhang.pdf (241.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01116231 , version 1 (13-02-2015)

Licence

Copyright

Identifiers

Cite

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⟩
281 View
255 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More