default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThierry Lecroq
Person information
- affiliation: University of Rouen - Normandy, France
- affiliation: University Paris-Est Marne-la-Vallée, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c48]Simone Faro, Thierry Lecroq, Francesco Pio Marino, Arianna Pavone, Stefano Scafiti:
Improving Sampled Matching through Character Context Sampling. ICTCS 2024: 300-312- [i17]Thierry Lecroq:
A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm. CoRR abs/2402.16469 (2024) - [i16]Thierry Lecroq, Francesco Pio Marino:
Fast computation of the period and of the shortest cover of a string using its Character-Distance-Sampling representation. CoRR abs/2407.18216 (2024) - 2023
- [j59]Simone Faro, Thierry Lecroq, Kunsoo Park, Stefano Scafiti:
On the Longest Common Cartesian Substring Problem. Comput. J. 66(4): 907-923 (2023) - [j58]Thierry Lecroq, Svetlana Puzynina:
TCS special issue: Combinatorics on Words - WORDS 2021. Theor. Comput. Sci. 952: 113688 (2023) - [c47]Vanessa Nina Borsan, Mathieu Giraud, Richard Groult, Thierry Lecroq:
Adding Descriptors to Melodies Improves Pattern Matching: A Study on Slovenian Folk Songs. ISMIR 2023: 474-481 - [c46]Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Approximate Cartesian Tree Matching: An Approach Using Swaps. SPIRE 2023: 49-61 - [i15]Thierry Lecroq:
Optimal-Hash Exact String Matching Algorithms. CoRR abs/2303.05799 (2023) - [i14]Bastien Auvray, Julien David, Richard Groult, Thierry Lecroq:
Approximate Cartesian Tree Matching: an Approach Using Swaps. CoRR abs/2306.16065 (2023) - 2021
- [j57]Pierre-Julien Viailly
, Vincent Sater, Mathieu Viennot, Élodie Bohers, Nicolas Vergne, Caroline Bérard, Hélène Dauchel, Thierry Lecroq, Alison Celebi, Philippe Ruminy, Vinciane Marchand, Marie-Delphine Lanic, Sydney Dubois, Dominique Penther, Hervé Tilly, Sylvain Mareschal, Fabrice Jardin:
Improving high-resolution copy number variation analysis from next generation sequencing using unique molecular identifiers. BMC Bioinform. 22(1): 120 (2021) - [j56]Siwoo Song, Geonmo Gu, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast algorithms for single and multiple pattern Cartesian tree matching. Theor. Comput. Sci. 849: 47-63 (2021) - [e3]Thierry Lecroq, Svetlana Puzynina:
Combinatorics on Words - 13th International Conference, WORDS 2021, Rouen, France, September 13-17, 2021, Proceedings. Lecture Notes in Computer Science 12847, Springer 2021, ISBN 978-3-030-85087-6 [contents] - [e2]Thierry Lecroq, Hélène Touzet:
String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings. Lecture Notes in Computer Science 12944, Springer 2021, ISBN 978-3-030-86691-4 [contents] - 2020
- [j55]Vincent Sater, Pierre-Julien Viailly, Thierry Lecroq, Élise Prieur-Gaston, Élodie Bohers, Mathieu Viennot, Philippe Ruminy, Hélène Dauchel, Pierre Vera, Fabrice Jardin:
UMI-VarCal: a new UMI-based variant caller that efficiently improves low-frequency variant detection in paired-end sequencing NGS libraries. Bioinform. 36(9): 2718-2724 (2020) - [j54]Cheol Ryu, Thierry Lecroq, Kunsoo Park:
Fast string matching for DNA sequences. Theor. Comput. Sci. 812: 137-148 (2020) - [c45]Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. Stringology 2020: 48-60 - [c44]Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. WALCOM 2020: 107-119
2010 – 2019
- 2019
- [j53]Nadia Ben Nsira, Thierry Lecroq, Élise Prieur-Gaston:
Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences. Int. J. Data Min. Bioinform. 22(1): 1-18 (2019) - [j52]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur, Bruce W. Watson:
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. Inf. Process. Lett. 147: 82-87 (2019) - [j51]Bastien Cazaux, Thierry Lecroq, Eric Rivals:
Linking indexing data structures to de Bruijn graphs: Construction and update. J. Comput. Syst. Sci. 104: 165-183 (2019) - [c43]Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. SPIRE 2019: 124-137 - [i13]Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Cartesian Tree Matching. CoRR abs/1908.04937 (2019) - [i12]Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park:
Fast Multiple Pattern Cartesian Tree Matching. CoRR abs/1911.01644 (2019) - 2018
- [j50]Pierre Morisse, Thierry Lecroq, Arnaud Lefebvre:
Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph. Bioinform. 34(24): 4213-4222 (2018) - [j49]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
A survey of string orderings and their application to the Burrows-Wheeler transform. Theor. Comput. Sci. 710: 52-65 (2018) - [j48]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment with gaps. Theor. Comput. Sci. 710: 148-157 (2018) - [c42]Nadia Ben Nsira, Thierry Lecroq, Élise Prieur-Gaston:
Practical fast on-line exact pattern matching algorithms for highly similar sequences. BIBM 2018: 1772-1777 - [c41]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Three Strategies for the Dead-Zone String Matching Algorithm. Stringology 2018: 117-128 - [r9]Maxime Crochemore, Thierry Lecroq:
Suffix Tree. Encyclopedia of Database Systems (2nd ed.) 2018 - [r8]Maxime Crochemore, Thierry Lecroq:
Trie. Encyclopedia of Database Systems (2nd ed.) 2018 - 2017
- [j47]Nadia Ben Nsira, Mourad Elloumi, Thierry Lecroq:
On-line String Matching in Highly Similar DNA Sequences. Math. Comput. Sci. 11(2): 113-126 (2017) - [p5]Nadia Ben Nsira, Thierry Lecroq, Mourad Elloumi:
Algorithms for Indexing Highly Similar DNA Sequences. Algorithms for Next-Generation Sequencing Data 2017: 3-39 - [i11]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. CoRR abs/1708.01130 (2017) - 2016
- [j46]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
A note on easy and efficient computation of full abelian periods of a word. Discret. Appl. Math. 212: 88-95 (2016) - [j45]Mounia Haddoud, Aïcha Mokhtari, Thierry Lecroq, Saïd Abdeddaïm:
Combining supervised term-weighting metrics for SVM text classification with extended term representation. Knowl. Inf. Syst. 49(3): 909-931 (2016) - [j44]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Jarkko Peltomäki, Élise Prieur-Gaston:
Abelian powers and repetitions in Sturmian words. Theor. Comput. Sci. 635: 16-34 (2016) - [j43]Joong Chae Na, Hyunjoon Kim, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment: A compressed index for similar strings. Theor. Comput. Sci. 638: 159-170 (2016) - [j42]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
Binary block order Rouen Transform. Theor. Comput. Sci. 656: 118-134 (2016) - [j41]Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Fast computation of abelian runs. Theor. Comput. Sci. 656: 256-264 (2016) - [c40]Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro, Alessandro Maggio:
The String Matching Algorithms Research Tool. Stringology 2016: 99-111 - [r7]Maxime Crochemore, Thierry Lecroq:
Multiple String Matching. Encyclopedia of Algorithms 2016: 1378-1382 - [r6]Maxime Crochemore, Thierry Lecroq:
String Matching. Encyclopedia of Algorithms 2016: 2113-2117 - [i10]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of Alignment with Gaps. CoRR abs/1606.03897 (2016) - 2015
- [j40]Nadia Ben Nsira, Thierry Lecroq, Mourad Elloumi:
A fast Boyer-Moore type pattern matching algorithm for highly similar sequences. Int. J. Data Min. Bioinform. 13(3): 266-288 (2015) - [j39]Heni Bouhamed, Afif Masmoudi, Thierry Lecroq, Ahmed Rebai:
Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks. J. Comput. Appl. Math. 287: 48-62 (2015) - [j38]Thierry Lecroq, Laurent Mouchard:
Editorial. J. Discrete Algorithms 31: 1 (2015) - [j37]Heni Bouhamed, Afif Masmoudi, Thierry Lecroq, Ahmed Rebai:
Reducing the Structure Space of Bayesian Classifiers Using Some General Algorithms. J. Math. Model. Algorithms Oper. Res. 14(2): 197-237 (2015) - [c39]Mounia Haddoud, Aïcha Mokhtari, Thierry Lecroq, Saïd Abdeddaïm:
Supervised Term Weights for Biomedical Text Classification: Improvements in Nearest Centroid Computation. CIBB 2015: 98-113 - [c38]Mounia Haddoud, Aïcha Mokhtari, Thierry Lecroq, Saïd Abdeddaïm:
Accurate Keyphrase Extraction from Scientific Papers by Mining Linguistic Information. CLBib@ISSI 2015: 12-17 - [c37]Bastien Cazaux, Thierry Lecroq, Eric Rivals:
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree. LATA 2015: 109-120 - [c36]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Online Computation of Abelian Runs. LATA 2015: 391-401 - [i9]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Online Computation of Abelian Runs. CoRR abs/1501.01429 (2015) - [i8]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Powers and Repetitions in Sturmian Words. CoRR abs/1506.02797 (2015) - [i7]Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Fast Computation of Abelian Runs. CoRR abs/1506.08518 (2015) - [i6]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
A Note on Easy and Efficient Computation of Full Abelian Periods of a Word. CoRR abs/1510.00634 (2015) - 2014
- [j36]Sylvain Mareschal, Sydney Dubois, Thierry Lecroq, Fabrice Jardin:
Rgb: a scriptable genome browser for R. Bioinform. 30(15): 2204-2205 (2014) - [j35]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Algorithms for computing Abelian periods of words. Discret. Appl. Math. 163: 287-297 (2014) - [j34]Thierry Lecroq:
Preface. J. Discrete Algorithms 24: 1 (2014) - [j33]Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Linear computation of unbordered conjugate on unordered alphabet. Theor. Comput. Sci. 522: 77-84 (2014) - [c35]Nadia Ben Nsira, Thierry Lecroq, Mourad Elloumi:
A fast pattern matching algorithm for highly similar sequences. BIBM 2014: 32-38 - [c34]Bastien Cazaux, Thierry Lecroq, Eric Rivals:
From Indexing Data Structures to de Bruijn Graphs. CPM 2014: 89-99 - [c33]Nadia Ben Nsira, Thierry Lecroq, Mourad Elloumi:
On-line String Matching in Highly Similar DNA Sequences. ICABD 2014: 16-22 - [c32]Chloé Cabot, Julien Grosjean, Romain Lelong, Arnaud Lefebvre, Thierry Lecroq, Lina Fatima Soualmia, Stéfan Jacques Darmoni:
Omic Data Modelling for Information Retrieval. IWBBIO 2014: 415-424 - [p4]Maxime Crochemore, Thierry Lecroq:
Pattern Matching and Text Compression Algorithms. Computing Handbook, 3rd ed. (1) 2014: 15: 1-57 - 2013
- [j32]Simone Faro, Thierry Lecroq:
The exact online string matching problem: A review of the most recent results. ACM Comput. Surv. 45(2): 13:1-13:42 (2013) - [j31]Carl Barton, Mathieu Giraud, Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Solon P. Pissis:
Querying highly similar sequences. Int. J. Comput. Biol. Drug Des. 6(1/2): 119-130 (2013) - [c31]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Repetitions in Sturmian Words. Developments in Language Theory 2013: 227-238 - [c30]Joong Chae Na, Heejin Park, Sunho Lee, Minsung Hong, Thierry Lecroq, Laurent Mouchard, Kunsoo Park:
Suffix Array of Alignment: A Practical Index for Similar Data. SPIRE 2013: 243-254 - [e1]Thierry Lecroq, Laurent Mouchard:
Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8288, Springer 2013, ISBN 978-3-642-45277-2 [contents] - 2012
- [j30]Lina Fatima Soualmia, Élise Prieur-Gaston, Zied Moalla, Thierry Lecroq, Stéfan Jacques Darmoni:
Matching health information seekers' queries to medical terms. BMC Bioinform. 13(S-14): S11 (2012) - [j29]Sophie Coutant, Chloé Cabot, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston, Dominique Campion, Thierry Lecroq, Hélène Dauchel:
EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics. BMC Bioinform. 13(S-14): S9 (2012) - [j28]Thierry Lecroq, Alexandre Pauchet, Émilie Chanoni, Gerardo Ayala Solano:
Pattern discovery in annotated dialogues using dynamic programming. Int. J. Intell. Inf. Database Syst. 6(6): 603-618 (2012) - [c29]Simone Faro, Thierry Lecroq:
Fast searching in biological sequences using multiple hash functions. BIBE 2012: 175-180 - [c28]Heni Bouhamed, Afif Masmoudi, Thierry Lecroq, Ahmed Rebai:
A New Approach for Bayesian Classifier Learning Structure via K2 Algorithm. ICIC (3) 2012: 387-393 - [c27]Heni Bouhamed, Afif Masmoudi, Thierry Lecroq, Ahmed Rebai:
A New Learning Structure Heuristic of Bayesian Networks from Data. MLDM 2012: 183-197 - [c26]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
Quasi-linear Time Computation of the Abelian Periods of a Word. Stringology 2012: 103-110 - [c25]Simone Faro, Thierry Lecroq:
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. SEA 2012: 172-183 - [c24]Simone Faro, Thierry Lecroq:
A Fast Suffix Automata Based Algorithm for Exact Online String Matching. CIAA 2012: 149-158 - [i5]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Repetitions in Sturmian Words. CoRR abs/1209.6013 (2012) - [i4]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Algorithms for Computing Abelian Periods of Words. CoRR abs/1211.5389 (2012) - [i3]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
- [j27]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 Bioinform. 12: 242 (2011) - [c23]Heni Bouhamed, Thierry Lecroq, Ahmed Rebai, Maher Jaoua:
Improving Algorithms for Knowledge Discovery in Genetics Databases. DEXA Workshops 2011: 407-410 - [c22]Tarek El Falah, Thierry Lecroq, Mourad Elloumi:
An Efficient Motif Search Algorithm Based on a Minimal Forbidden Patterns Approach. PACBB 2011: 175-182 - [c21]Simone Faro, Thierry Lecroq:
2001-2010: Ten Years of Exact String Matching Algorithms. Stringology 2011: 1-2 - [c20]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Computing Abelian Periods in Words. Stringology 2011: 184-196 - 2010
- [j26]Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard:
Dynamic extended suffix arrays. J. Discrete Algorithms 8(2): 241-257 (2010) - [c19]Tarek El Falah, Thierry Lecroq, Mourad Elloumi:
SMS-Forbid: An Efficient Agorithm for Simple Motif Problem. BICoB 2010: 121-126 - [c18]Tayeb Merabti, Philippe Massari, Michel Joubert, Eric Sadou, Thierry Lecroq, Hocine Abdoune, Jean Marie Rodrigues, Stéfan Jacques Darmoni:
An Automated Approach to map a French terminology to UMLS. MedInfo 2010: 1040-1044 - [i2]Simone Faro, Thierry Lecroq:
The Exact String Matching Problem: a Comprehensive Experimental Evaluation. CoRR abs/1012.2547 (2010)
2000 – 2009
- 2009
- [j25]Simone Faro, Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm. Int. J. Found. Comput. Sci. 20(6): 967-984 (2009) - [j24]Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Efficient validation and construction of border arrays and validation of string matching automata. RAIRO Theor. Informatics Appl. 43(2): 281-297 (2009) - [j23]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é. Rev. d'Intelligence Artif. 23(1): 113-132 (2009) - [j22]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) - [c17]Elena Yavorska Harris, Thierry Lecroq, Gregory Kucherov, Stefano Lonardi:
CPM's 20th Anniversary: A Statistical Retrospective. CPM 2009: 1-11 - [c16]Simone Faro, Thierry Lecroq:
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. CPM 2009: 106-115 - [c15]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 - [r5]Maxime Crochemore, Thierry Lecroq:
Suffix Tree. Encyclopedia of Database Systems 2009: 2876-2880 - [r4]Maxime Crochemore, Thierry Lecroq:
Trie. Encyclopedia of Database Systems 2009: 3179-3182 - 2008
- [j21]Élise Prieur, Thierry Lecroq:
On-line construction of compact suffix vectors and maximal repeats. Theor. Comput. Sci. 407(1-3): 290-301 (2008) - [c14]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 - [c13]Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard:
Dynamic Burrows-Wheeler Transform. Stringology 2008: 13-25 - [c12]Simone Faro, Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm. Stringology 2008: 146-160 - [p3]Maxime Crochemore, Thierry Lecroq:
Alignments and Approximate String Matching. New Developments in Formal Languages and Applications 2008: 59-93 - [r3]Maxime Crochemore, Thierry Lecroq:
Sequential Exact String Matching. Encyclopedia of Algorithms 2008 - [r2]Maxime Crochemore, Thierry Lecroq:
Sequential Multiple String Matching. Encyclopedia of Algorithms 2008 - [i1]Simone Faro, Thierry Lecroq:
Efficient Pattern Matching on Binary Strings. CoRR abs/0810.2390 (2008) - 2007
- [b3]Maxime Crochemore, Christophe Hancart, Thierry Lecroq:
Algorithms on strings. Cambridge University Press 2007, ISBN 978-0-521-84899-2, pp. I-VIII, 1-383 - [j20]Thierry Lecroq:
Fast exact string matching algorithms. Inf. Process. Lett. 102(6): 229-235 (2007) - 2006
- [j19]Élise Prieur, Thierry Lecroq:
From Suffix Trees to Suffix Vectors. Int. J. Found. Comput. Sci. 17(6): 1385-1402 (2006) - [p2]Maxime Crochemore, Thierry Lecroq:
Text Searching and Indexing. Recent Advances in Formal Languages and Applications 2006: 43-80 - 2005
- [j18]Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Border Array on Bounded Alphabet. J. Autom. Lang. Comb. 10(1): 51-60 (2005) - [c11]Élise Prieur, Thierry Lecroq:
From suffix trees to suffix vectors. Stringology 2005: 37-53 - 2004
- [b2]Costas S. Iliopoulos, Thierry Lecroq:
String Algorithmics. College Publications 2004, ISBN 978-1-904987-02-4 - [b1]Christian Charras, Thierry Lecroq:
Handbook of Exact String Matching Algorithms. College Publications 2004, ISBN 978-0-9543006-4-7 - [j17]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
- [j16]Arnaud Lefebvre, Thierry Lecroq, Hélène Dauchel, Joël Alexandre:
FORRepeats: detects repeats on entire chromosomes and between genomes. Bioinform. 19(3): 319-326 (2003) - [j15]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq:
Occurrence and Substring Heuristics for i-Matching. Fundam. Informaticae 56(1-2): 1-21 (2003) - [j14]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) - [j13]Arnaud Lefebvre, Thierry Lecroq, Joël Alexandre:
An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle. J. Autom. Lang. Comb. 8(4): 647-657 (2003) - [j12]Maxime Crochemore, Christophe Hancart, Thierry Lecroq:
A unifying look at the Apostolico-Giancarlo string-matching algorithm. J. Discrete Algorithms 1(1): 37-52 (2003) - [c10]Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre:
Linear-Time Computation of Local Periods. MFCS 2003: 388-397 - 2002
- [j11]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) - [j10]Arnaud Lefebvre, Thierry Lecroq:
Compror: On-line lossless data compression with a factor oracle. Inf. Process. Lett. 83(1): 1-6 (2002) - [c9]Thierry Lecroq, Jean Frédéric Myoupo, David Semé:
Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. CATA 2002: 18-21 - [c8]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter:
Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189 - [c7]Jean-Pierre Duval, Thierry Lecroq, Arnaud Lefebvre:
Border Array on Bounded Alphabet. Stringology 2002: 28-35 - 2001
- [c6]Arnaud Lefebvre, Thierry Lecroq:
Compror: Compression with a Factor Oracle. Data Compression Conference 2001: 502 - [c5]Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Yoan J. Pinzón:
Approximate String Matching in Musical Sequences. Stringology 2001: 26-36 - 2000
- [c4]Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Yoan J. Pinzón:
Computing Approximate Repetitions in Musical Sequences. Stringology 2000: 49-59
1990 – 1999
- 1999
- [j9]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) - [p1]Maxime Crochemore, Thierry Lecroq:
Text Data Compression Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j8]Thierry Lecroq, Jean Frédéric Myoupo, David Semé:
A One-Phase Parallel Algorithm for the Sequence Alignment Problem. Parallel Process. Lett. 8(4): 515-526 (1998) - [j7]Thierry Lecroq:
Experiments on String Matching in Memory Structures. Softw. Pract. Exp. 28(5): 561-568 (1998) - [c3]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 - [c2]Christian Charras, Thierry Lecroq:
Exact String Matching Animation in Java. Stringology 1998: 36-43 - 1997
- [j6]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) - [j5]Maxime Crochemore, Thierry Lecroq:
Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. Inf. Process. Lett. 63(4): 195-203 (1997) - [r1]Maxime Crochemore, Thierry Lecroq:
Pattern Matching and Text Compression Algorithms. The Computer Science and Engineering Handbook 1997: 161-202 - 1996
- [j4]Maxime Crochemore, Thierry Lecroq:
Pattern-Matching and Text-Compression Algorithms. ACM Comput. Surv. 28(1): 39-41 (1996) - 1995
- [j3]Thierry Lecroq:
Experimental Results on String Matching Algorithms. Softw. Pract. Exp. 25(7): 727-765 (1995) - 1994
- [j2]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
- [j1]Thierry Lecroq:
A Variation on the Boyer-Moore Algorithm. Theor. Comput. Sci. 92(1): 119-144 (1992) - [c1]Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter:
Speeding Up Two String-Matching Algorithms. STACS 1992: 589-600
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
