"On the computational complexity of the maximum parsimony reconciliation ..."

Daniel Bork et al. (2017)

> Home

Details and statistics

DOI: 10.1186/S13015-017-0098-8

access: open

type: Journal Article

metadata version: 2020-03-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/almob/BorkCWSL17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/almob/BorkCWSL17
Daniel Bork, Ricson Cheng, Jincheng Wang, Jean Sung, Ran Libeskind-Hadas:
On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. Algorithms Mol. Biol. 12(1): 6:1-6:12 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.