Cargando…
Exact median-tree inference for unrooted reconciliation costs
BACKGROUND: Solving median tree problems under tree reconciliation costs is a classic and well-studied approach for inferring species trees from collections of discordant gene trees. These problems are NP-hard, and therefore are, in practice, typically addressed by local search heuristics. So far, h...
Autores principales: | Górecki, Paweł, Markin, Alexey, Eulenstein, Oliver |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7593691/ https://www.ncbi.nlm.nih.gov/pubmed/33115401 http://dx.doi.org/10.1186/s12862-020-01700-w |
Ejemplares similares
-
Inferring duplication episodes from unrooted gene trees
por: Paszek, Jarosław, et al.
Publicado: (2018) -
Genomic duplication problems for unrooted gene trees
por: Paszek, Jarosław, et al.
Publicado: (2016) -
Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem
por: Górecki, Pawel, et al.
Publicado: (2012) -
SPR Distance Computation for Unrooted Trees
por: Hickey, Glenn, et al.
Publicado: (2008) -
Tree-Based Unrooted Phylogenetic Networks
por: Francis, A., et al.
Publicado: (2017)