Bidirectional Variable-Order de Bruijn Graphs

DOI10.1142/S0129054118430037MaRDI QIDQ5384620zbMATH OpenOpenAlexWikidataFDO

Authors Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali, Simon J. Puglisi

Publication date 24 June 2019

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054118430037

zbMATH Keywords

de Bruijn graphsBurrows-Wheeler transformbidirectional FM-index

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• Bidirectional variable-order de Bruijn graphs
• Generalized de Bruijn graphs
• scientific article; zbMATH DE number 827972
• Generalized de Bruijn graphs
• Fully dynamic de Bruijn graphs
• scientific article; zbMATH DE number 7559178
• scientific article; zbMATH DE number 1279025
• Shifted de Bruijn graphs
• Generalized de Bruijn digraphs
• Bijections in de Bruijn graphs.

Cites work

• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• scientific article; zbMATH DE number 3095523 (Why is no real title available?)
• An Eulerian path approach to DNA fragment assembly
• Approximate string matching using a bidirectional index
• Bidirectional search in a string with wavelet trees and bidirectional matching statistics
• Compressed representations of sequences and full-text indexes
• Compressed suffix trees with full functionality
• Fully compressed suffix trees
• Fully dynamic de Bruijn graphs
• Indexing compressed text
• Indexing variation graphs
• Lightweight algorithms for constructing and inverting the BWT of string collections
• New algorithms on wavelet trees and applications to information retrieval
• Permuted Longest-Common-Prefix Array
• Practical compressed suffix trees
• Succinct de Bruijn graphs
• Suffix Arrays: A New Method for On-Line String Searches
• Versatile succinct representations of the bidirectional Burrows-Wheeler transform

Cited in

(9)

• scientific article; zbMATH DE number 7559178 (Why is no real title available?)
• Linear time construction of indexable founder block graphs
• Indexing variation graphs
• Bidirectional variable-order de Bruijn graphs
• Succinct de Bruijn graphs
• Space efficient merging of de Bruijn graphs and Wheeler graphs
• Space-efficient merging of succinct de Bruijn graphs
• Linking indexing data structures to de Bruijn graphs: construction and update
• Rainbowfish: a succinct colored de Bruijn graph representation

Describes a project that uses

Uses Software

• IDBA
• MEGAHIT
• Meta-IDBA
• IDBA-UD
• SPAdes

This page was built for publication: Bidirectional Variable-Order de Bruijn Graphs

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