112 citations · 369 across the 25 of their papers we have counts for
27 papers
Count-min sketch with variable number of hash functions: an experimental study
Éric Fusy, Gregory Kucherov
Conservative Count-Min, an improved version of Count-Min sketch [Cormode, Muthukrishnan 2005], is an online-maintained hashing-based data structure summarizing element frequency in…
Phase transition in count approximation by Count-Min sketch with conservative updates
Éric Fusy, Gregory Kucherov
Count-Min sketch is a hash-based data structure to represent a dynamically changing associative array of counters. Here we analyse the counting version of Count-Min under a stronge…
Efficient tree-structured categorical retrieval
Djamal Belazzougui, Gregory Kucherov
We study a document retrieval problem in the new framework where text documents are organized in a {\em category tree} with a pre-defined number of categories. This situati…
Evolution of biosequence search algorithms: a brief survey
Gregory Kucherov
The paper surveys the evolution of main algorithmic techniques to compare and search biological sequences. We highlight key algorithmic ideas emerged in response to several interco…
Ococo: an online variant and consensus caller
Karel Břinda, Valentina Boeva, Gregory Kucherov
Motivation: Identifying genomic variants is an essential step for connecting genotype and phenotype. The usual approach consists of statistical inference of variants from alignment…
Dynamic read mapping and online consensus calling for better variant detection
Karel Břinda, Valentina Boeva, Gregory Kucherov
Variant detection from high-throughput sequencing data is an essential step in identification of alleles involved in complex diseases and cancer. To deal with these massive data, e…