TripNet: A Method for Constructing Rooted Phylogenetic Networks from Rooted Triplets

The problem of constructing an optimal rooted phylogenetic network from an arbitrary set of rooted triplets is an NP-hard problem. In this paper, we present a heuristic algorithm called TripNet, which tries to construct a rooted phylogenetic network with the minimum number of reticulation nodes from...

Descripción completa

Detalles Bibliográficos
Autores principales: Poormohammadi, Hadi, Eslahchi, Changiz, Tusserkani, Ruzbeh
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4160195/
https://www.ncbi.nlm.nih.gov/pubmed/25208028
http://dx.doi.org/10.1371/journal.pone.0106531

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4160195/
https://www.ncbi.nlm.nih.gov/pubmed/25208028
http://dx.doi.org/10.1371/journal.pone.0106531

Ejemplares similares