"The Complexity of Approximate Pattern Matching on de Bruijn Graphs."

Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru (2022)

> Home

Details and statistics

DOI: 10.1007/978-3-031-04749-7_16

access: closed

type: Conference or Workshop Paper

metadata version: 2022-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/recomb/GibneyTA22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/GibneyTA22
Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
The Complexity of Approximate Pattern Matching on de Bruijn Graphs. RECOMB 2022: 263-278

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.