Bidirectional Variable-Order de Bruijn Graphs

DOI10.1142/S0129054118430037zbMath1415.68064OpenAlexW2907484836WikidataQ126367395 ScholiaQ126367395MaRDI QIDQ5384620

Veli Mäkinen, Travis Gagie, Marco Previtali, Djamal Belazzougui, 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

Burrows-Wheeler transformde Bruijn graphsbidirectional FM-index

Mathematics Subject Classification ID

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

Related Items (1)

Space efficient merging of de Bruijn graphs and Wheeler graphs

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate string matching using a bidirectional index
• Lightweight algorithms for constructing and inverting the BWT of string collections
• Bidirectional search in a string with wavelet trees and bidirectional matching statistics
• New algorithms on wavelet trees and applications to information retrieval
• Practical compressed suffix trees
• Fully dynamic de Bruijn graphs
• Compressed suffix trees with full functionality
• Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• Fully compressed suffix trees
• Indexing compressed text
• Permuted Longest-Common-Prefix Array
• An Eulerian path approach to DNA fragment assembly
• Succinct de Bruijn Graphs
• Indexing Variation Graphs

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