The complexity of approximate pattern matching on de Bruijn graphs (Q2170154)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of approximate pattern matching on de Bruijn graphs |
scientific article |
Statements
The complexity of approximate pattern matching on de Bruijn graphs (English)
0 references
30 August 2022
0 references
approximate pattern matching
0 references
sequence alignment
0 references
de Bruijn graphs
0 references
computational complexity
0 references
0 references
