112 citations · 369 across the 25 of their papers we have counts for
11 papers · 1 filter
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…
On Maximal Unbordered Factors
Gregory Kucherov, Alexander Loptev, Tatiana Starikovskaya
Given a string of length , its maximal unbordered factor is the longest factor which does not have a border. In this work we investigate the relationship between and the…
Approximate String Matching using a Bidirectional Index
Gregory Kucherov, Kamil Salikhov, Dekel Tsur
We study strategies of approximate pattern matching that exploit bidirectional text indexes, extending and generalizing ideas of Lam et al. We introduce a formalism, called search…
Using cascading Bloom filters to improve the memory usage for de Brujin graphs
Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov
De Brujin graphs are widely used in bioinformatics for processing next-generation sequencing data. Due to a very large size of NGS datasets, it is essential to represent de Bruijn…