Cargando…
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems
The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegree two is minimized. However, from a biological point of view accurately inferring the root location in a phylogenetic tr...
Autores principales: | van Iersel, Leo, Kelk, Steven, Stamoulis, Georgios, Stougie, Leen, Boes, Olivier |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6428403/ https://www.ncbi.nlm.nih.gov/pubmed/30956378 http://dx.doi.org/10.1007/s00453-017-0366-5 |
Ejemplares similares
-
Applicability of several rooted phylogenetic network algorithms for representing the evolutionary history of SARS-CoV-2
por: Wallin, Rosanne, et al.
Publicado: (2021) -
Tree-Based Unrooted Phylogenetic Networks
por: Francis, A., et al.
Publicado: (2017) -
Constructing phylogenetic networks via cherry picking and machine learning
por: Bernardini, Giulia, et al.
Publicado: (2023) -
Genomic duplication problems for unrooted gene trees
por: Paszek, Jarosław, et al.
Publicado: (2016) -
SPR Distance Computation for Unrooted Trees
por: Hickey, Glenn, et al.
Publicado: (2008)