Succinct de Bruijn Graphs

DOI10.1007/978-3-642-33122-0_18zbMath1414.68020OpenAlexW6247929MaRDI QIDQ4916912

Kunihiko Sadakane, Alexander Bowe, Tetsuo Shibuya, Taku Onodera

Publication date: 26 April 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://id.nii.ac.jp/1013/00005806/

Mathematics Subject Classification ID

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

Related Items (23)

Compressed spaced suffix arrays ⋮ Representation of $$k$$-mer Sets Using Spectrum-Preserving String Sets ⋮ Bidirectional Variable-Order de Bruijn Graphs ⋮ Shifted de Bruijn Graphs ⋮ Wheeler graphs: a framework for BWT-based data structures ⋮ Spectrum preserving tilings enable sparse and modular reference indexing ⋮ On representing the degree sequences of sublogarithmic-degree Wheeler graphs ⋮ Linking indexing data structures to de Bruijn graphs: construction and update ⋮ FM-index of alignment with gaps ⋮ Fixed block compression boosting in FM-indexes: theory and practice ⋮ Computing the multi-string BWT and LCP array in external memory ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree ⋮ On the Hardness and Inapproximability of Recognizing Wheeler Graphs ⋮ Lightweight merging of compressed indices based on BWT variants ⋮ Wheeler languages ⋮ Rainbowfish: A Succinct Colored de Bruijn Graph Representation ⋮ Disentangled Long-Read De Bruijn Graphs via Optical Maps ⋮ Solving string problems on graphs using the labeled direct product ⋮ A tale of optimizing the space taken by de Bruijn graphs ⋮ Space efficient merging of de Bruijn graphs and Wheeler graphs ⋮ On the complexity of recognizing Wheeler graphs

This page was built for publication: Succinct de Bruijn Graphs