firebb / parahmmLinks
Parallel Implementation of HMM on Multicore Platform
☆25Updated 2 years ago
Alternatives and similar repositories for parahmm
Users that are interested in parahmm are comparing it to the libraries listed below
Sorting:
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated 3 months ago
- ☆20Updated 5 years ago
- Proof-of-concept implementation of GWFA for sequence-to-graph alignment☆55Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- toolkit for file system virtualisation of random access compressed FASTA, FAI, DICT & TWOBIT files☆22Updated last year
- LOGAN: High-Performance Multi-GPU X-Drop Long-Read Alignment.☆29Updated 3 years ago
- ☆14Updated 5 years ago
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Ultrafast consensus module for raw de novo genome assembly of long uncorrected reads☆17Updated 5 years ago
- Analyzes whole genome sequencing data for gene-editing verification☆10Updated 5 months ago
- ☆23Updated last year
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆26Updated 3 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- ☆12Updated 6 years ago
- ☆10Updated 3 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated 4 years ago
- Pairwise nucleotide alignment benchmark of Rust bindings☆30Updated 2 years ago
- A rust wrapper for the spoa C++ partial order alignment library☆10Updated 3 months ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆34Updated 9 months ago
- Metagenomic binning using low-density hashing a support vector machine☆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…☆52Updated 2 years ago
- FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform☆20Updated 2 months ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆44Updated 4 years ago
- BELLA: a Computationally-Efficient and Highly-Accurate Long-Read to Long-Read Aligner and Overlapper☆50Updated 3 years ago
- ☆24Updated 4 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- 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
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆82Updated last year