His scientific interests lie mostly in Combinatorics, Algorithm, Pattern matching, Theoretical computer science and String searching algorithm. His Combinatorics research includes themes of Discrete mathematics, String and Combinatorics on words. His studies in Algorithm integrate themes in fields like Constant, Artificial intelligence and Pattern recognition.
Maxime Crochemore combines subjects such as Automaton, Regular expression, Word, Suffix tree and Matching with his study of Pattern matching. His Theoretical computer science research is multidisciplinary, incorporating elements of Compressed pattern matching, Data compression, Interval, Range and Text graph. His String searching algorithm research focuses on Approximate string matching and how it connects with Approximation algorithm.
His main research concerns Combinatorics, Algorithm, String, Discrete mathematics and Pattern matching. Maxime Crochemore has researched Combinatorics in several fields, including Word, Word, Suffix and String searching algorithm. His String searching algorithm research is multidisciplinary, relying on both Suffix array and Approximate string matching.
His biological study spans a wide range of topics, including Automaton, Theoretical computer science and Data structure. His studies deal with areas such as Prefix, Cover, Computation and Integer as well as String. His research in Pattern matching focuses on subjects like Suffix tree, which are connected to Suffix automaton.
His primary areas of study are Combinatorics, String, Word, Time complexity and Word. His Combinatorics study combines topics from a wide range of disciplines, such as Partial word, Exponent and Pattern matching. His primary area of study in String is in the field of String searching algorithm.
The subject of his Time complexity research is within the realm of Algorithm. His work on Distance matrix as part of general Algorithm study is frequently linked to Sequence comparison, therefore connecting diverse disciplines of science. His Word research integrates issues from Similarity measure, Pattern recognition, Sequence and Lyndon words.
Maxime Crochemore mainly focuses on Combinatorics, Word, Sequence, Algorithm and Pattern matching. His Combinatorics research is multidisciplinary, incorporating elements of Cartesian coordinate system, String, Suffix tree and Table. His studies deal with areas such as Ackermann function, Suffix and Extension as well as String.
His work focuses on many connections between Word and other disciplines, such as Process, that overlap with his field of interest in Integer and Upper and lower bounds. His Sequence study integrates concerns from other disciplines, such as Context, Jaccard index, Similarity measure, Pattern recognition and Symmetric difference. His work on Time complexity as part of general Algorithm study is frequently connected to Sequence comparison, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Text algorithms
Maxime Crochemore;Wojciech Rytter.
(1994)
Algorithms on Strings
Maxime Crochemore;Christophe Hancart;Thierry Lecroq.
(2007)
Jewels of stringology : text algorithms
Maxime Crochemore;Wojciech Rytter.
(2002)
An optimal algorithm for computing the repetitions in a word
Maxime Crochemore.
Information Processing Letters (1981)
Extracting Powers and Periods in a String from Its Runs Structure
Maxime Crochemore;Costas S. Iliopoulos;Marcin Kubica;Jakub Radoszewski.
Lecture Notes in Computer Science (2010)
Jewels of stringology
Maxime Crochemore;Wojciech Rytter.
(2002)
Transducers and repetitions
Maxime Crochemore.
Theoretical Computer Science (1986)
Factor Oracle: A New Structure for Pattern Matching
Cyril Allauzen;Maxime Crochemore;Mathieu Raffinot.
conference on current trends in theory and practice of informatics (1999)
Speeding up two string-matching algorithms
Maxime Crochemore;Artur Czumaj;Leszek Gasieniec;Stefan Jarominek.
Algorithmica (1994)
Two-way string-matching
Maxime Crochemore;Dominique Perrin.
Journal of the ACM (1991)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
King's College London
University of Warsaw
University of Haifa
Seoul National University
University of Chile
University of Warwick
Northeastern University
McMaster University
University of Liverpool
Georgia Institute of Technology
French Institute for Research in Computer Science and Automation - INRIA
United States Naval Research Laboratory
University of Colorado Boulder
Ben-Gurion University of the Negev
Lund University
University of Washington
Kiel University
Helmholtz Centre for Infection Research
Northwest Research Associates
University of Wyoming
Hunan University
University of South Carolina
University of Lille
Johannes Gutenberg University of Mainz
MIT
University of KwaZulu-Natal