Alternatives and similar repositories for c-minhash

Users that are interested in c-minhash are comparing it to the libraries listed below

• edawson / mkmh
  Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.
  ☆24Updated 4 years ago
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 5 years ago
• Kingsford-Group / splitsbt
  ☆18Updated 6 years ago
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 9 years ago
• bioinfologics / sdg
  Sequence Distance Graph framework: graph + reads + mapping + analysis
  ☆25Updated 2 years ago
• ocxtal / comb
  comb aligner -- a graphical nucleotide sequence alignment tool
  ☆9Updated 8 years ago
• gregorykucherov / spaced-seeds-for-metagenomics
  ☆14Updated 9 years ago
• prophyle / prophasm
  ProphAsm – a rapid computation of simplitigs directly from k-mer sets
  ☆26Updated 2 years ago
• medvedevgroup / bloomtree-allsome
  Sequence Bloom Trees with All/Some split
  ☆11Updated 6 years ago
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 3 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• dib-lab / MQF
  ☆12Updated last year
• RUSH-LAB / RAMBO
  ☆20Updated 4 years ago
• lynxoid / nimbliner
  nimble aligner that will map your reads to the references on a laptop
  ☆12Updated 7 years ago
• medvedevgroup / UST
  ☆25Updated 4 years ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆25Updated 11 months ago
• GuillaumeHolley / BlastGraph
  BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…
  ☆12Updated 12 years ago
• lh3 / gfa1
  This repo is deprecated. Please use gfatools instead.
  ☆16Updated 6 years ago
• rvaser / bioparser
  C++ library for parsing several formats in bioinformatics
  ☆9Updated 2 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• shenwei356 / strobemers
  A Go implementation of the strobemers (https://github.com/ksahlin/strobemers)
  ☆15Updated 4 years ago
• rvaser / rala
  Layout module for raw de novo genome assembly of long uncorrected reads.
  ☆21Updated 4 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 3 months ago
• luizirber / ukhs
  Universal K-mer Hitting Set library in Rust
  ☆10Updated 4 years ago
• Daniel-Liu-c0deb0t / dlb-kmer-sampling
  Optimal distance lower bound k-mer sampling.
  ☆12Updated 11 months ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆27Updated this week
• edawson / rkmh
  Classify sequencing reads using MinHash.
  ☆48Updated 5 years ago
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆12Updated 8 years ago
• edawson / svaha
  Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]
  ☆12Updated last year
• cschin / wavefront-aln
  A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring
  ☆15Updated last year