On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model.

CONCLUSIONS: These intractability results are likely to guide future research on algorithmic aspects of the DLC-reconciliation problem. PMID: 28316640 [PubMed]
Source: Algorithms for Molecular Biology : AMB - Category: Molecular Biology Authors: Tags: Algorithms Mol Biol Source Type: research