txje / c-minhashLinks
Simple and fast MinHash implementation in C with Python wrapper
☆13Updated 6 months 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 5 years ago
- A hash map using the BooPHF perfect hash function☆13Updated 9 years ago
- ☆13Updated 10 years ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- ☆24Updated 4 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 2 months ago
- ☆18Updated 7 years ago
- ProphAsm – a rapid computation of simplitigs directly from k-mer sets☆25Updated 2 years ago
- This repo is deprecated. Please use gfatools instead.☆15Updated 7 years ago
- C++ library for analysing and storing large-scale cohorts of sequence variant data☆17Updated 6 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
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- Sequence Bloom Trees with All/Some split☆11Updated 7 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 5 years ago
- Layout module for raw de novo genome assembly of long uncorrected reads.☆20Updated 4 years ago
- Next Index to Query Kmer Intersection☆17Updated 2 years ago
- ☆24Updated 5 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 2 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 3 years ago
- Contains the description of a file format to store kmers and associated values☆34Updated 3 years ago
- Tool (experimental) to compute layout from overlaps with spectral algorithm☆11Updated 8 years ago
- nimble aligner that will map your reads to the references on a laptop☆11Updated 8 years ago
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Updated 5 years ago
- Efficient construction of the BWT using string compression☆20Updated 7 months ago
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 3 years ago
- Pan-genome Seed Index☆20Updated 10 months ago
- ☆10Updated last year
- Minimalistic aligner which uses Minimap for input mapping locations and Edlib for fast bitvector alignment.☆11Updated 8 years ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago