"On the computational complexity of closest genome problems."

Luís Felipe I. Cunha et al. (2020)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2019.04.002

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/CunhaFSKF20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/CunhaFSKF20
Luís Felipe I. Cunha, Pedro Feijão, Vinícius Fernandes dos Santos, Luis Antonio Brasil Kowada, Celina M. H. de Figueiredo:
On the computational complexity of closest genome problems. Discret. Appl. Math. 274: 26-34 (2020)

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.