nicolaprezza / BWTILLinks
BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
☆25Updated 3 years ago
Alternatives and similar repositories for BWTIL
Users that are interested in BWTIL are comparing it to the libraries listed below
Sorting:
- Dynamic succinct/compressed data structures☆112Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Relative data structures based on the BWT☆12Updated 7 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Succinct Data Structure Library 3.0☆94Updated 3 months ago
- A tool for merging large BWTs☆26Updated 4 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago
- Compact Tree Representation☆16Updated 8 years ago
- A space-efficient compressor based on the Re-Pair grammar☆11Updated 8 years ago
- Compact Data Structures Library☆127Updated 10 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 3 weeks ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 2 weeks ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Bit packed vector of integral values☆27Updated 6 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Optimal suffix sorting and LCP array construction for constant alphabets [IPL 2017]☆9Updated 6 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated this week
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆12Updated 3 weeks ago
- Parallel Lightweight Suffix Array Algorithm.☆18Updated 8 years ago