c0D3M / Suffix-ArraysLinks
Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,
☆12Updated 6 years ago
Alternatives and similar repositories for Suffix-Arrays
Users that are interested in Suffix-Arrays are comparing it to the libraries listed below
Sorting:
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆109Updated 11 years ago
- Dynamic succinct/compressed data structures☆115Updated last month
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Bloom-filter based minimal perfect hash function library☆274Updated 6 months ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 11 years ago
- Succinct Data Structure Library 3.0☆101Updated last month
- Succinct Data Structure Library☆109Updated 12 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- Burrows-Wheeler-Scott transform☆14Updated 12 years ago
- Compact Data Structures Library☆103Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆158Updated last year
- linear time suffix array construction algorithm☆12Updated 9 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- A collection of succinct data structures☆211Updated 2 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆34Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- A General-Purpose Counting Filter: Counting Quotient Filter☆132Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆121Updated 8 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆68Updated 2 years ago
- SUccinct Retrieval Framework☆21Updated 10 years ago
- Parallel Lightweight Suffix Array Algorithm.☆19Updated 9 years ago
- A library of inverted index data structures☆151Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Compact Data Structures Library☆129Updated 11 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago