Back to search

Article

Lossless Indexing with Counting de Bruijn Graphs

2021-11-11

Abstract excerpt

Sequencing data is rapidly accumulating in public repositories. Making this resource accessible for interactive analysis at scale requires efficient approaches for its storage and indexing. There have recently been remarkable advances in building compressed representations of annotated (or colored ) de Bruijn graphs for efficiently indexing k-mer sets. However, approaches for representing quantitative attribute...

Topics

Open a Topic to create a Post that cites this publication.

Identifiers and source

Literature Corpus work
4ad7ba44-d706-50c8-9ffc-093cf5bd24fa
DOI
10.1101/2021.11.09.467907
Open publication

Related research

Semantic proximity does not establish scientific evidence.

Click a neighbor to travelStep 1 · 12 closest
Interactive article relationship graphSelect a related publication card to move it into the centre and load its closest explainable connections. Solid lines are source-backed structured connections. Dashed lines are semantic discovery signals and are not scientific evidence.
Lossless Indexing with Counting de Bruijn GraphsDOI 10.1101/2021.11.09.467907
Select a neighboring publication to make it the new centre.