An index for sequencing reads based on the colored de Bruijn graph

DOI10.1007/978-3-030-32686-9_22MaRDI QIDQ6536263zbMATH OpenFDO

Authors Diego Díaz-Domínguez

Publication date 19 April 2024

zbMATH Keywords

DNA sequencingde Bruijn graphscompact data structures

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Recommendations

• Linking indexing data structures to de Bruijn graphs: construction and update
• From indexing data structures to de Bruijn graphs
• Simulating the DNA overlap graph in succinct space
• Compression algorithm for colored de Bruijn graphs

Cites work

• scientific article; zbMATH DE number 2230164 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• A guide to graph colouring. Algorithms and applications
• Bloom filter trie -- a data structure for pan-genome storage
• Combinatorial algorithms for DNA sequence assembly
• Efficient Storage and Retrieval by Content and Address of Static Files
• Practical entropy-compressed rank/select dictionary
• Rainbowfish: a succinct colored de Bruijn graph representation
• Recoloring the colored de Bruijn graph
• Succinct de Bruijn graphs
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets

Cited in

(3)

• Compression algorithm for colored de Bruijn graphs
• Fulgor: a fast and compact \(k\)-mer index for large-scale matching and color queries
• Comparative genomics with succinct colored de Bruijn graphs

This page was built for publication: An index for sequencing reads based on the colored de Bruijn graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536263)