Space efficient merging of de Bruijn graphs and Wheeler graphs
From MaRDI portal
Publication:2118200
DOI10.1007/s00453-021-00855-2OpenAlexW3183732978MaRDI QIDQ2118200
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.03675
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Wheeler graphs: a framework for BWT-based data structures
- FM-index of alignment with gaps
- Lightweight merging of compressed indices based on BWT variants
- Engineering a lightweight external memory suffix array construction algorithm
- An extension of the Burrows-Wheeler transform
- Compressed representations of sequences and full-text indexes
- The compressed permuterm index
- Compressing and indexing labeled trees, with applications
- Indexing compressed text
- Lightweight Data Indexing and Compression in External Memory
- An Eulerian path approach to DNA fragment assembly
- Succinct de Bruijn Graphs
- Optimal Lower and Upper Bounds for Representing Sequences
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs
- Rainbowfish: A Succinct Colored de Bruijn Graph Representation
- Regular Languages meet Prefix Sorting
- Lightweight BWT and LCP Merging via the Gap Algorithm
- Indexing Variation Graphs
- Bidirectional Variable-Order de Bruijn Graphs
- Recoloring the colored de Bruijn graph
This page was built for publication: Space efficient merging of de Bruijn graphs and Wheeler graphs
