Alternatives and similar repositories for Shifted-Hamming-Distance

Users that are interested in Shifted-Hamming-Distance are comparing it to the libraries listed below

• BilkentCompGen / mrfast
  micro-read Fast Alignment Search Tool
  ☆19Updated 6 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• BilkentCompGen / GateKeeper
  GateKeeper: Fast Alignment Filter for DNA Short Read Mapping
  ☆19Updated 6 years ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆43Updated 4 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 4 years ago
• CMU-SAFARI / SneakySnake
  SneakySnake is the first and the only pre-alignment filtering algorithm that works efficiently and fast on modern CPU, FPGA, and GPU arch…
  ☆52Updated 2 years ago
• CMU-SAFARI / Shouji
  Shouji is fast and accurate pre-alignment filter for banded sequence alignment calculation. Described in the Bioinformatics journal paper…
  ☆17Updated 6 years ago
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆88Updated last week
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• albertozeni / LOGAN
  LOGAN: High-Performance Multi-GPU X-Drop Long-Read Alignment.
  ☆29Updated 2 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 5 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 7 months ago
• UCLA-VAST / minimap2-acceleration
  Hardware Acceleration of Long Read Pairwise Overlapping in Genome Sequencing: Open Source Repository
  ☆34Updated 9 months ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated 11 months ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆67Updated 2 years ago
• pelotoncycle / bsort
  Extremely fast inplace radix sort
  ☆42Updated 5 years ago
• CMU-SAFARI / Apollo
  Apollo is an assembly polishing algorithm that attempts to correct the errors in an assembly. It can take multiple set of reads in a sing…
  ☆27Updated 5 years ago
• muellan / metacache
  memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping
  ☆63Updated 3 months ago
• MauricioCarneiro / PairHMM
  Optimization of a Haplotype PairHMM class for GPU processing
  ☆24Updated 8 years ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 5 years ago
• torognes / swipe
  Smith-Waterman database searches with inter-sequence SIMD parallelisation
  ☆60Updated last year
• molpopgen / libsequence
  libsequence: a C++ class library for evolutionary genetic analysis
  ☆53Updated 5 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 4 years ago
• shubhamchandak94 / HARC
  Fastq compression
  ☆18Updated 5 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 5 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated last year
• ruhulsbu / NanoBLASTer
  Basic Local Alignment and Search Tool for Oxford Nanopore Long Sequences
  ☆10Updated 9 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆33Updated 7 months ago