Compressed spaced suffix arrays
From MaRDI portal
Publication:2363990
DOI10.1007/s11786-016-0283-zzbMath1378.68032arXiv1312.3422OpenAlexW1717915937MaRDI QIDQ2363990
Daniel Valenzuela, Giovanni Manzini, Travis Gagie
Publication date: 17 July 2017
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.3422
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Better spaced seeds using quadratic residues
- Efficient fully-compressed sequence representations
- Masking patterns in sequences: A new class of motif discovery with don't cares
- Lossless filter for multiple repetitions with Hamming distance
- Decomposing a set of points into chains, with applications to permutation and circle graphs
- Compressed spaced suffix arrays
- Alphabet-Independent Compressed Text Indexing
- Indexing compressed text
- Succinct de Bruijn Graphs
This page was built for publication: Compressed spaced suffix arrays