mpetri / FM-IndexLinks
FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental results.
☆107Updated 10 years ago
Alternatives and similar repositories for FM-Index
Users that are interested in FM-Index are comparing it to the libraries listed below
Sorting:
- Dynamic succinct/compressed data structures☆111Updated last year
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Succinct Data Structure Library 3.0☆95Updated 2 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Succinct Data Structure Library☆107Updated 12 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated this week
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 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
- Compact Data Structures Library☆101Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆265Updated 3 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- TU DOrtmund lossless COMPression framework☆19Updated last year
- A tool for merging large BWTs☆25Updated 4 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Parallel Lightweight Suffix Array Algorithm.☆18Updated 8 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated 4 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- BEETL☆96Updated 2 years ago
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Extremely fast inplace radix sort☆42Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago