ocfnash / FM-Index
C++ implementation of FM Index data structure wrapped in Python
☆13Updated last year
Related projects ⓘ
Alternatives and complementary repositories for FM-Index
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆103Updated 9 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- A compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated last month
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- A tool for merging large BWTs☆26Updated 3 years ago
- Bit packed vector of integral values☆26Updated last year
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆28Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- Dynamic succinct/compressed data structures☆112Updated 6 months ago
- C/C++ implementation of the Smith-Waterman algorithm by using SIMD operations (e.g SSE4.1)☆23Updated 7 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- libsequence: a C++ class library for evolutionary genetic analysis☆51Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Ultra fast MSD radix sorter☆11Updated 4 years ago
- For details, see the blog post:☆31Updated 11 months ago
- Compact Tree Representation☆16Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 10 months ago
- Relative data structures based on the BWT☆12Updated 6 years 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
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 2 years ago
- BWT-based index for graphs☆71Updated 2 weeks ago
- A C++ implementation of a Generalized Suffix Tree using Ukkonen's algorithm☆23Updated 8 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆252Updated last year
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆58Updated last year