%0 Journal Article
%T On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model
%A Daniel Bork
%A Jean Sung
%A Jincheng Wang
%A Ricson Cheng
%J Archive of "Algorithms for Molecular Biology : AMB".
%D 2017
%R 10.1186/s13015-017-0098-8
%X 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, and deep coalescence events. In the maximum parsimony framework, costs are associated with these event types and a reconciliation is sought that minimizes the total cost of the events required to map the gene tree onto the species tree
%K Phylogenetic reconciliation
%K Duplication-loss-coalescence model
%K NP-hardness
%K APX-hardness
%U https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5349084/