jamshed / CaPS-SALinks
Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
☆13Updated 2 months ago
Alternatives and similar repositories for CaPS-SA
Users that are interested in CaPS-SA are comparing it to the libraries listed below
Sorting:
- Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)☆24Updated 5 months ago
- Efficient construction of the BWT using string compression☆18Updated 2 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 4 months ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆52Updated this week
- ☆15Updated 2 years ago
- Implementation of a Backpack Quotient Filter☆12Updated last month
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 5 months ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆51Updated last year
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- R-Index-F Library for Pattern Matching☆13Updated last year
- Optimal sequence-to-graph alignment with recombinations☆36Updated 3 weeks ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- ☆25Updated 4 years ago
- Dashing 2 is a fast toolkit for k-mer and minimizer encoding, sketching, comparison, and indexing.☆65Updated last year
- A hash map using the BooPHF perfect hash function☆13Updated 8 years ago
- Rust implementation of VG handle graph☆20Updated last year
- ☆17Updated 2 years ago
- modular k-mer count matrix and Bloom filter construction for large read collections☆84Updated 10 months ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated last month
- GBWT in Rust☆43Updated 4 months ago
- A reimplementation of the WaveFront Alignment algorithm at low memory☆50Updated last year
- De Bruijn graph representation in low memory☆36Updated last year
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆19Updated 2 months ago
- Efficient, parallel compression for terabyte-scale data☆48Updated 3 months ago