Treffer: Inferring a level-1 phylogenetic network from a dense set of rooted triplets
Genome Institute of Singapore, 60 Biopolis Street, Genome, Singapore 138672, Singapore
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Operational research. Management
Weitere Informationen
We consider the following problem: Given a set J of rooted triplets with leaf set L, determine whether there exists a phylogenetic network consistent with J, and if so, construct one. We show that if no restrictions are placed on the hybrid nodes in the solution, the problem is trivially solved in polynomial time by a simple sorting network-based construction. For the more interesting (and biologically more motivated) case where the solution is required to be a level-1 phylogenetic network, we present an algorithm solving the problem in O(|J|2) time when J is dense, i.e., when J contains at least one rooted triplet for each cardinality three subset of L. We also give an O(lJl5/3)-time algorithm for finding the set of all phylogenetic networks having a single hybrid node attached to exactly one leaf (and having no other hybrid nodes) that are consistent with a given dense set of rooted triplets.