mideind / IcegramsLinks
A fast, compact trigram library for Icelandic
☆11Updated last month
Alternatives and similar repositories for Icegrams
Users that are interested in Icegrams are comparing it to the libraries listed below
Sorting:
- Succinct Data Structure Library 3.0☆94Updated 3 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- Implementation of a Backpack Quotient Filter☆12Updated last week
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated this week
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated last week
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- External memory suffix array construction using inducing☆11Updated 4 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
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- R-Index-F Library for Pattern Matching☆13Updated 11 months ago
- C++17 Implementation of Dynamic Filter Trie☆8Updated 3 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆37Updated 2 years ago
- Compact Tree Representation☆16Updated 8 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated 11 months ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆51Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- Essential C++ utilities.☆15Updated last month
- Bit packed vector of integral values☆27Updated 5 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated this week
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago