jianshu93

bindash

Fast and precise comparison of genomes and metagenomes (in the order of terabytes) on a typical personal laptop

gsearch

Approximate nearest neighbour search for microbial genomes based on hash metric

annembed

data embedding based on approximate nearest neighbour

kmerHLL

Counting unique kmers in sequence files via HyperLogLog

probminhash

Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms

annembed_analysis

reproducing scripts for annembed paper

bioconda-recipes

Conda recipes for the bioconda channel.

blog

Build a Jekyll blog in minutes, without touching the command line.

ChainX

Anchor chaining method for nucleotide sequences

coreset

coreset clustering robust median

exaloglog-paper

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale

FastANI

Fast Whole-Genome Similarity (ANI) Estimation

gp-ann

Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"

graphembed

graph embedding, density friendly decomposition

graphembed-analysis

Repo for analyzing graphembed crate

hnswlib-java

Java library for approximate nearest neighbors search using Hierarchical Navigable Small World graphs

homebrew-bindash

homebrew formular for BinDash

homebrew-graphembed

homebrew channel for graphembed

homebrew-gsearch

hyperminhash

linkauc

NonpareilX

metagenomic coverage estimation for long and accurate reads

popcount_avx

benchmark of popcount via SIMD

portable-simd

The testing ground for the future of portable SIMD in Rust

rapidNJ-M1

Fast implementation of the Neighbour-Joining method for phylogenetic inference (for M1 macs)

rollinghashcpp

Rolling Hash C++ Library

sketch

C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings

speedytree

Canonical and RapidNJ implementations of Neighbor-joining in Rust

twox-hash

A Rust implementation of the XXHash algorithm.

xxHash

Extremely fast non-cryptographic hash algorithm