A partial, greedy-colored de Bruijn graph index stores a read set at about 0.53 bytes per nucleotide and reconstructs more than 99% of unambiguous reads.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
An Index for Sequencing Reads Based on The Colored de Bruijn Graph
A partial, greedy-colored de Bruijn graph index stores a read set at about 0.53 bytes per nucleotide and reconstructs more than 99% of unambiguous reads.