Locating a Tree in a Phylogenetic Network in Quadratic Time
Data Structures and Algorithms
2022-08-29 v1 Computational Engineering, Finance, and Science
Populations and Evolution
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
@article{arxiv.1502.03379,
title = {Locating a Tree in a Phylogenetic Network in Quadratic Time},
author = {Philippe Gambette and Andreas D. M. Gunawan and Anthony Labarre and Stéphane Vialette and Louxin Zhang},
journal= {arXiv preprint arXiv:1502.03379},
year = {2022}
}
Comments
Accepted to RECOMB 2015