


default search action
Gregory Kucherov
Person information
- affiliation: LIFL Lille, France
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c55]Djamal Belazzougui, Gregory Kucherov, Stefan Walzer:
Better Space-Time-Robustness Trade-Offs for Set Reconciliation. ICALP 2024: 20:1-20:19 - [i20]Djamal Belazzougui, Gregory Kucherov, Stefan Walzer:
Better space-time-robustness trade-offs for set reconciliation. CoRR abs/2404.09607 (2024) - 2023
- [c54]Éric Fusy, Gregory Kucherov
:
Phase Transition in Count Approximation by Count-Min Sketch with Conservative Updates. CIAC 2023: 232-246 - [c53]Gregory Kucherov, Steven Skiena
:
Improving the Sensitivity of MinHash Through Hash-Value Analysis. CPM 2023: 20:1-20:12 - [c52]Éric Fusy, Gregory Kucherov
:
Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study. SPIRE 2023: 218-232 - [i19]Éric Fusy, Gregory Kucherov:
Count-min sketch with variable number of hash functions: an experimental study. CoRR abs/2302.05245 (2023) - 2022
- [j44]Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov:
Space-efficient representation of genomic k-mer count tables. Algorithms Mol. Biol. 17(1): 5 (2022) - [j43]Yoshihiro Shibuya
, Djamal Belazzougui, Gregory Kucherov:
Set-Min Sketch: A Probabilistic Map for Power-Law Distributions with Application to k-Mer Annotation. J. Comput. Biol. 29(2): 140-154 (2022) - [c51]Yoshihiro Shibuya
, Djamal Belazzougui, Gregory Kucherov
:
Efficient Reconciliation of Genomic Datasets of High Similarity. WABI 2022: 14:1-14:14 - [i18]Éric Fusy, Gregory Kucherov:
Analysis of Count-Min sketch under conservative update. CoRR abs/2203.15496 (2022) - 2021
- [j42]Martin C. Frith
, Laurent Noé, Gregory Kucherov
:
Minimally overlapping words for sequence similarity search. Bioinform. 36(22-23): 5344-5350 (2021) - [j41]René van Bevern, Gregory Kucherov:
Special Issue on Computer Science Symposium in Russia (2019). Theory Comput. Syst. 65(3): 441-443 (2021) - [c50]Yoshihiro Shibuya, Djamal Belazzougui, Gregory Kucherov:
Space-Efficient Representation of Genomic k-Mer Count Tables. WABI 2021: 8:1-8:19 - 2020
- [j40]Maxime Crochemore, Alice Héliou, Gregory Kucherov
, Laurent Mouchard, Solon P. Pissis
, Yann Ramusat:
Absent words in a sliding window with applications. Inf. Comput. 270 (2020) - [c49]Djamal Belazzougui, Gregory Kucherov
:
Efficient Tree-Structured Categorical Retrieval. CPM 2020: 4:1-4:11 - [i17]Djamal Belazzougui, Gregory Kucherov:
Efficient tree-structured categorical retrieval. CoRR abs/2006.01825 (2020)
2010 – 2019
- 2019
- [j39]Gregory Kucherov
:
Evolution of biosequence search algorithms: a brief survey. Bioinform. 35(19): 3547-3552 (2019) - [j38]Maxime Crochemore, Roman Kolpakov
, Gregory Kucherov
:
Optimal bounds for computing α-gapped repeats. Inf. Comput. 268 (2019) - [e2]René van Bevern, Gregory Kucherov:
Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings. Lecture Notes in Computer Science 11532, Springer 2019, ISBN 978-3-030-19954-8 [contents] - 2017
- [j37]Gregory Kucherov
, Yakov Nekrich
:
Full-Fledged Real-Time Indexing for Constant Size Alphabets. Algorithmica 79(2): 387-400 (2017) - [c48]Maxime Crochemore, Alice Héliou, Gregory Kucherov
, Laurent Mouchard, Solon P. Pissis
, Yann Ramusat:
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. FCT 2017: 164-176 - 2016
- [j36]Karel Brinda
, Valentina Boeva
, Gregory Kucherov
:
RNF: a general framework to evaluate NGS read mappers. Bioinform. 32(1): 136-139 (2016) - [j35]Gregory Kucherov
, Kamil Salikhov, Dekel Tsur
:
Approximate string matching using a bidirectional index. Theor. Comput. Sci. 638: 145-158 (2016) - [c47]Maxime Crochemore
, Roman Kolpakov
, Gregory Kucherov
:
Optimal Bounds for Computing \alpha α -gapped Repeats. LATA 2016: 245-255 - [r2]Gregory Kucherov, Dina Sokol:
Approximate Tandem Repeats. Encyclopedia of Algorithms 2016: 106-109 - 2015
- [j34]Karel Brinda
, Maciej Sykulski, Gregory Kucherov
:
Spaced seeds improve k-mer-based metagenomic classification. Bioinform. 31(22): 3584-3592 (2015) - [c46]Alexander Loptev, Gregory Kucherov
, Tatiana Starikovskaya:
On Maximal Unbordered Factors. CPM 2015: 343-354 - [c45]Pawel Gawrychowski, Gregory Kucherov
, Benjamin Sach
, Tatiana Starikovskaya:
Computing the Longest Unbordered Substring. SPIRE 2015: 246-257 - [i16]Karel Brinda
, Maciej Sykulski, Gregory Kucherov:
Spaced seeds improve metagenomic classification. CoRR abs/1502.06256 (2015) - [i15]Gregory Kucherov, Alexander Loptev, Tatiana Starikovskaya:
On Maximal Unbordered Factors. CoRR abs/1504.07406 (2015) - [i14]Maxime Crochemore, Roman Kolpakov, Gregory Kucherov:
Optimal searching of gapped repeats in a word. CoRR abs/1509.01221 (2015) - 2014
- [j33]Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov
:
Using cascading Bloom filters to improve the memory usage for de Brujin graphs. Algorithms Mol. Biol. 9: 2 (2014) - [j32]Tsvi Kopelowitz, Gregory Kucherov
, Yakov Nekrich
, Tatiana Starikovskaya:
Cross-document pattern matching. J. Discrete Algorithms 24: 40-47 (2014) - [j31]Tamar Pinhas, Nimrod Milo, Gregory Kucherov
, Michal Ziv-Ukelson:
Algorithms for path-constrained sequence alignment. J. Discrete Algorithms 24: 48-58 (2014) - [c44]Gregory Kucherov
, Kamil Salikhov, Dekel Tsur
:
Approximate String Matching Using a Bidirectional Index. CPM 2014: 222-231 - [c43]Gregory Kucherov, Dekel Tsur:
Improved Filters for the Approximate Suffix-Prefix Overlap Problem. SPIRE 2014: 139-148 - [i13]Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg:
Subset seed automaton. CoRR abs/1408.6198 (2014) - [i12]Maxime Crochemore, James D. Currie, Gregory Kucherov, Dirk Nowotka:
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111). Dagstuhl Reports 4(3): 28-46 (2014) - 2013
- [j30]Gregory Kucherov
, Lilla Tóthmérész
, Stéphane Vialette:
On the combinatorics of suffix arrays. Inf. Process. Lett. 113(22-24): 915-920 (2013) - [j29]Gregory Kucherov
:
On-line construction of position heaps. J. Discrete Algorithms 20: 3-11 (2013) - [c42]Gregory Kucherov
, Yakov Nekrich
:
Full-Fledged Real-Time Indexing for Constant Size Alphabets. ICALP (1) 2013: 650-660 - [c41]Widmer Bland, Gregory Kucherov
, W. F. Smyth:
Prefix Table Construction and Conversion. IWOCA 2013: 41-53 - [c40]Pawel Gawrychowski, Gregory Kucherov
, Yakov Nekrich
, Tatiana Starikovskaya:
Minimal Discriminating Words Problem Revisited. SPIRE 2013: 129-140 - [c39]Kamil Salikhov, Gustavo Sacomoto, Gregory Kucherov
:
Using Cascading Bloom Filters to Improve the Memory Usage for de Brujin Graphs. WABI 2013: 364-376 - [i11]Gregory Kucherov, Yakov Nekrich:
Full-fledged Real-Time Indexing for Constant Size Alphabets. CoRR abs/1302.4016 (2013) - [i10]Gregory Kucherov, Kamil Salikhov:
Using cascading Bloom filters to improve the memory usage for de Brujin graphs. CoRR abs/1302.7278 (2013) - [i9]Gregory Kucherov, Dekel Tsur:
Approximate String Matching using a Bidirectional Index. CoRR abs/1310.1440 (2013) - 2012
- [c38]Gregory Kucherov
, Yakov Nekrich
, Tatiana Starikovskaya:
Cross-Document Pattern Matching. CPM 2012: 196-207 - [c37]Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Computing Discriminating and Generic Words. SPIRE 2012: 307-317 - [i8]Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-Document Pattern Matching. CoRR abs/1202.4076 (2012) - [i7]Gregory Kucherov, Lilla Tóthmérész, Stéphane Vialette:
On the combinatorics of suffix arrays. CoRR abs/1206.3877 (2012) - 2011
- [j28]Gregory Kucherov
, Tamar Pinhas, Michal Ziv-Ukelson:
Regular Language Constrained Sequence Alignment Revisited. J. Comput. Biol. 18(5): 771-781 (2011) - [j27]Gregory Kucherov
, Esko Ukkonen:
Editorial. J. Discrete Algorithms 9(1): 1 (2011) - [c36]Anna Gambin, Slawomir Lasota, Michal Startek, Maciej Sykulski, Laurent Noé, Gregory Kucherov:
Subset Seed Extension to Protein BLAST. BIOINFORMATICS 2011: 149-158 - [c35]Roman Kolpakov
, Gregory Kucherov
, Tatiana Starikovskaya:
Pattern Matching on Sparse Suffix Trees. CCP 2011: 92-97 - [c34]Gregory Kucherov
:
On-Line Construction of Position Heaps. SPIRE 2011: 326-337 - [i6]Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya:
Linear pattern matching on sparse suffix trees. CoRR abs/1103.2613 (2011) - [i5]Gregory Kucherov:
On-line construction of position heaps. CoRR abs/1104.1601 (2011) - 2010
- [j26]Laurent Noé
, Marta Gîrdea, Gregory Kucherov
:
Designing Efficient Spaced Seeds for SOLiD Read Mapping. Adv. Bioinformatics 2010: 708501:1-708501:12 (2010) - [j25]Marta Gîrdea, Laurent Noé
, Gregory Kucherov
:
Back-translation for discovering distant protein homologies in the presence of frameshift mutations. Algorithms Mol. Biol. 5: 6 (2010) - [j24]Roman Kolpakov
, Gregory Kucherov
, Pascal Ochem:
On maximal repetitions of arbitrary exponent. Inf. Process. Lett. 110(7): 252-256 (2010) - [c33]Gregory Kucherov
, Tamar Pinhas, Michal Ziv-Ukelson:
Regular Language Constrained Sequence Alignment Revisited. IWOCA 2010: 404-415 - [c32]Laurent Noé
, Marta Gîrdea, Gregory Kucherov
:
Seed Design Framework for Mapping SOLiD Reads. RECOMB 2010: 384-396
2000 – 2009
- 2009
- [j23]Mikhail A. Roytberg
, Anna Gambin
, Laurent Noé
, Slawomir Lasota, Eugenia Furletova
, Ewa Szczurek
, Gregory Kucherov
:
On Subset Seeds for Protein Alignment. IEEE ACM Trans. Comput. Biol. Bioinform. 6(3): 483-494 (2009) - [j22]Roman Kolpakov
, Gregory Kucherov
:
Searching for gapped palindromes. Theor. Comput. Sci. 410(51): 5365-5373 (2009) - [c31]Elena Yavorska Harris, Thierry Lecroq
, Gregory Kucherov
, Stefano Lonardi
:
CPM's 20th Anniversary: A Statistical Retrospective. CPM 2009: 1-11 - [c30]Marta Gîrdea, Laurent Noé
, Gregory Kucherov
:
Back-Translation for Discovering Distant Protein Homologies. WABI 2009: 108-120 - [e1]Gregory Kucherov, Esko Ukkonen:
Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings. Lecture Notes in Computer Science 5577, Springer 2009, ISBN 978-3-642-02440-5 [contents] - [i4]Roman Kolpakov, Gregory Kucherov, Pascal Ochem:
On maximal repetitions of arbitrary exponent. CoRR abs/0906.4750 (2009) - 2008
- [j21]Pierre Peterlongo
, Laurent Noé
, Dominique Lavenier, Van Hoa Nguyen
, Gregory Kucherov
, Mathieu Giraud
:
Optimal neighborhood indexing for protein similarity search. BMC Bioinform. 9 (2008) - [j20]Fabrice Touzain
, Sophie Schbath
, Isabelle Debled-Rennesson, Bertrand Aigle
, Gregory Kucherov
, Pierre Leblond
:
SIGffRid: A tool to search for sigma factor binding sites in bacterial genomes using comparative approach and biologically driven statistics. BMC Bioinform. 9 (2008) - [j19]Ségolène Caboche, Maude Pupin
, Valérie Leclère
, Arnaud Fontaine, Philippe Jacques, Gregory Kucherov
:
NORINE: a database of nonribosomal peptides. Nucleic Acids Res. 36(Database-Issue): 326-331 (2008) - [c29]Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Slawomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov:
Efficient Seeding Techniques for Protein Similarity Search. BIRD 2008: 466-478 - [c28]Roman Kolpakov
, Gregory Kucherov
:
Searching for Gapped Palindromes. CPM 2008: 18-30 - [r1]Gregory Kucherov, Dina Sokol:
Approximate Tandem Repeats. Encyclopedia of Algorithms 2008 - 2007
- [c27]Pierre Peterlongo, Laurent Noé
, Dominique Lavenier, Gilles Georges, Julien Jacques, Gregory Kucherov
, Mathieu Giraud
:
Protein Similarity Search with Subset Seeds on a Dedicated Reconfigurable Hardware. PPAM 2007: 1240-1248 - [c26]Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg:
Subset Seed Automaton. CIAA 2007: 180-191 - 2006
- [j18]Gregory Kucherov
, Andrey A. Mironov, Mikhail A. Roytberg
:
An Overview of the Algorithmic Session of MCCMB'05. J. Bioinform. Comput. Biol. 4(2) (2006) - [j17]Gregory Kucherov
, Laurent Noé
, Mikhail A. Roytberg
:
A Unifying Framework for Seed Sensitivity and its Application to Subset Seeds. J. Bioinform. Comput. Biol. 4(2): 553-570 (2006) - [c25]Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov:
Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279 - [i3]Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg:
A unifying framework for seed sensitivity and its application to subset seeds. CoRR abs/cs/0601116 (2006) - [i2]Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg:
A unifying framework for seed sensitivity and its application to subset seeds (Extended abstract). CoRR abs/cs/0603105 (2006) - [i1]Gregory Kucherov, Laurent Noé, Yann Ponty:
Estimating seed sensitivity on homogeneous alignments. CoRR abs/cs/0603106 (2006) - 2005
- [j16]Laurent Noé
, Gregory Kucherov
:
YASS: enhancing the sensitivity of DNA similarity search. Nucleic Acids Res. 33(Web-Server-Issue): 540-543 (2005) - [j15]Gregory Kucherov
, Laurent Noé
, Mikhail A. Roytberg
:
Multiseed Lossless Filtration. IEEE ACM Trans. Comput. Biol. Bioinform. 2(1): 51-61 (2005) - [c24]Gregory Kucherov
, Laurent Noé
, Mikhail A. Roytberg
:
A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds. WABI 2005: 251-263 - [c23]Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov
:
Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey. WG 2005: 16-27 - 2004
- [j14]Laurent Noé
, Gregory Kucherov
:
Improved hit criteria for DNA local alignment. BMC Bioinform. 5: 149 (2004) - [j13]Jean-Pierre Duval, Roman Kolpakov
, Gregory Kucherov
, Thierry Lecroq
, Arnaud Lefebvre:
Linear-time computation of local periods. Theor. Comput. Sci. 326(1-3): 229-240 (2004) - [c22]Gregory Kucherov
, Laurent Noé
, Yann Ponty
:
Estimating Seed Sensitivity on Homogeneous Alignments. BIBE 2004: 387-394 - [c21]Gregory Kucherov, Laurent Noé, Mikhail A. Roytberg:
Multi-seed Lossless Filtration (Extended Abstract). CPM 2004: 297-310 - 2003
- [j12]Gregory Kucherov, Pascal Ochem, Michaël Rao:
How Many Square Occurrences Must a Binary Sequence Contain? Electron. J. Comb. 10 (2003) - [j11]Roman M. Kolpakov
, Ghizlane Bana, Gregory Kucherov
:
mreps: efficient and flexible detection of tandem repeats in DNA. Nucleic Acids Res. 31(13): 3672-3678 (2003) - [j10]Roman M. Kolpakov
, Gregory Kucherov
:
Finding approximate repetitions under Hamming distance. Theor. Comput. Sci. 303(1): 135-156 (2003) - [c20]Jean-Pierre Duval, Roman Kolpakov
, Gregory Kucherov, Thierry Lecroq
, Arnaud Lefebvre:
Linear-Time Computation of Local Periods. MFCS 2003: 388-397 - 2001
- [c19]Roman M. Kolpakov
, Gregory Kucherov:
Finding Approximate Repetitions under Hamming Distance. ESA 2001: 170-181 - 2000
- [j9]Vladimir Grebinski, Gregory Kucherov:
Optimal Reconstruction of Graphs under the Additive Model. Algorithmica 28(1): 104-124 (2000) - [c18]Roman M. Kolpakov
, Gregory Kucherov
:
Finding Repeats with Fixed Gap. SPIRE 2000: 162-168
1990 – 1999
- 1999
- [j8]David A. Plaisted, Gregory Kucherov
:
The Complexity of Some Complementation Problems. Inf. Process. Lett. 71(3-4): 159-165 (1999) - [j7]Roman M. Kolpakov
, Gregory Kucherov
, Yuriy V. Tarannikov
:
On Repetition-Free Binary Words of Minimal Density. Theor. Comput. Sci. 218(1): 161-175 (1999) - [c17]Gregory Kucherov, Michaël Rusinowitch:
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results. Ershov Memorial Conference 1999: 283-296 - [c16]Roman M. Kolpakov
, Gregory Kucherov:
On Maximal Repetitions in Words. FCT 1999: 374-385 - [c15]Roman M. Kolpakov, Gregory Kucherov:
Finding Maximal Repetitions in a Word in Linear Time. FOCS 1999: 596-604 - [c14]Vladimir Grebinski, Gregory Kucherov:
Reconstructing Set Partitions. SODA 1999: 915-916 - 1998
- [j6]Vladimir Grebinski, Gregory Kucherov:
Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. Discret. Appl. Math. 88(1-3): 147-165 (1998) - [c13]Roman M. Kolpakov
, Gregory Kucherov, Yuriy V. Tarannikov
:
On Repetition-Free Binary Words of Minimal Density. MFCS 1998: 683-692 - 1997
- [j5]Gregory Kucherov, Michaël Rusinowitch:
Matching a Set of Strings with Variable Length don't Cares. Theor. Comput. Sci. 178(1-2): 129-154 (1997) - [c12]Vladimir Grebinski, Gregory Kucherov:
Optimal Reconstruction of Graphs Under the Additive Model. ESA 1997: 246-258 - [c11]Vladimir Grebinski, Gregory Kucherov:
Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. ISTCS 1997: 166-173 - [c10]Roman M. Kolpakov
, Gregory Kucherov:
Minimal Letter Frequency in n-th Power-Free Binary Words. MFCS 1997: 347-357 - [c9]François Bertault, Gregory Kucherov:
Visualization of Dynamic Automata Using Padnon. Workshop on Implementing Automata 1997: 25-28 - 1996
- [j4]Gregory Kucherov, Pierre Lescanne, Peter D. Mosses:
Valentin M. Antimirov (1961-1995). Theor. Comput. Sci. 155(2): 289-290 (1996) - 1995
- [j3]Gregory Kucherov
, Mohamed Tajine:
Decidability of Regularity and Related Properties of Ground Normal Form Languages. Inf. Comput. 118(1): 91-100 (1995) - [j2]Gregory Kucherov
, Michaël Rusinowitch:
Undecidability of Ground Reducibility for Word Rewriting Systems with Variables. Inf. Process. Lett. 53(4): 209-215 (1995) - [c8]Gregory Kucherov
, Michaël Rusinowitch:
Matching a Set of Strings with Variable Length Don't Cares. CPM 1995: 230-247 - 1994
- [c7]Dieter Hofbauer, Maria Huber, Gregory Kucherov:
Some Results on Top-Context-Free Tree Languages. CAAP 1994: 157-171 - [c6]Gregory Kucherov
, Michaël Rusinowitch:
The Complexity of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables. CTRS 1994: 262-275 - [c5]Gregory Kucherov, Michaël Rusinowitch:
On ground reducibility problem for word rewriting systems with variables. SAC 1994: 271-276 - 1992
- [j1]Gregory Kucherov, V. A. Kositov:
Data abstraction and object-oriented programming in C++ : K E Gorlen, S M Orlow, and P S Plexico John Wiley (1990) $103.50 hardback $38.15 softback 426pp. Inf. Softw. Technol. 34(4): 278 (1992) - [c4]Gregory Kucherov, Mohamed Tajine:
Decidability of Regularity and Related Properties of Ground Normal Form Languages. CTRS 1992: 272-286 - 1991
- [c3]Gregory Kucherov
:
On Relationship Between Term Rewriting Systems and Regular Tree Languages. RTA 1991: 299-311 - 1990
- [c2]Alexandre V. Zamulin, V. A. Kositov, Gregory Kucherov
, E. V. Pak:
The Database Programming Language Atlant: Principal Features and Implementation techniques. East/West Database Workshop 1990: 385-402
1980 – 1989
- 1988
- [c1]Gregory Kucherov
:
A New Quasi-Reducibility Testing Algorithm and its Application to Proofs