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…☆107Updated 10 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- Dynamic succinct/compressed data structures☆112Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Succinct Data Structure Library☆108Updated 12 years ago
- Compact Tree Representation☆16Updated 8 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆156Updated last year
- FOundation of stXXl and thriLL☆14Updated last year
- Bloom-filter based minimal perfect hash function library☆270Updated 5 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Succinct Data Structure Library 3.0☆99Updated 3 weeks ago
- Compact Data Structures Library☆101Updated 3 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 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)☆88Updated last year
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆17Updated 4 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- A library of inverted index data structures☆151Updated 3 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆130Updated 2 years ago
- A collection of succinct data structures☆211Updated last year
- Burrows-Wheeler-Scott transform☆14Updated 12 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago