patflick / psacLinks
Parallel Suffix Array, LCP Array, and Suffix Tree Construction
☆51Updated 6 years ago
Alternatives and similar repositories for psac
Users that are interested in psac 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…☆107Updated 10 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Dynamic succinct/compressed data structures☆111Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Succinct Data Structure Library 3.0☆95Updated 2 months ago
- A library of inverted index data structures☆151Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- Succinct Data Structure Library☆107Updated 12 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 3 months ago
- Compact Tree Representation☆16Updated 8 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆121Updated last year
- FOundation of stXXl and thriLL☆14Updated last year
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 7 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆128Updated 2 years ago
- Simple baselines for "Learned Indexes"☆158Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 5 years ago
- TU DOrtmund lossless COMPression framework☆19Updated last year
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 7 years ago
- A collection of succinct data structures☆210Updated last year
- Paper about the estimation of cardinalities from HyperLogLog sketches☆64Updated 4 years ago