ocfnash / FM-IndexLinks
C++ implementation of FM Index data structure wrapped in Python
☆13Updated 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:
- Bit packed vector of integral values☆27Updated 4 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- 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☆49Updated 5 years ago
- External memory suffix array construction using inducing☆11Updated 4 years ago
- Ultra fast MSD radix sorter☆11Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated this week
- Dynamic succinct/compressed data structures☆112Updated last year
- C/C++ implementation of the Smith-Waterman algorithm by using SIMD operations (e.g SSE4.1)☆23Updated 8 years ago
- A collection of string sorting algorithms☆55Updated 3 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- For details, see the blog post:☆32Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- This repository contains components that will support percolation via OpenCL and CUDA☆32Updated 3 years ago
- Compact Data Structures Library☆100Updated 2 years ago
- Simply feedforward neural network☆19Updated 8 years ago