pablocael / pynear
A python library for efficient KNN search within metric spaces using multiple distance functions.
☆11Updated 3 months ago
Related projects: ⓘ
- Fast and accurate set similarity estimation via containment min hash☆42Updated 2 months ago
- ☆18Updated 6 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- Sequence Distance Graph framework: graph + reads + mapping + analysis☆25Updated 2 years ago
- Code accompanying the publication for compressed graph annotation☆13Updated 5 years ago
- Optimal distance lower bound k-mer sampling.☆12Updated 3 months ago
- Ultrafast consensus module for raw de novo genome assembly of long uncorrected reads☆16Updated 3 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- A minimal Python re-implementation of the A* with seed heuristic for exact global alignmnet (edit distance) in near-linear time☆18Updated 4 months ago
- Practical Dynamic de Bruijn Graphs☆18Updated 3 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆42Updated 10 months ago
- ☆23Updated 9 months ago
- Implementation of a Backpack Quotient Filter☆10Updated last month
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆43Updated 3 weeks ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- Paired reads mapping on de Bruijn graph☆13Updated 5 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆39Updated last year
- Python library that facilitates opening, reading, and writing files (and file-like entities like URLs and streams) agnostic of compressio…☆21Updated last month
- ☆32Updated this week
- Space-efficient pseudoalignment with a colored de Bruijn graph☆50Updated last week
- Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]☆11Updated 6 months ago
- Library of sketching functions used by PopPUNK☆30Updated 5 months ago
- Efficient calculation of phylogenetic distance matrices.☆44Updated 2 months ago
- KmerCamel🐫 provides implementations of several algorithms for efficiently representing a set of k-mers as a masked superstring.☆11Updated this week
- Python bindings for Bifrost with a NetworkX compatible API☆27Updated 11 months ago
- Minhash and maxhash library in Python, combining flexibility, expressivity, and performance.☆21Updated 2 weeks ago
- ☆9Updated 2 years ago
- Streaming sequence classification with web services ✓📌☆19Updated last year
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆21Updated this week