An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model
Abstract 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 max...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
BMC
2019-12-01
|
| Edice: | BMC Bioinformatics |
| Témata: | |
| On-line přístup: | https://doi.org/10.1186/s12859-019-3203-9 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|