ocfnash / FM-Index
C++ implementation of FM Index data structure wrapped in Python
☆13Updated last year
Related projects: ⓘ
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆99Updated 9 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 3 months ago
- Compact Tree Representation☆16Updated 7 years ago
- A compressed, associative, exact, and weighted dictionary for k-mers.☆83Updated 2 weeks ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- A tool for merging large BWTs☆26Updated 3 years ago
- Bit packed vector of integral values☆25Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 7 months ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- Wavelet tree based on a fixed block boosting technique☆14Updated 3 years ago
- Ultra fast MSD radix sorter☆11Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆57Updated last year
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 2 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆42Updated 10 months ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆52Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 3 years ago
- Compact Data Structures Library☆97Updated 2 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 3 years ago
- A C++ implementation of a Generalized Suffix Tree using Ukkonen's algorithm☆23Updated 8 years ago
- A collection of string sorting algorithms☆50Updated 2 years ago
- BWT-based index for graphs☆70Updated 11 months ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- Dynamic succinct/compressed data structures☆111Updated 4 months ago