felipelouza / gsa-isLinks
Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
☆26Updated 2 months ago
Alternatives and similar repositories for gsa-is
Users that are interested in gsa-is are comparing it to the libraries listed below
Sorting:
- R-Index-F Library for Pattern Matching☆12Updated last year
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- A tool for merging large BWTs☆24Updated 5 years ago
- gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]☆27Updated 11 months ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆56Updated last year
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆17Updated 7 months ago
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆67Updated 2 years ago
- Efficient construction of the BWT using string compression☆20Updated 8 months ago
- A hash map using the BooPHF perfect hash function☆13Updated 9 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- Fast, Cache-Efficient, and Scalable Queries on Pangenomes☆36Updated 2 months ago
- ☆24Updated 4 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆93Updated last week
- Implementation of a Backpack Quotient Filter☆13Updated 6 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Updated 2 years ago
- A python toolkit for building and querying multi-string BWTs☆27Updated 8 years ago
- Incremental construction of FM-index for DNA sequences☆72Updated last year
- Simple succinct data structures (in Rust)☆53Updated last month
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 2 months ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆86Updated last month
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆59Updated last month
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆28Updated 9 months ago
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 10 months ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 6 months ago
- Self-contained, multi-threaded fasta/q parser☆48Updated 3 weeks ago
- BWT-based index for graphs☆73Updated 10 months ago
- ☆16Updated 2 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago