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

DOI10.1007/978-3-030-32686-9_22zbMATH Open1539.68085MaRDI QIDQ6536263FDOQ6536263

Authors: Diego Díaz-Domínguez 

Publication date: 19 April 2024

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

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)

Cites Work

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

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)