"On the computational complexity of sequence design problems."

William E. Hart (1997)

> Home

Details and statistics

DOI: 10.1145/267521.267539

access: closed

type: Conference or Workshop Paper

metadata version: 2019-05-13

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/recomb/Hart97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/Hart97
William E. Hart:
On the computational complexity of sequence design problems. RECOMB 1997: 128-136

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.