dominikkempa / faster-minuterLinks
Wavelet tree based on a fixed block boosting technique
☆16Updated 4 years ago
Alternatives and similar repositories for faster-minuter
Users that are interested in faster-minuter are comparing it to the libraries listed below
Sorting:
- Implementation of a Backpack Quotient Filter☆12Updated 3 weeks ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 3 weeks ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆13Updated last month
- R-Index-F Library for Pattern Matching☆13Updated 11 months ago
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- A space-efficient compressor based on the Re-Pair grammar☆11Updated 8 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Efficient construction of the BWT using string compression☆18Updated 2 months ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated this week
- Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]☆26Updated 2 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Bit packed vector of integral values☆27Updated 6 months ago
- Succinct Data Structure Library 3.0☆94Updated 3 months ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 4 months ago
- dynamic-updateable-index☆11Updated 9 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated this week
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- ☆20Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆51Updated last year
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago