txje / c-minhashLinks
Simple and fast MinHash implementation in C with Python wrapper
☆13Updated 5 years ago
Alternatives and similar repositories for c-minhash
Users that are interested in c-minhash are comparing it to the libraries listed below
Sorting:
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Updated 4 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 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
- An experimental tool to find approximate max-cuts in a large graph☆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
- ☆18Updated 6 years ago
- dynamic-updateable-index☆11Updated 9 years ago
- Sequence Bloom Trees with All/Some split☆11Updated 6 years ago
- A "Navie" Implementation of the Wavefront Algorithm For Sequence Alignment with Gap-Affine Scoring☆15Updated last year
- A hash map using the BooPHF perfect hash function☆12Updated 8 years ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆25Updated last year
- comb aligner -- a graphical nucleotide sequence alignment tool☆9Updated 8 years ago
- ☆14Updated 9 years ago
- This repo is deprecated. Please use gfatools instead.☆16Updated 6 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆26Updated 2 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- nimble aligner that will map your reads to the references on a laptop☆12Updated 7 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- ☆13Updated last year
- a toolset for efficient analysis of 10X Genomics linked read data sets, in particular for de novo assembly☆15Updated 5 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last week
- Layout module for raw de novo genome assembly of long uncorrected reads.☆21Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- ☆20Updated 4 years ago
- ☆25Updated 4 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- ☆14Updated 5 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 5 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago