Cargando…
Netcombin: An algorithm for constructing optimal phylogenetic network from rooted triplets
Phylogenetic networks construction is one the most important challenge in phylogenetics. These networks can present complex non-treelike events such as gene flow, horizontal gene transfers, recombination or hybridizations. Among phylogenetic networks, rooted structures are commonly used to represent...
Autores principales: | Poormohammadi, Hadi, Sardari Zarchi, Mohsen |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7500971/ https://www.ncbi.nlm.nih.gov/pubmed/32947609 http://dx.doi.org/10.1371/journal.pone.0227842 |
Ejemplares similares
-
TripNet: A Method for Constructing Rooted Phylogenetic Networks from Rooted Triplets
por: Poormohammadi, Hadi, et al.
Publicado: (2014) -
CBTH: A New Algorithm for Maximum Rooted Triplets Consistency Problem
por: Poor mohammadi, Hadi, et al.
Publicado: (2020) -
A Survey of Methods for Constructing Rooted Phylogenetic Networks
por: Wang, Juan
Publicado: (2016) -
Do Triplets Have Enough Information to Construct the Multi-Labeled Phylogenetic Tree?
por: Hassanzadeh, Reza, et al.
Publicado: (2014) -
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters
por: Gambette, Philippe, et al.
Publicado: (2016)