Cargando…
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees
BACKGROUND: Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two phylogenetic trees is a hard computational problem. Even for binary trees, exact solvers struggle to solve ins...
Autores principales: | Iersel, Leo van, Kelk, Steven, Lekić, Nela, Scornavacca, Celine |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4023542/ https://www.ncbi.nlm.nih.gov/pubmed/24884964 http://dx.doi.org/10.1186/1471-2105-15-127 |
Ejemplares similares
-
Finding a most parsimonious or likely tree in a network with respect to an alignment
por: Kelk, Steven, et al.
Publicado: (2018) -
Generation of Binary Tree-Child phylogenetic networks
por: Cardona, Gabriel, et al.
Publicado: (2019) -
Correction: Generation of Binary Tree-Child phylogenetic networks
por: Cardona, Gabriel, et al.
Publicado: (2019) -
Demographic and Behavioral Profiles of Nonbinary and Binary Transgender Youth
por: Todd, Kieran, et al.
Publicado: (2019) -
Applicability of several rooted phylogenetic network algorithms for representing the evolutionary history of SARS-CoV-2
por: Wallin, Rosanne, et al.
Publicado: (2021)