Contact

All Stories

  1. Cartesian and Lyndon trees

    Article • Theoretical Computer Science, February 2020, Elsevier

    Professor Maxime Crochemore

  2. Shortest Covers of All Cyclic Shifts of a String

    Article • January 2020, Springer Science + Business Media

    Professor Maxime Crochemore

  3. Preface

    Article • Fundamenta Informaticae, November 2018, IOS Press

    Professor Maxime Crochemore

  4. Efficient enumeration of non-equivalent squares in partial words with few holes

    Article • Journal of Combinatorial Optimization, May 2018, Springer Science + Business Media

    Professor Maxime Crochemore

  5. Counting maximal-exponent factors in words

    Article • Theoretical Computer Science, January 2017, Elsevier

    Professor Maxime Crochemore

  6. Efficient computation of maximal anti-exponent in palindrome-free strings

    Article • Theoretical Computer Science, December 2016, Elsevier

    Professor Maxime Crochemore

  7. On the density of Lyndon roots in factors

    Article • Theoretical Computer Science, December 2016, Elsevier

    Professor Maxime Crochemore

  8. Linear-size suffix tries

    Article • Theoretical Computer Science, July 2016, Elsevier

    Professor Maxime Crochemore

  9. Order-preserving indexing

    Article • Theoretical Computer Science, July 2016, Elsevier

    Professor Maxime Crochemore

  10. Computing maximal-exponent factors in an overlap-free word

    Article • Journal of Computer and System Sciences, May 2016, Elsevier

    Professor Maxime Crochemore

  11. Linear algorithm for conservative degenerate pattern matching

    Article • Engineering Applications of Artificial Intelligence, May 2016, Elsevier

    Professor Maxime Crochemore

  12. 40 years of suffix trees

    Article • Communications of the ACM, March 2016, ACM (Association for Computing Machinery)

    Professor Maxime Crochemore

  13. Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries

    Article • January 2016, Springer Science + Business Media

    Professor Maxime Crochemore

  14. Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats

    Article • January 2016, Springer Science + Business Media

    Professor Maxime Crochemore

  15. A note on the longest common compatible prefix problem for partial words

    Article • Journal of Discrete Algorithms, September 2015, Elsevier

    Professor Maxime Crochemore

  16. The longest common substring problem

    Article • Mathematical Structures in Computer Science, May 2015, Cambridge University Press

    Professor Maxime Crochemore

  17. Computing the Burrows–Wheeler transform in place and in small space

    Article • Journal of Discrete Algorithms, May 2015, Elsevier

    Professor Maxime Crochemore

  18. Infinite binary words containing repetitions of odd period

    Article • Information Processing Letters, May 2015, Elsevier

    Professor Maxime Crochemore

  19. StringMasters 2012 & 2013 special issue – volume 2

    Article • Journal of Discrete Algorithms, May 2015, Elsevier

    Professor Maxime Crochemore

  20. Finite repetition threshold for large alphabets

    Article • RAIRO - Theoretical Informatics and Applications, August 2014, EDP Sciences

    Professor Maxime Crochemore

  21. Abelian borders in binary words

    Article • Discrete Applied Mathematics, July 2014, Elsevier

    Professor Maxime Crochemore

  22. Indexing a sequence for mapping reads with a single mismatch

    Article • Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences, April 2014, Royal Society Publishing

    Professor Maxime Crochemore

  23. Note on the greedy parsing optimality for dictionary-based text compression

    Article • Theoretical Computer Science, March 2014, Elsevier

    Professor Maxime Crochemore

  24. On the average number of regularities in a word

    Article • Theoretical Computer Science, March 2014, Elsevier

    Professor Maxime Crochemore

  25. Extracting powers and periods in a word from its runs structure

    Article • Theoretical Computer Science, February 2014, Elsevier

    Professor Maxime Crochemore

  26. Covering Problems for Partial Words and for Indeterminate Strings

    Article • January 2014, Springer Science + Business Media

    Professor Maxime Crochemore

  27. New simple efficient algorithms computing powers and runs in strings

    Article • Discrete Applied Mathematics, January 2014, Elsevier

    Professor Maxime Crochemore

  28. Efficient seed computation revisited

    Article • Theoretical Computer Science, April 2013, Elsevier

    Professor Maxime Crochemore

  29. The Rightmost Equal-Cost Position Problem

    Article • March 2013, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore

  30. A note on efficient computation of all Abelian periods in a string

    Article • Information Processing Letters, February 2013, Elsevier

    Professor Maxime Crochemore

  31. Computing the Longest Previous Factor

    Article • European Journal of Combinatorics, January 2013, Elsevier

    Professor Maxime Crochemore

  32. Computing all subtree repeats in ordered trees

    Article • Information Processing Letters, December 2012, Elsevier

    Professor Maxime Crochemore

  33. A comparison of index-based lempel-Ziv LZ77 factorization algorithms

    Article • ACM Computing Surveys, November 2012, ACM (Association for Computing Machinery)

    Professor Maxime Crochemore

  34. The maximal number of cubic runs in a word

    Article • Journal of Computer and System Sciences, November 2012, Elsevier

    Professor Maxime Crochemore

  35. IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS

    Article • International Journal of Foundations of Computer Science, September 2012, World Scientific Pub Co Pte Lt

    Professor Maxime Crochemore

  36. Using minimal absent words to build phylogeny

    Article • Theoretical Computer Science, September 2012, Elsevier

    Professor Maxime Crochemore

  37. Improved algorithms for the range next value problem and applications

    Article • Theoretical Computer Science, May 2012, Elsevier

    Professor Maxime Crochemore

  38. ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS

    Article • International Journal of Foundations of Computer Science, February 2012, World Scientific Pub Co Pte Lt

    Professor Maxime Crochemore

  39. Fewest repetitions in infinite binary words

    Article • RAIRO - Theoretical Informatics and Applications, August 2011, EDP Sciences

    Professor Maxime Crochemore

  40. Periodic-Finite-Type Shift Spaces

    Article • IEEE Transactions on Information Theory, June 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore

  41. The “runs” conjecture

    Article • Theoretical Computer Science, June 2011, Elsevier

    Professor Maxime Crochemore

  42. Reactive automata

    Article • Information and Computation, April 2011, Elsevier

    Professor Maxime Crochemore

  43. Computing Longest Previous non-overlapping Factors

    Article • Information Processing Letters, February 2011, Elsevier

    Professor Maxime Crochemore

  44. Fast computation of a longest increasing subsequence and application

    Article • Information and Computation, September 2010, Elsevier

    Professor Maxime Crochemore

  45. NUMBER OF OCCURRENCES OF POWERS IN STRINGS

    Article • International Journal of Foundations of Computer Science, August 2010, World Scientific Pub Co Pte Lt

    Professor Maxime Crochemore

  46. Finding Patterns In Given Intervals

    Article • Fundamenta Informaticae, January 2010, IOS Press

    Professor Maxime Crochemore

  47. On the Maximal Number of Cubic Runs in a String

    Article • January 2010, Springer Science + Business Media

    Professor Maxime Crochemore

  48. Repetitions in strings: Algorithms and combinatorics

    Article • Theoretical Computer Science, November 2009, Elsevier

    Professor Maxime Crochemore

  49. From Nerode’s congruence to suffix automata with mismatches

    Article • Theoretical Computer Science, September 2009, Elsevier

    Professor Maxime Crochemore

  50. Optimal prefix and suffix queries on texts

    Article • Information Processing Letters, November 2008, Elsevier

    Professor Maxime Crochemore

  51. Maximal repetitions in strings

    Article • Journal of Computer and System Sciences, August 2008, Elsevier

    Professor Maxime Crochemore

  52. Approximating the 2-interval pattern problem

    Article • Theoretical Computer Science, May 2008, Elsevier

    Professor Maxime Crochemore

  53. Computing Longest Previous Factor in linear time and applications

    Article • Information Processing Letters, April 2008, Elsevier

    Professor Maxime Crochemore

  54. A Simple Algorithm for Computing the Lempel Ziv Factorization

    Article • March 2008, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore

  55. THE STRUCTURE OF FACTOR ORACLES

    Article • International Journal of Foundations of Computer Science, August 2007, World Scientific Pub Co Pte Lt

    Professor Maxime Crochemore

  56. Minimizing local automata

    Article • June 2007, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore

  57. All maximal-pairs in step–leap representation of melodic sequence

    Article • Information Sciences, May 2007, Elsevier

    Professor Maxime Crochemore

  58. Longest repeats with a block of k don’t cares

    Article • Theoretical Computer Science, October 2006, Elsevier

    Professor Maxime Crochemore

  59. Presentations of Constrained Systems With Unconstrained Positions

    Article • IEEE Transactions on Information Theory, May 2005, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore

  60. A note on the Burrows–Wheeler transformation

    Article • Theoretical Computer Science, February 2005, Elsevier

    Professor Maxime Crochemore

  61. Bases of Motifs for Generating Repeated Patterns with Wild Cards

    Article • IEEE/ACM Transactions on Computational Biology and Bioinformatics, January 2005, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore

  62. Two-dimensional pattern matching with rotations

    Article • Theoretical Computer Science, February 2004, Elsevier

    Professor Maxime Crochemore

  63. Longest Repeats with a Block of Don’t Cares

    Article • January 2004, Springer Science + Business Media

    Professor Maxime Crochemore

  64. Waiting time and complexity for matching patterns with automata

    Article • Information Processing Letters, August 2003, Elsevier

    Professor Maxime Crochemore

  65. A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

    Article • SIAM Journal on Computing, January 2003, Society for Industrial & Applied Mathematics (SIAM)

    Professor Maxime Crochemore

  66. Reducing space for index implementation

    Article • Theoretical Computer Science, January 2003, Elsevier

    Professor Maxime Crochemore

  67. A fast and practical bit-vector algorithm for the Longest Common Subsequence problem

    Article • Information Processing Letters, December 2001, Elsevier

    Professor Maxime Crochemore

  68. Data compression using antidictionaries

    Article • Proceedings of the IEEE, November 2000, Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore

  69. Fast practical multi-pattern matching

    Article • Information Processing Letters, August 1999, Elsevier

    Professor Maxime Crochemore

  70. Zones of low entropy in genomic sequences

    Article • Computers & Chemistry, June 1999, Elsevier

    Professor Maxime Crochemore

  71. Constant-space string-matching in sublinear average time

    Article • Theoretical Computer Science, April 1999, Elsevier

    Professor Maxime Crochemore

  72. Automata and forbidden words

    Article • Information Processing Letters, August 1998, Elsevier

    Professor Maxime Crochemore

  73. A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching

    Article • SIAM Journal on Computing, June 1998, Society for Industrial & Applied Mathematics (SIAM)

    Professor Maxime Crochemore

  74. Thue-Morse sequence and p-adic topology for the free monoid

    Article • Discrete Mathematics, January 1989, Elsevier

    Professor Maxime Crochemore

  75. Transducers and repetitions

    Article • Theoretical Computer Science, January 1986, Elsevier

    Professor Maxime Crochemore

  76. An optimal test on finite unavoidable sets of words

    Article • Information Processing Letters, May 1983, Elsevier

    Professor Maxime Crochemore

  77. Partitioning a graph in O(¦A¦log2¦V¦)

    Article • Theoretical Computer Science, July 1982, Elsevier

    Professor Maxime Crochemore

  78. Sharp characterizations of squarefree morphisms

    Article • Theoretical Computer Science, May 1982, Elsevier

    Professor Maxime Crochemore

  79. An optimal algorithm for computing the repetitions in a word

    Article • Information Processing Letters, October 1981, Elsevier

    Professor Maxime Crochemore

  80. Speeding-up hirschberg and hunt-szymanski LCS algorithms

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore

  81. Constant-space string-matching in sublinear average time

    Article • Institute of Electrical & Electronics Engineers (IEEE)

    Professor Maxime Crochemore