Space-efficient merging of succinct de Bruijn graphs (Q6536265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7834821
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Space-efficient merging of succinct de Bruijn graphs |
scientific article; zbMATH DE number 7834821 |
Statements
Space-efficient merging of succinct de Bruijn graphs (English)
0 references
19 April 2024
0 references
de Bruijn graphs
0 references
succinct data structures
0 references
merging
0 references
variable order
0 references
colored graphs
0 references
external memory algorithms
0 references
0.9190644025802612
0 references
0.8327317833900452
0 references
0.7679137587547302
0 references
0.7638044953346252
0 references
0.7450653314590454
0 references
