Alternatives and similar repositories for SkipPatch

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

• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆85Updated last year
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆13Updated 7 months ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆24Updated 5 years ago
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆42Updated 2 months ago
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 5 years ago
• rob-p / BooM
  A hash map using the BooPHF perfect hash function
  ☆13Updated 9 years ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆24Updated last year
• lh3 / ropebwt2
  Incremental construction of FM-index for DNA sequences
  ☆72Updated last year
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆26Updated 8 years ago
• txje / c-minhash
  Simple and fast MinHash implementation in C with Python wrapper
  ☆13Updated 6 months ago
• mohsenzakeri / Movi
  Fast, Cache-Efficient, and Scalable Queries on Pangenomes
  ☆36Updated 3 months ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆73Updated 10 months ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated 2 years ago
• gregorykucherov / spaced-seeds-for-metagenomics
  ☆13Updated 10 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆53Updated last year
• medvedevgroup / bloomtree-allsome
  Sequence Bloom Trees with All/Some split
  ☆11Updated 7 years ago
• cdarby / genomicsjc
  Johns Hopkins University student-led genomics paper discussion group
  ☆13Updated 5 years ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆93Updated last week
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 5 years ago
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 4 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆88Updated 2 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 5 years ago
• jltsiren / gbwt
  Substring index for paths in a graph
  ☆60Updated this week
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago
• lh3 / gwfa
  Proof-of-concept implementation of GWFA for sequence-to-graph alignment
  ☆56Updated last year
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆10Updated 4 years ago
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆20Updated 8 months ago
• medvedevgroup / UST
  ☆24Updated 4 years ago