ocfnash / FM-IndexLinks
C++ implementation of FM Index data structure wrapped in Python
☆14Updated 2 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:
- libsequence: a C++ class library for evolutionary genetic analysis☆53Updated 5 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆87Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Bit packed vector of integral values☆28Updated 10 months ago
- Bloom-filter based minimal perfect hash function library☆269Updated 4 months ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆55Updated 5 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated 2 weeks ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- a minimal C++ interval tree implementation☆237Updated 4 years ago
- A tool for merging large BWTs☆25Updated 5 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Low memory multithreaded hash table☆24Updated 10 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆26Updated 4 years ago
- Ultra fast MSD radix sorter☆10Updated 5 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 2 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- An exploratory implementation of bit overloads of the C++ standard algorithms☆18Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Succinct Data Structure Library☆108Updated 12 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆11Updated 7 years ago
- Succinct Data Structure Library 3.0☆98Updated 3 months ago
- memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping☆64Updated 6 months ago