The following pages link to Maxime Crochemore (Q200906):
Displaying 36 items.
- (Q4849531) (← links)
- (Q4858437) (← links)
- Understanding maximal repetitions in strings (Q4910702) (← links)
- (Q4910720) (← links)
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285) (← links)
- Locating All Maximal Approximate Runs in a String (Q4928555) (← links)
- A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform (Q4928562) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- On linear-time alphabet-independent 2-dimensional pattern matching (Q5096334) (← links)
- Speeding up two string-matching algorithms (Q5096813) (← links)
- (Q5111799) (← links)
- Linear-Time Algorithm for Long LCF with k Mismatches (Q5140788) (← links)
- Hunting Redundancies in Strings (Q5199949) (← links)
- Building Phylogeny with Minimal Absent Words (Q5200056) (← links)
- Periodic-Finite-Type Shift Spaces (Q5273619) (← links)
- Combinatorial Pattern Matching (Q5315324) (← links)
- Text redundancies (Q5365561) (← links)
- REVERSE ENGINEERING PREFIX TABLES (Q5389985) (← links)
- String Processing and Information Retrieval (Q5393976) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431350) (← links)
- Algorithms on Strings (Q5444160) (← links)
- (Q5458488) (← links)
- Algorithms – ESA 2005 (Q5475853) (← links)
- (Q5506326) (← links)
- Factor Oracles (Q5757230) (← links)
- 125 Problems in Text Algorithms (Q5857705) (← links)
- Shortest covers of all cyclic shifts of a string (Q5896123) (← links)
- String Processing and Information Retrieval (Q5897139) (← links)
- LATIN 2004: Theoretical Informatics (Q5901647) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5920146) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- Computing evolutionary chains in musical sequences (Q5942559) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← 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)
