Login / Signup

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

Daniel BorkRicson ChengJincheng WangJean SungRan Libeskind-Hadas
Published in: Algorithms Mol. Biol. (2017)
Keyphrases
  • probabilistic model
  • computational complexity
  • decision making
  • np complete
  • information retrieval
  • cost function
  • probability distribution
  • management system
  • information extraction
  • decision makers
  • itemsets