Space-efficient merging of succinct de Bruijn graphs

DOI10.1007/978-3-030-32686-9_24MaRDI QIDQ6536265zbMATH OpenFDO

Authors Lavinia Egidi, Felipe A. Louza, Giovanni Manzini

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-32686-9_24

zbMATH Keywords

colored graphsde Bruijn graphsexternal memory algorithmsmergingsuccinct data structuresvariable order

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Space efficient merging of de Bruijn graphs and Wheeler graphs
• Succinct de Bruijn graphs
• Lightweight BWT and LCP merging via the gap algorithm
• Bidirectional variable-order de Bruijn graphs
• Bidirectional Variable-Order de Bruijn Graphs

Cites work

• An Eulerian path approach to DNA fragment assembly
• Bidirectional Variable-Order de Bruijn Graphs
• Compressed representations of sequences and full-text indexes
• External memory BWT and LCP computation for sequence collections with applications
• Inducing enhanced suffix arrays for string collections
• Lightweight BWT and LCP merging via the gap algorithm
• 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

This page was built for publication: Space-efficient merging of succinct de Bruijn graphs

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