"Haplotype Inferring via Galled-Tree Networks Is NP-Complete."

Arvind Gupta et al. (2010)

> Home

Details and statistics

DOI: 10.1089/CMB.2009.0117

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcb/GuptaKMSZ10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcb/GuptaKMSZ10
Arvind Gupta, Mohammad M. Karimi, Ján Manuch, Ladislav Stacho, Xiaohong Zhao:
Haplotype Inferring via Galled-Tree Networks Is NP-Complete. J. Comput. Biol. 17(10): 1435-1449 (2010)

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.