Cargando…
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model
BACKGROUND: Phylogenetic tree reconciliation is a widely-used method for inferring the evolutionary histories of genes and species. In the duplication-loss-coalescence (DLC) model, we seek a reconciliation that explains the incongruence between a gene and species tree using gene duplication, loss, a...
Autores principales: | Bork, Daniel, Cheng, Ricson, Wang, Jincheng, Sung, Jean, Libeskind-Hadas, Ran |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5349084/ https://www.ncbi.nlm.nih.gov/pubmed/28316640 http://dx.doi.org/10.1186/s13015-017-0098-8 |
Ejemplares similares
-
Hierarchical clustering of maximum parsimony reconciliations
por: Mawhorter, Ross, et al.
Publicado: (2019) -
Maximum parsimony reconciliation in the DTLOR model
por: Liu, Jingyi, et al.
Publicado: (2021) -
Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model
por: Mawhorter, Ross, et al.
Publicado: (2019) -
Most parsimonious reconciliation in the presence of gene duplication, loss, and deep coalescence using labeled coalescent trees
por: Wu, Yi-Chieh, et al.
Publicado: (2014) -
An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model
por: Santichaivekin, Santi, et al.
Publicado: (2019)