40 years of suffix trees

academic article

A Bit-Parallel Suffix Automaton Approach for (δ,γ)-Matching in Music Retrieval ⬇️

Article by Crochemore et al.

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

A Simple Algorithm for Computing the Lempel Ziv Factorization

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices

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

article

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

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

scholarly article by Maxime Crochemore et al published February 2013 in Information Processing Letters

A note on the Burrows–Wheeler transformation

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

Abelian borders in binary words

Absent words and the (dis)similarity analysis of DNA sequences: an experimental study

artículo científico publicado en 2016

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

article

Approximating the 2-interval pattern problem

Automata and forbidden words

Automata for Matching Patterns ⬇️

Article by Crochemore and Hancart

Bases of motifs for generating repeated patterns with wild cards.

artículo científico publicado en 2005

Cartesian and Lyndon trees

Computing Longest Previous Factor in linear time and applications

Computing Longest Previous non-overlapping Factors

article

Computing all subtree repeats in ordered trees

scholarly article by Michalis Christou et al published December 2012 in Information Processing Letters

Computing maximal-exponent factors in an overlap-free word

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

Computing the Longest Previous Factor

Constant-space string-matching in sublinear average time

Constant-space string-matching in sublinear average time

Counting maximal-exponent factors in words

Covering Problems for Partial Words and for Indeterminate Strings

Data compression using antidictionaries

Direct construction of compact directed acyclic word graphs

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

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

Efficient seed computation revisited

Extracting powers and periods in a word from its runs structure

Fast computation of a longest increasing subsequence and application

Fast phylogenetic inference from typing data.

artículo científico publicado en 2018

Fast practical multi-pattern matching

Fewest repetitions in infinite binary words

Finding Patterns In Given Intervals

artículo científico publicado en 2010

Finite repetition threshold for large alphabets

From Nerode’s congruence to suffix automata with mismatches

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

Improved algorithms for the range next value problem and applications

article

Indexing a sequence for mapping reads with a single mismatch.

artículo científico publicado en 2014

Infinite binary words containing repetitions of odd period

scholarly article by Golnaz Badkobeh & Maxime Crochemore published May 2015 in Information Processing Letters

Linear algorithm for conservative degenerate pattern matching

Linear-size suffix tries

Longest Repeats with a Block of Don’t Cares

article

Longest repeats with a block of k don’t cares

article

Maximal repetitions in strings

Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching

Minimizing local automata

NUMBER OF OCCURRENCES OF POWERS IN STRINGS

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

Negative Information for Building Phylogenies ⬇️

artículo científico publicado el 1 de agosto de 2013

New simple efficient algorithms computing powers and runs in strings

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

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

On compact directed acyclic word graphs ⬇️

Article by Crochemore and Verin

On the Maximal Number of Cubic Runs in a String

On the average number of regularities in a word

On the density of Lyndon roots in factors

article

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

Optimal prefix and suffix queries on texts

scholarly article by Maxime Crochemore et al published November 2008 in Information Processing Letters

Order-preserving indexing

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

Periodic-Finite-Type Shift Spaces

Presentations of Constrained Systems With Unconstrained Positions

article by M.-P. Beal et al published May 2005 in IEEE Transactions on Information Theory

Reactive automata

Reducing space for index implementation

Repetitions in strings: Algorithms and combinatorics

Shortest Covers of All Cyclic Shifts of a String

artículo científico publicado en 2020

Speeding-up hirschberg and hunt-szymanski LCS algorithms

scholarly article

StringMasters 2012 & 2013 special issue – volume 2

THE STRUCTURE OF FACTOR ORACLES

Term Weighting

artículo científico publicado en 2009

The Rightmost Equal-Cost Position Problem

The longest common substring problem

The maximal number of cubic runs in a word

The “runs” conjecture

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

Transducers and repetitions

Tuple-Generating Dependencies

Two-dimensional pattern matching with rotations

Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays

Using minimal absent words to build phylogeny

Waiting time and complexity for matching patterns with automata

Zones of low entropy in genomic sequences

scientific article published on 01 June 1999