CMU-SAFARI / Shifted-Hamming-Distance
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
☆35Updated 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 5 years ago
- GateKeeper: Fast Alignment Filter for DNA Short Read Mapping☆19Updated 6 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…☆51Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Shouji is fast and accurate pre-alignment filter for banded sequence alignment calculation. Described in the Bioinformatics journal paper…☆17Updated 5 years ago
- Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.☆13Updated 3 years ago
- Fastq compression☆18Updated 5 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- NVBIO is a library of reusable components designed to accelerate bioinformatics applications using CUDA.☆59Updated 10 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
- Hardware Acceleration of Long Read Pairwise Overlapping in Genome Sequencing: Open Source Repository☆33Updated 6 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆84Updated this week
- 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
- smith-waterman-gotoh alignment algorithm☆17Updated 7 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Source code for the software implementations of the GenASM algorithms proposed in our MICRO 2020 paper: Senol Cali et. al., "GenASM: A Hi…☆31Updated 2 years ago
- LOGAN: High-Performance Multi-GPU X-Drop Long-Read Alignment.☆29Updated 2 years ago
- BLEND is a mechanism that can efficiently find fuzzy seed matches between sequences to significantly improve the performance and accuracy…☆43Updated 2 years ago
- Bit packed vector of integral values☆27Updated 3 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Optimization of a Haplotype PairHMM class for GPU processing☆24Updated 8 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 3 years ago
- ☆20Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆64Updated last year
- Smith-Waterman database searches with inter-sequence SIMD parallelisation☆59Updated last year
- 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
- Parallel Block GZIP☆50Updated 8 years ago
- The BTL C/C++ Common bloom filters for bioinformatics projects, as well as any APIs created for other programming languages.☆18Updated 3 years ago