![]() | ![]() |
| 2012 | ||
|---|---|---|
| 57 | Simone Faro, Thierry Lecroq: A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. SEA 2012: 172-183 | |
| 56 | Eric Rivals, Nicolas Philippe, Mikaël Salson, Martine Léonard, Therese Commes, Thierry Lecroq: A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections. ERCIM News 2012(89): (2012) | |
| 2011 | ||
| 55 | Heni Bouhamed, Thierry Lecroq, Ahmed Rebai, Maher Jaoua: Improving Algorithms for Knowledge Discovery in Genetics Databases. DEXA Workshops 2011: 407-410 | |
| 54 | Tarek El Falah, Thierry Lecroq, Mourad Elloumi: An Efficient Motif Search Algorithm Based on a Minimal Forbidden Patterns Approach. PACBB 2011: 175-182 | |
| 53 | Nicolas Philippe, Mikaël Salson, Thierry Lecroq, Martine Léonard, Therese Commes, Eric Rivals: Querying large read collections in main memory: a versatile data structure. BMC Bioinformatics 12: 242 (2011) | |
| 2010 | ||
| 52 | Tarek El Falah, Thierry Lecroq, Mourad Elloumi: SMS-Forbid: An Efficient Agorithm for Simple Motif Problem. BICoB 2010: 121-126 | |
| 51 | Simone Faro, Thierry Lecroq: The Exact String Matching Problem: a Comprehensive Experimental Evaluation CoRR abs/1012.2547: (2010) | |
| 50 | Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard: Dynamic extended suffix arrays. J. Discrete Algorithms 8(2): 241-257 (2010) | |
| 2009 | ||
| 49 | Elena Yavorska Harris, Thierry Lecroq, Gregory Kucherov, Stefano Lonardi: CPM's 20th Anniversary: A Statistical Retrospective. CPM 2009: 1-11 | |
| 48 | Simone Faro, Thierry Lecroq: An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. CPM 2009: 106-115 | |
| 47 | Tayeb Merabti, Catherine Letord, Hocine Abdoune, Thierry Lecroq, Michel Joubert, Stéfan Jacques Darmoni: Projection and Inheritance of SNOMED CT Relations between MeSH Terms. MIE 2009: 233-237 | |
| 46 | Maxime Crochemore, Thierry Lecroq: Suffix Tree. Encyclopedia of Database Systems 2009: 2876-2880 | |
| 45 | Maxime Crochemore, Thierry Lecroq: Trie. Encyclopedia of Database Systems 2009: 3179-3182 | |
| 44 | Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre: Efficient validation and construction of border arrays and validation of string matching automata. ITA 43(2): 281-297 (2009) | |
| 43 | Simone Faro, Thierry Lecroq: Efficient Variants of the Backward-Oracle-Matching Algorithm. Int. J. Found. Comput. Sci. 20(6): 967-984 (2009) | |
| 42 | Alexandre Pauchet, Mohamad El-Abed, Tayeb 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) | |
| 41 | Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard: A four-stage algorithm for updating a Burrows-Wheeler transform. Theor. Comput. Sci. 410(43): 4350-4359 (2009) | |
| 2008 | ||
| 40 | Tayeb Merabti, Suzanne Pereira, Catherine Letord, Thierry Lecroq, Michel Joubert, Badisse Dahamna, Stéfan Jacques Darmoni: Searching Related Resources in a Quality Controlled Health Gateway: a Feasibility Study. MIE 2008: 235-240 | |
| 39 | Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard: Dynamic Burrows-Wheeler Transform. Stringology 2008: 13-25 | |
| 38 | Simone Faro, Thierry Lecroq: Efficient Variants of the Backward-Oracle-Matching Algorithm. Stringology 2008: 146-160 | |
| 37 | Maxime Crochemore, Thierry Lecroq: Sequential Exact String Matching. Encyclopedia of Algorithms 2008 | |
| 36 | Maxime Crochemore, Thierry Lecroq: Sequential Multiple String Matching. Encyclopedia of Algorithms 2008 | |
| 35 | Maxime Crochemore, Thierry Lecroq: Alignments and Approximate String Matching. New Developments in Formal Languages and Applications 2008: 59-93 | |
| 34 | Simone Faro, Thierry Lecroq: Efficient Pattern Matching on Binary Strings CoRR abs/0810.2390: (2008) | |
| 33 | Élise Prieur, Thierry Lecroq: On-line construction of compact suffix vectors and maximal repeats. Theor. Comput. Sci. 407(1-3): 290-301 (2008) | |
| 2007 | ||
| 32 | Maxime Crochemore, Christophe Hancart, Thierry Lecroq: Algorithms on strings. Cambridge University Press 2007: I-VIII, 1-383 | |
| 31 | Thierry Lecroq: Fast exact string matching algorithms. Inf. Process. Lett. 102(6): 229-235 (2007) | |
| 2006 | ||
| 30 | Maxime Crochemore, Thierry Lecroq: Text Searching and Indexing. Recent Advances in Formal Languages and Applications 2006: 43-80 | |
| 29 | Élise Prieur, Thierry Lecroq: From Suffix Trees to Suffix Vectors. Int. J. Found. Comput. Sci. 17(6): 1385-1402 (2006) | |
| 2005 | ||
| 28 | Élise Prieur, Thierry Lecroq: From suffix trees to suffix vectors. Stringology 2005: 37-53 | |
| 27 | Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre: Border Array on Bounded Alphabet. Journal of Automata, Languages and Combinatorics 10(1): 51-60 (2005) | |
| 2004 | ||
| 26 | Christian Charras, Thierry Lecroq: Handbook of Exact String Matching Algorithms. College Publications 2004 | |
| 25 | Costas S. Iliopoulos, Thierry Lecroq: String Algorithmics. College Publications 2004 | |
| 24 | 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 | 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 | Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq: Occurrence and Substring Heuristics for i-Matching. Fundam. Inform. 56(1-2): 1-21 (2003) | |
| 20 | 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 | 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 | 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 | Arnaud Lefebvre, Thierry Lecroq: Compror: On-line lossless data compression with a factor oracle. Inf. Process. Lett. 83(1): 1-6 (2002) | |
| 14 | 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 | Arnaud Lefebvre, Thierry Lecroq: Compror: Compression with a Factor Oracle. Data Compression Conference 2001: 502 | |
| 1999 | ||
| 12 | 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 | 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 | 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) | |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page