Gregory Kucherov

According to our database1, Gregory Kucherov authored at least 84 papers between 1988 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





Absent words in a sliding window with applications.
Inf. Comput., 2020

Optimal bounds for computing α-gapped repeats.
Inf. Comput., 2019

Evolution of biosequence search algorithms: a brief survey.
Bioinformatics, 2019

Full-Fledged Real-Time Indexing for Constant Size Alphabets.
Algorithmica, 2017

Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Approximate Tandem Repeats.
Encyclopedia of Algorithms, 2016

Approximate string matching using a bidirectional index.
Theor. Comput. Sci., 2016

RNF: a general framework to evaluate NGS read mappers.
Bioinformatics, 2016

Optimal Bounds for Computing \alpha α -gapped Repeats.
Proceedings of the Language and Automata Theory and Applications, 2016

Optimal searching of gapped repeats in a word.
CoRR, 2015

Spaced seeds improve metagenomic classification.
CoRR, 2015

Spaced seeds improve k-mer-based metagenomic classification.
Bioinformatics, 2015

Computing the Longest Unbordered Substring.
Proceedings of the String Processing and Information Retrieval, 2015

On Maximal Unbordered Factors.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Algorithms for path-constrained sequence alignment.
J. Discrete Algorithms, 2014

Cross-document pattern matching.
J. Discrete Algorithms, 2014

Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111).
Dagstuhl Reports, 2014

Using cascading Bloom filters to improve the memory usage for de Brujin graphs.
Algorithms for Molecular Biology, 2014

Improved Filters for the Approximate Suffix-Prefix Overlap Problem.
Proceedings of the String Processing and Information Retrieval, 2014

On-line construction of position heaps.
J. Discrete Algorithms, 2013

On the combinatorics of suffix arrays.
Inf. Process. Lett., 2013

Using cascading Bloom filters to improve the memory usage for de Brujin graphs
CoRR, 2013

Approximate String Matching using a Bidirectional Index.
CoRR, 2013

Minimal Discriminating Words Problem Revisited.
Proceedings of the String Processing and Information Retrieval, 2013

Prefix Table Construction and Conversion.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Computing Discriminating and Generic Words.
Proceedings of the String Processing and Information Retrieval, 2012

Cross-Document Pattern Matching.
Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

J. Discrete Algorithms, 2011

Regular Language Constrained Sequence Alignment Revisited.
Journal of Computational Biology, 2011

Linear pattern matching on sparse suffix trees
CoRR, 2011

Pattern Matching on Sparse Suffix Trees.
Proceedings of the First International Conference on Data Compression, 2011

Subset Seed Extension to Protein BLAST.
Proceedings of the BIOINFORMATICS 2011, 2011

On maximal repetitions of arbitrary exponent.
Inf. Process. Lett., 2010

Back-translation for discovering distant protein homologies in the presence of frameshift mutations.
Algorithms for Molecular Biology, 2010

Designing Efficient Spaced Seeds for SOLiD Read Mapping.
Adv. Bioinformatics, 2010

Seed Design Framework for Mapping SOLiD Reads.
Proceedings of the Research in Computational Molecular Biology, 2010

Searching for gapped palindromes.
Theor. Comput. Sci., 2009

On Subset Seeds for Protein Alignment.
IEEE/ACM Trans. Comput. Biology Bioinform., 2009

Back-Translation for Discovering Distant Protein Homologies.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

CPM's 20th Anniversary: A Statistical Retrospective.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

Approximate Tandem Repeats.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

NORINE: a database of nonribosomal peptides.
Nucleic Acids Research, 2008

SIGffRid: A tool to search for sigma factor binding sites in bacterial genomes using comparative approach and biologically driven statistics.
BMC Bioinformatics, 2008

Optimal neighborhood indexing for protein similarity search.
BMC Bioinformatics, 2008

Efficient Seeding Techniques for Protein Similarity Search.
Proceedings of the Bioinformatics Research and Development, 2008

Subset Seed Automaton.
Proceedings of the Implementation and Application of Automata, 2007

Protein Similarity Search with Subset Seeds on a Dedicated Reconfigurable Hardware.
Proceedings of the Parallel Processing and Applied Mathematics, 2007

A Unifying Framework for Seed Sensitivity and its Application to Subset Seeds.
J. Bioinformatics and Computational Biology, 2006

An Overview of the Algorithmic Session of MCCMB'05.
J. Bioinformatics and Computational Biology, 2006

A unifying framework for seed sensitivity and its application to subset seeds (Extended abstract)
CoRR, 2006

Optimal Linear Arrangement of Interval Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Multiseed Lossless Filtration.
IEEE/ACM Trans. Comput. Biology Bioinform., 2005

YASS: enhancing the sensitivity of DNA similarity search.
Nucleic Acids Research, 2005

Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Linear-time computation of local periods.
Theor. Comput. Sci., 2004

Improved hit criteria for DNA local alignment.
BMC Bioinformatics, 2004

Multi-seed Lossless Filtration (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

Estimating Seed Sensitivity on Homogeneous Alignments.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

Finding approximate repetitions under Hamming distance.
Theor. Comput. Sci., 2003

mreps: efficient and flexible detection of tandem repeats in DNA.
Nucleic Acids Research, 2003

How Many Square Occurrences Must a Binary Sequence Contain?
Electr. J. Comb., 2003

Optimal Reconstruction of Graphs under the Additive Model.
Algorithmica, 2000

Finding Repeats with Fixed Gap.
Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, 2000

On Repetition-Free Binary Words of Minimal Density.
Theor. Comput. Sci., 1999

The Complexity of Some Complementation Problems.
Inf. Process. Lett., 1999

Reconstructing Set Partitions.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Finding Maximal Repetitions in a Word in Linear Time.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

On Maximal Repetitions in Words.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

Patterns in Words versus Patterns in Trees: A Brief Survey and New Results.
Proceedings of the Perspectives of System Informatics, 1999

Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping.
Discrete Applied Mathematics, 1998

Matching a Set of Strings with Variable Length don't Cares.
Theor. Comput. Sci., 1997

Visualization of Dynamic Automata Using Padnon.
Proceedings of the Automata Implementation, 1997

Minimal Letter Frequency in n-th Power-Free Binary Words.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

Valentin M. Antimirov (1961-1995).
Theor. Comput. Sci., 1996

Decidability of Regularity and Related Properties of Ground Normal Form Languages
Inf. Comput., April, 1995

Undecidability of Ground Reducibility for Word Rewriting Systems with Variables.
Inf. Process. Lett., 1995

On ground reducibility problem for word rewriting systems with variables.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables.
Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

Some Results on Top-Context-Free Tree Languages.
Proceedings of the Trees in Algebra and Programming, 1994

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.
Information & Software Technology, 1992

On Relationship Between Term Rewriting Systems and Regular Tree Languages.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

The Database Programming Language Atlant: Principal Features and Implementation techniques.
Proceedings of the Next Generation Information System Technology, 1990

A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Induction.
Proceedings of the Algebraic and Logic Programming, 1988