jamshed / CaPS-SALinks
Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
☆13Updated this week
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 3 months ago
- Efficient construction of the BWT using string compression☆18Updated 2 weeks ago
- Fast and cache-efficient full-text pangenome index☆29Updated this week
- modified from gitlab.com/manzai/Big-BWT to support fasta files☆9Updated 4 months ago
- ☆8Updated 3 years ago
- Implementation of a Backpack Quotient Filter☆12Updated 2 weeks ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆24Updated last month
- ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.☆50Updated last week
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆52Updated 3 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- R-Index-F Library for Pattern Matching☆13Updated 10 months ago
- SAPLING: Suffix Array Piecewise Linear INdex for Genomics☆25Updated 4 years ago
- Efficient, parallel compression for terabyte-scale data☆46Updated last month
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- ☆17Updated 2 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- ☆25Updated 4 years ago
- MONI: A Pangenomic Index for Finding MEMs☆37Updated 2 months ago
- Prefix Free Parsing☆8Updated last year
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆50Updated last year
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 4 months ago
- GBWT in Rust☆43Updated 2 months ago
- Fast and exact gap-affine partial order alignment☆51Updated last week
- A reimplementation of the WaveFront Alignment algorithm at low memory☆49Updated last year
- C implementation of the Landau-Vishkin algorithm☆35Updated 3 years ago
- Contains the description of a file format to store kmers and associated values☆32Updated 2 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 4 years ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago