Cargando…
Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model
BACKGROUND: Reconciliation methods are widely used to explain incongruence between a gene tree and species tree. However, the common approach of inferring maximum parsimony reconciliations (MPRs) relies on user-defined costs for each type of event, which can be difficult to estimate. Prior work has...
Autores principales: | Mawhorter, Ross, Liu, Nuo, Libeskind-Hadas, Ran, Wu, Yi-Chieh |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6916210/ https://www.ncbi.nlm.nih.gov/pubmed/31842732 http://dx.doi.org/10.1186/s12859-019-3206-6 |
Ejemplares similares
-
An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model
por: Santichaivekin, Santi, et al.
Publicado: (2019) -
Hierarchical clustering of maximum parsimony reconciliations
por: Mawhorter, Ross, et al.
Publicado: (2019) -
Pareto-optimal phylogenetic tree reconciliation
por: Libeskind-Hadas, Ran, et al.
Publicado: (2014) -
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model
por: Bork, Daniel, et al.
Publicado: (2017) -
Maximum parsimony reconciliation in the DTLOR model
por: Liu, Jingyi, et al.
Publicado: (2021)