Cargando…
An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model
BACKGROUND: Maximum parsimony reconciliation in the duplication-transfer-loss model is widely used in studying the evolutionary histories of genes and species and in studying coevolution of parasites and their hosts and pairs of symbionts. While efficient algorithms are known for finding maximum par...
Autores principales: | Santichaivekin, Santi, Mawhorter, Ross, Libeskind-Hadas, Ran |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6915856/ https://www.ncbi.nlm.nih.gov/pubmed/31842734 http://dx.doi.org/10.1186/s12859-019-3203-9 |
Ejemplares similares
-
Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model
por: Mawhorter, Ross, et al.
Publicado: (2019) -
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) -
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model
por: Bork, Daniel, et al.
Publicado: (2017) -
DTL reconciliation repair
por: Ma, Weiyun, et al.
Publicado: (2017)