| 2009 |
|---|
| 34 | EE | Alexandre Pauchet,
M. el Abed,
T. Merabti,
Élise Prieur,
Thierry Lecroq,
Stéfan Jacques Darmoni:
Identification de répétitions dans les navigations au sein d'un catalogue de santé.
Revue d'Intelligence Artificielle 23(1): 113-132 (2009) |
| 2008 |
|---|
| 33 | EE | Maxime Crochemore,
Thierry Lecroq:
Sequential Exact String Matching.
Encyclopedia of Algorithms 2008 |
| 32 | EE | Maxime Crochemore,
Thierry Lecroq:
Sequential Multiple String Matching.
Encyclopedia of Algorithms 2008 |
| 31 | EE | Simone Faro,
Thierry Lecroq:
Efficient Pattern Matching on Binary Strings
CoRR abs/0810.2390: (2008) |
| 30 | EE | Élise Prieur,
Thierry Lecroq:
On-line construction of compact suffix vectors and maximal repeats.
Theor. Comput. Sci. 407(1-3): 290-301 (2008) |
| 2007 |
|---|
| 29 | EE | Thierry Lecroq:
Fast exact string matching algorithms.
Inf. Process. Lett. 102(6): 229-235 (2007) |
| 2006 |
|---|
| 28 | EE | Maxime Crochemore,
Thierry Lecroq:
Text Searching and Indexing.
Recent Advances in Formal Languages and Applications 2006: 43-80 |
| 27 | EE | Élise Prieur,
Thierry Lecroq:
From Suffix Trees to Suffix Vectors.
Int. J. Found. Comput. Sci. 17(6): 1385-1402 (2006) |
| 2005 |
|---|
| 26 | | Élise Prieur,
Thierry Lecroq:
From suffix trees to suffix vectors.
Stringology 2005: 37-53 |
| 25 | | Jean-Pierre Duval,
Thierry Lecroq,
Arnaud Lefebvre:
Border Array on Bounded Alphabet.
Journal of Automata, Languages and Combinatorics 10(1): 51-60 (2005) |
| 2004 |
|---|
| 24 | EE | Jean-Pierre Duval,
Roman Kolpakov,
Gregory Kucherov,
Thierry Lecroq,
Arnaud Lefebvre:
Linear-time computation of local periods.
Theor. Comput. Sci. 326(1-3): 229-240 (2004) |
| 2003 |
|---|
| 23 | EE | Jean-Pierre Duval,
Roman Kolpakov,
Gregory Kucherov,
Thierry Lecroq,
Arnaud Lefebvre:
Linear-Time Computation of Local Periods.
MFCS 2003: 388-397 |
| 22 | | Arnaud Lefebvre,
Thierry Lecroq,
H. Dauchel,
Joël Alexandre:
FORRepeats: detects repeats on entire chromosomes and between genomes.
Bioinformatics 19(3): 319-326 (2003) |
| 21 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Thierry Lecroq:
Occurrence and Substring Heuristics for i-Matching.
Fundam. Inform. 56(1-2): 1-21 (2003) |
| 20 | EE | Richard Cole,
Costas S. Iliopoulos,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
On special families of morphisms related to [delta]-matching and don't care symbols.
Inf. Process. Lett. 85(5): 227-233 (2003) |
| 19 | EE | Maxime Crochemore,
Christophe Hancart,
Thierry Lecroq:
A unifying look at the Apostolico-Giancarlo string-matching algorithm.
J. Discrete Algorithms 1(1): 37-52 (2003) |
| 18 | | Arnaud Lefebvre,
Thierry Lecroq,
Joël Alexandre:
An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle.
Journal of Automata, Languages and Combinatorics 8(4): 647-657 (2003) |
| 2002 |
|---|
| 17 | EE | Maxime Crochemore,
Costas S. Iliopoulos,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms.
CPM 2002: 178-189 |
| 16 | | Thierry Lecroq,
Jean Frédéric Myoupo,
David Semé:
Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word.
Computers and Their Applications 2002: 18-21 |
| 15 | EE | Arnaud Lefebvre,
Thierry Lecroq:
Compror: On-line lossless data compression with a factor oracle.
Inf. Process. Lett. 83(1): 1-6 (2002) |
| 14 | EE | Arnaud Lefebvre,
Thierry Lecroq:
A Heuristic for Computing Repeats with a Factor Oracle: Application to Biological Sequences.
Int. J. Comput. Math. 79(12): 1303-1315 (2002) |
| 2001 |
|---|
| 13 | EE | Arnaud Lefebvre,
Thierry Lecroq:
Compror: Compression with a Factor Oracle.
Data Compression Conference 2001: 502 |
| 1999 |
|---|
| 12 | EE | Maxime Crochemore,
Artur Czumaj,
Leszek Gasieniec,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Fast Practical Multi-Pattern Matching.
Inf. Process. Lett. 71(3-4): 107-113 (1999) |
| 1998 |
|---|
| 11 | | Christian Charras,
Thierry Lecroq,
Joseph Daniel Pehoushek:
A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract).
CPM 1998: 55-64 |
| 10 | | Thierry Lecroq,
Jean Frédéric Myoupo,
David Semé:
A One-Phase Parallel Algorithm for the Sequence Alignment Problem.
Parallel Processing Letters 8(4): 515-526 (1998) |
| 9 | | Thierry Lecroq:
Experiments on String Matching in Memory Structures.
Softw., Pract. Exper. 28(5): 561-568 (1998) |
| 1997 |
|---|
| 8 | | Maxime Crochemore,
Thierry Lecroq:
Pattern Matching and Text Compression Algorithms.
The Computer Science and Engineering Handbook 1997: 161-202 |
| 7 | EE | Thierry Lecroq,
Guillaume Luce,
Jean Frédéric Myoupo:
A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence.
Inf. Process. Lett. 61(3): 129-136 (1997) |
| 6 | EE | Maxime Crochemore,
Thierry Lecroq:
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm.
Inf. Process. Lett. 63(4): 195-203 (1997) |
| 1996 |
|---|
| 5 | | Maxime Crochemore,
Thierry Lecroq:
Pattern-Matching and Text-Compression Algorithms.
ACM Comput. Surv. 28(1): 39-41 (1996) |
| 1995 |
|---|
| 4 | | Thierry Lecroq:
Experimental Results on String Matching Algorithms.
Softw., Pract. Exper. 25(7): 727-765 (1995) |
| 1994 |
|---|
| 3 | | Maxime Crochemore,
Artur Czumaj,
Leszek Gasieniec,
Stefan Jarominek,
Thierry Lecroq,
Wojciech Plandowski,
Wojciech Rytter:
Speeding Up Two String-Matching Algorithms.
Algorithmica 12(4/5): 247-267 (1994) |
| 1992 |
|---|
| 2 | | Maxime Crochemore,
Thierry Lecroq,
Artur Czumaj,
Leszek Gasieniec,
Stefan Jarominek,
Wojciech Plandowski,
Wojciech Rytter:
Speeding Up Two String-Matching Algorithms.
STACS 1992: 589-600 |
| 1 | | Thierry Lecroq:
A Variation on the Boyer-Moore Algorithm.
Theor. Comput. Sci. 92(1): 119-144 (1992) |
