The following pages link to Maxime Crochemore (Q200906):
Displaying 24 items.
- Automata and forbidden words (Q293331) (← links)
- Order-preserving indexing (Q294954) (← links)
- Efficient seed computation revisited (Q390905) (← links)
- Using minimal absent words to build phylogeny (Q442159) (← links)
- A note on the longest common compatible prefix problem for partial words (Q491152) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Thue-Morse sequence and p-adic topology for the free monoid (Q1121888) (← links)
- An optimal algorithm for computing the repetitions in a word (Q1155963) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- Computing the longest previous factor (Q1761495) (← links)
- A note on the Burrows-Wheeler transformation (Q1770410) (← links)
- Transducers and repetitions (Q1820587) (← links)
- An optimal test on finite unavoidable sets of words (Q1836993) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- A comparison of index-based lempel-Ziv LZ77 factorization algorithms (Q2875093) (← links)
- THE STRUCTURE OF FACTOR ORACLES (Q3503093) (← links)
- Presentations of Constrained Systems With Unconstrained Positions (Q3546549) (← links)
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices (Q4441897) (← links)
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285) (← links)
- Internal Quasiperiod Queries (Q6485920) (← links)
- Back-to-front online Lyndon forest construction (Q6496839) (← links)
- Linear-time computation of shortest covers of all rotations of a string (Q6496851) (← links)
