The following pages link to Maxime Crochemore (Q200906):
Displaying 50 items.
- Computing the longest previous factor (Q1761495) (← links)
- A note on the Burrows-Wheeler transformation (Q1770410) (← links)
- Alignment-free sequence comparison using absent words (Q1784946) (← links)
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824) (← links)
- Transducers and repetitions (Q1820587) (← links)
- Directed acyclic subsequence graph -- overview (Q1827273) (← links)
- An optimal test on finite unavoidable sets of words (Q1836993) (← links)
- Reducing space for index implementation. (Q1853739) (← links)
- Two-dimensional pattern matching with rotations (Q1884920) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Computing all subtree repeats in ordered trees (Q1941702) (← links)
- A note on efficient computation of all abelian periods in a string (Q1943614) (← links)
- Computing longest previous non-overlapping factors (Q1944092) (← links)
- Fast computation of a longest increasing subsequence and application (Q1959440) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Cartesian and Lyndon trees (Q2285120) (← links)
- Absent words in a sliding window with applications (Q2288209) (← links)
- Infinite binary words containing repetitions of odd period (Q2339599) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- On left and right seeds of a string (Q2376787) (← links)
- Locating maximal approximate runs in a string (Q2410363) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- Note on the greedy parsing optimality for dictionary-based text compression (Q2437746) (← links)
- Abelian borders in binary words (Q2449116) (← links)
- Longest repeats with a block of \(k\) don't cares (Q2508981) (← links)
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata (Q2569397) (← links)
- Linear construction of a left Lyndon tree (Q2672265) (← links)
- Checking whether a word is Hamming-isometric in linear time (Q2676462) (← links)
- (Q2708252) (← links)
- Finite-Repetition threshold for infinite ternary words (Q2789511) (← links)
- Optimal Bounds for Computing $$\alpha $$ α -gapped Repeats (Q2798724) (← links)
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications (Q2802951) (← links)
- (Q2809942) (← links)
- Suffix Tree of Alignment: An Efficient Index for Similar Data (Q2870039) (← links)
- A comparison of index-based lempel-Ziv LZ77 factorization algorithms (Q2875093) (← links)
- The Maximum Number of Squares in a Tree (Q2904476) (← links)
- ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS (Q2909196) (← links)
- Fewest repetitions in infinite binary words (Q2911423) (← links)
- (Q2915603) (← links)
- Algorithms on Strings (Q2925476) (← links)
- Finite repetition threshold for large alphabets (Q2934276) (← links)
- Indexing a sequence for mapping reads with a single mismatch (Q2955639) (← links)
- The longest common substring problem (Q2971067) (← links)
- (Q2978301) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- Dictionary-Symbolwise Flexible Parsing (Q3000525) (← links)
- Finding Patterns In Given Intervals (Q3008096) (← links)
- Efficient Seeds Computation Revisited (Q3011867) (← links)
- On the Right-Seed Array of a String (Q3087974) (← links)
- (Q3150181) (← links)
