Construction of a de Bruijn graph for assembly from a truncated suffix tree (Q2799166)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Construction of a de Bruijn graph for assembly from a truncated suffix tree |
scientific article; zbMATH DE number 6566771
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of a de Bruijn graph for assembly from a truncated suffix tree |
scientific article; zbMATH DE number 6566771 |
Statements
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (English)
0 references
8 April 2016
0 references
stringology
0 references
text algorithms
0 references
indexing data structures
0 references
de Bruijn graph
0 references
assembly
0 references
space complexity
0 references
dynamic update
0 references
0.8724672198295593
0 references
0.866641640663147
0 references
0.7687445282936096
0 references
0.7558502554893494
0 references
0.7258322834968567
0 references
