scientific article; zbMATH DE number 7559028
From MaRDI portal
Publication:5090335
DOI10.4230/LIPIcs.WABI.2018.10zbMath1494.92085arXiv1805.06821MaRDI QIDQ5090335
Felipe A. Louza, Giovanni Manzini, Lavinia Egidi, Guilherme P. Telles
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1805.06821
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burrows-Wheeler transformmaximal repeatslongest common prefix arrayall pairs suffix-prefix overlapssuccinct de Bruijn graph
Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)
Related Items (4)
A simple algorithm for computing the document array ⋮ Lightweight merging of compressed indices based on BWT variants ⋮ The alternating BWT: an algorithmic perspective ⋮ Space efficient merging of de Bruijn graphs and Wheeler graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Lightweight algorithms for constructing and inverting the BWT of string collections
- Inducing enhanced suffix arrays for string collections
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
- An efficient algorithm for the all pairs suffix-prefix problem
- Divide and conquer computation of the multi-string BWT and LCP array
- An external-memory algorithm for string graph construction
- Engineering a lightweight external memory suffix array construction algorithm
- An extension of the Burrows-Wheeler transform
- Lightweight LCP construction for very large collections of strings
- An improved algorithm for the all-pairs suffix-prefix problem
- Bidirectional Variable-Order de Bruijn Graphs
- Compressed representations of sequences and full-text indexes
- Fast Lightweight Suffix Array Construction and Checking
- Algorithms on Strings, Trees and Sequences
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- Succinct de Bruijn Graphs
- Lightweight BWT and LCP Merging via the Gap Algorithm
- Compressed suffix trees
- Linear time construction of compressed text indices in compact space
- LCP Array Construction in External Memory
- Algorithm Theory - SWAT 2004
This page was built for publication:
