Cargando…
Refining discordant gene trees
BACKGROUND: Evolutionary studies are complicated by discordance between gene trees and the species tree in which they evolved. Dealing with discordant trees often relies on comparison costs between gene and species trees, including the well-established Robinson-Foulds, gene duplication, and deep coa...
Autores principales: | Górecki, Pawel, Eulenstein, Oliver |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4248651/ https://www.ncbi.nlm.nih.gov/pubmed/25434729 http://dx.doi.org/10.1186/1471-2105-15-S13-S3 |
Ejemplares similares
-
Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem
por: Górecki, Pawel, et al.
Publicado: (2012) -
Genomic duplication problems for unrooted gene trees
por: Paszek, Jarosław, et al.
Publicado: (2016) -
Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence
por: Chaudhary, Ruchi, et al.
Publicado: (2012) -
Consensus properties for the deep coalescence problem and their application for scalable tree search
por: Lin, Harris T, et al.
Publicado: (2012) -
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses
por: Górecki, Pawel, et al.
Publicado: (2011)