Alternatives and similar repositories for CaPS-SA

Users that are interested in CaPS-SA are comparing it to the libraries listed below

• algbio / SBWT
  Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)
  ☆24Updated 4 months ago
• ratschlab / Project2020-seq-tensor-sketching
  ☆8Updated 3 years ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆18Updated 2 months ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆29Updated 2 weeks ago
• RagnarGrootKoerkamp / minimizers
  Reference implementations of minimizer schemes to go with the mod-minimizers paper.
  ☆25Updated 3 months ago
• jermp / fulgor
  ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.
  ☆52Updated last week
• algbio / themisto
  Space-efficient pseudoalignment with a colored de Bruijn graph
  ☆53Updated 4 months ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆12Updated 3 weeks ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆51Updated last year
• AlgoLab / RecGraph
  Optimal sequence-to-graph alignment with recombinations
  ☆36Updated last week
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆13Updated 8 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆25Updated last year
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• Kmer-File-Format / kff-tools
  ☆17Updated 2 years ago
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago
• maxrossi91 / moni
  MONI: A Pangenomic Index for Finding MEMs
  ☆37Updated 4 months ago
• OndrejSladky / kmercamel
  KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.
  ☆19Updated last month
• lh3 / miniwfa
  A reimplementation of the WaveFront Alignment algorithm at low memory
  ☆50Updated last year
• Daniel-Liu-c0deb0t / dlb-kmer-sampling
  Optimal distance lower bound k-mer sampling.
  ☆12Updated last year
• mkirsche / sapling
  SAPLING: Suffix Array Piecewise Linear INdex for Genomics
  ☆25Updated 4 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 11 months ago
• algbio / ggcat
  Compacted and colored de Bruijn graph construction and querying
  ☆84Updated this week
• RabbitBio / RabbitFX
  ☆11Updated 2 years ago
• tlemane / kmtricks
  modular k-mer count matrix and Bloom filter construction for large read collections
  ☆84Updated 9 months ago
• chfi / rs-handlegraph
  Rust implementation of VG handle graph
  ☆20Updated last year
• Malfoy / Blight
  De Bruijn graph representation in low memory
  ☆36Updated last year
• rchikhi / rust-alignbench
  Pairwise nucleotide alignment benchmark of Rust bindings
  ☆31Updated 2 years ago
• OndrejSladky / fmsi
  FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform
  ☆20Updated last week