The following pages link to Thierry Lecroq (Q287178):
Displaying 39 items.
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
- FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
- A note on easy and efficient computation of full abelian periods of a word (Q313772) (← links)
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- Algorithms for computing abelian periods of words (Q496544) (← links)
- Binary block order Rouen transform (Q507387) (← links)
- Fast computation of abelian runs (Q507408) (← links)
- (Q591848) (redirect page) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
- Fast multiple pattern Cartesian tree matching (Q782168) (← links)
- Fast exact string matching algorithms (Q846013) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- Reducing the structure space of Bayesian classifiers using some general algorithms (Q894536) (← links)
- On-line construction of compact suffix vectors and maximal repeats (Q955004) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- On special families of morphisms related to \(\delta \)-matching and don't care symbols (Q1007535) (← links)
- A variation on the Boyer-Moore algorithm (Q1190458) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- Fast practical multi-pattern matching (Q1606976) (← links)
- A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
- FM-index of alignment with gaps (Q1698723) (← links)
- Compror: On-line lossless data compression with a factor oracle. (Q1853024) (← links)
- Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968) (← links)
- Fast string matching for DNA sequences (Q2297856) (← links)
- Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks (Q2346635) (← links)
- On-line string matching in highly similar DNA sequences (Q2363986) (← links)
- Linking indexing data structures to de Bruijn graphs: construction and update (Q2424683) (← links)
- Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (Q2799166) (← links)
- Online Computation of Abelian Runs (Q2799190) (← links)
- The exact online string matching problem (Q2875102) (← links)
- A Fast Suffix Automata Based Algorithm for Exact Online String Matching (Q2914702) (← links)
- Algorithms on Strings (Q2925476) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- (Q3370008) (← links)
- From Suffix Trees to Suffix Vectors (Q3421852) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431326) (← links)
