CMU-SAFARI / Shifted-Hamming-DistanceLinks
Source code for the Shifted Hamming Distance (SHD) filtering mechanism for sequence alignment. Described in the Bioinformatics journal paper (2015) by Xin et al. at http://users.ece.cmu.edu/~omutlu/pub/shifted-hamming-distance_bioinformatics15_proofs.pdf
☆36Updated 5 years ago
Alternatives and similar repositories for Shifted-Hamming-Distance
Users that are interested in Shifted-Hamming-Distance are comparing it to the libraries listed below
Sorting:
- micro-read Fast Alignment Search Tool☆19Updated 6 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Updated last year
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Updated 5 years ago
- GateKeeper: Fast Alignment Filter for DNA Short Read Mapping☆21Updated 6 years ago
- libsequence: a C++ class library for evolutionary genetic analysis☆52Updated 5 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated last week
- Shouji is fast and accurate pre-alignment filter for banded sequence alignment calculation. Described in the Bioinformatics journal paper…☆18Updated 6 years ago
- ☆20Updated 5 years ago
- SneakySnake is the first and the only pre-alignment filtering algorithm that works efficiently and fast on modern CPU, FPGA, and GPU arch…☆53Updated 2 years ago
- Simply feedforward neural network☆19Updated 9 years ago
- LOGAN: High-Performance Multi-GPU X-Drop Long-Read Alignment.☆29Updated 3 years ago
- Optimization of a Haplotype PairHMM class for GPU processing☆24Updated 8 years ago
- Bit packed vector of integral values☆28Updated 10 months ago
- Hardware Acceleration of Long Read Pairwise Overlapping in Genome Sequencing: Open Source Repository☆33Updated last year
- 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…☆28Updated 5 years ago
- A C++14 library for NGS data formats☆39Updated 6 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆156Updated last year
- k8 Javascript shell☆158Updated last week
- Extremely fast inplace radix sort☆43Updated 5 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- 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
- Header-only, gzread-like reader for gzip, bz2, and xz.☆11Updated 7 years ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆83Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Parallel Block GZIP☆50Updated 9 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- Fastq compression☆18Updated 6 years ago