txje / c-minhash
Simple and fast MinHash implementation in C with Python wrapper
☆13Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for c-minhash
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 3 years ago
- ☆18Updated 6 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 4 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 6 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- ☆19Updated 4 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 5 months ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 7 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated last year
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆14Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 5 years ago
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- Universal K-mer Hitting Set library in Rust☆10Updated 4 years ago
- Classify sequencing reads using MinHash.☆48Updated 4 years ago
- ☆14Updated 8 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- Fast and cache-efficient full-text pangenome index☆25Updated last week
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 11 years ago
- A Go implementation of the strobemers (https://github.com/ksahlin/strobemers)☆14Updated 3 years ago
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 4 years ago
- ☆12Updated last year
- Next Index to Query Kmer Intersection☆16Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 2 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 3 years ago