Alternatives and similar repositories for pfp

Users that are interested in pfp are comparing it to the libraries listed below

• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆29Updated this week
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆18Updated 2 weeks ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆25Updated last year
• medvedevgroup / UST
  ☆25Updated 4 years ago
• ddiazdom / lcg
  Efficient, parallel compression for terabyte-scale data
  ☆46Updated last month
• ratschlab / Project2020-seq-tensor-sketching
  ☆8Updated 3 years ago
• RagnarGrootKoerkamp / minimizers
  Reference implementations of minimizer schemes to go with the mod-minimizers paper.
  ☆24Updated last month
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 3 years ago
• algbio / themisto
  Space-efficient pseudoalignment with a colored de Bruijn graph
  ☆52Updated 3 months ago
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago
• jamshed / CaPS-SA
  Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
  ☆13Updated this week
• Daniel-Liu-c0deb0t / dlb-kmer-sampling
  Optimal distance lower bound k-mer sampling.
  ☆12Updated last year
• rchikhi / rust-seq2kminmers
  Iterate k-min-mers from a DNA sequence in Rust
  ☆13Updated last year
• algbio / SBWT
  Code for the paper Succinct k-mer Set Representations Using Subset Rank Queries on the Spectral Burrows-Wheeler Transform (SBWT)
  ☆24Updated 3 months ago
• jermp / fulgor
  ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.
  ☆50Updated last week
• prophyle / prophasm
  ProphAsm – a rapid computation of simplitigs directly from k-mer sets
  ☆26Updated 2 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆12Updated 8 years ago
• vgteam / libhandlegraph
  Library for the Handle Graph abstraction
  ☆23Updated last week
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• Kingsford-Group / miniception
  ☆14Updated 5 years ago
• jltsiren / gbwt-rs
  GBWT in Rust
  ☆43Updated 2 months ago
• mkirsche / sapling
  SAPLING: Suffix Array Piecewise Linear INdex for Genomics
  ☆25Updated 4 years ago
• langmead-lab / vargas
  ☆25Updated 4 years ago
• rchikhi / rust-alignbench
  Pairwise nucleotide alignment benchmark of Rust bindings
  ☆31Updated last year
• alshai / Big-BWT
  modified from gitlab.com/manzai/Big-BWT to support fasta files
  ☆9Updated 4 months ago
• ratschlab / tensor-sketch-alignment
  Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.
  ☆13Updated 2 years ago
• Malfoy / NIQKI
  Next Index to Query Kmer Intersection
  ☆16Updated 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 4 months ago