Grégory Kucherov

This paper introduces phylogenetic compression to efficiently search large microbial genome collections, achieving significant compression improvements and enabling fast BLAST-like searches on desktop computers.

The paper introduces a method using IBLTs and syncmers to efficiently estimate Jaccard similarity and identify differing k-mers between genomic datasets.

The paper introduces Set-Min sketch, a probabilistic data structure for representing k-mer count tables with improved accuracy over existing methods.

The paper introduces simplitigs, a compact and scalable representation of de Bruijn graphs, showing improved efficiency in sequence length and node count, especially with larger datasets.

The paper introduces a sparse-seeding method for sequence similarity search using minimally-overlapping words to improve sensitivity compared to existing methods.

This paper introduces a method to rapidly infer antibiotic resistance and susceptibility from bacterial genomes using genomic neighbor typing, achieving high sensitivity and specificity within minutes to hours.