Thierry Lecroq

According to our database1, Thierry Lecroq authored at least 111 papers between 1992 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Fast Multiple Pattern Cartesian Tree Matching.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

2019
Linking indexing data structures to de Bruijn graphs: Construction and update.
J. Comput. Syst. Sci., 2019

Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform.
Inf. Process. Lett., 2019

Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences.
IJDMB, 2019

Fast Cartesian Tree Matching.
Proceedings of the String Processing and Information Retrieval, 2019

2018
Trie.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Suffix Tree.
Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

FM-index of alignment with gaps.
Theor. Comput. Sci., 2018

A survey of string orderings and their application to the Burrows-Wheeler transform.
Theor. Comput. Sci., 2018

Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph.
Bioinformatics, 2018

Three Strategies for the Dead-Zone String Matching Algorithm.
Proceedings of the Prague Stringology Conference 2018, 2018

Practical fast on-line exact pattern matching algorithms for highly similar sequences.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2017
On-line String Matching in Highly Similar DNA Sequences.
Mathematics in Computer Science, 2017

Algorithms for Indexing Highly Similar DNA Sequences.
Proceedings of the Algorithms for Next-Generation Sequencing Data, Techniques, 2017

2016
String Matching.
Encyclopedia of Algorithms, 2016

Multiple String Matching.
Encyclopedia of Algorithms, 2016

FM-index of alignment: A compressed index for similar strings.
Theor. Comput. Sci., 2016

Abelian powers and repetitions in Sturmian words.
Theor. Comput. Sci., 2016

Fast computation of abelian runs.
Theor. Comput. Sci., 2016

Binary block order Rouen Transform.
Theor. Comput. Sci., 2016

Combining supervised term-weighting metrics for SVM text classification with extended term representation.
Knowl. Inf. Syst., 2016

A note on easy and efficient computation of full abelian periods of a word.
Discrete Applied Mathematics, 2016

The String Matching Algorithms Research Tool.
Proceedings of the Prague Stringology Conference 2016, 2016

2015
Reducing the Structure Space of Bayesian Classifiers Using Some General Algorithms.
J. Math. Model. Algorithms in OR, 2015

Editorial.
J. Discrete Algorithms, 2015

Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks.
J. Computational Applied Mathematics, 2015

A fast Boyer-Moore type pattern matching algorithm for highly similar sequences.
IJDMB, 2015

Abelian Powers and Repetitions in Sturmian Words.
CoRR, 2015

Online Computation of Abelian Runs.
Proceedings of the Language and Automata Theory and Applications, 2015

Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree.
Proceedings of the Language and Automata Theory and Applications, 2015

Accurate Keyphrase Extraction from Scientific Papers by Mining Linguistic Information.
Proceedings of the First Workshop on Mining Scientific Papers: Computational Linguistics and Bibliometrics co-located with 15th International Society of Scientometrics and Informetrics Conference (ISSI 2015), 2015

Supervised Term Weights for Biomedical Text Classification: Improvements in Nearest Centroid Computation.
Proceedings of the Computational Intelligence Methods for Bioinformatics and Biostatistics, 2015

2014
Linear computation of unbordered conjugate on unordered alphabet.
Theor. Comput. Sci., 2014

Preface.
J. Discrete Algorithms, 2014

Algorithms for computing Abelian periods of words.
Discrete Applied Mathematics, 2014

Rgb: a scriptable genome browser for R.
Bioinformatics, 2014

Omic Data Modelling for Information Retrieval.
Proceedings of the International Work-Conference on Bioinformatics and Biomedical Engineering, 2014

From Indexing Data Structures to de Bruijn Graphs.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

A fast pattern matching algorithm for highly similar sequences.
Proceedings of the 2014 IEEE International Conference on Bioinformatics and Biomedicine, 2014

Pattern Matching and Text Compression Algorithms.
Proceedings of the Computing Handbook, 2014

2013
Querying highly similar sequences.
I. J. Computational Biology and Drug Design, 2013

The exact online string matching problem: A review of the most recent results.
ACM Comput. Surv., 2013

Suffix Array of Alignment: A Practical Index for Similar Data.
Proceedings of the String Processing and Information Retrieval, 2013

Abelian Repetitions in Sturmian Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Pattern discovery in annotated dialogues using dynamic programming.
IJIIDS, 2012

A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections.
ERCIM News, 2012

Matching health information seekers' queries to medical terms.
BMC Bioinformatics, 2012

EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics.
BMC Bioinformatics, 2012

A Fast Suffix Automata Based Algorithm for Exact Online String Matching.
Proceedings of the Implementation and Application of Automata, 2012

A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Quasi-linear Time Computation of the Abelian Periods of a Word.
Proceedings of the Prague Stringology Conference 2012, 2012

A New Learning Structure Heuristic of Bayesian Networks from Data.
Proceedings of the Machine Learning and Data Mining in Pattern Recognition, 2012

A New Approach for Bayesian Classifier Learning Structure via K2 Algorithm.
Proceedings of the Emerging Intelligent Computing Technology and Applications, 2012

Fast searching in biological sequences using multiple hash functions.
Proceedings of the 12th IEEE International Conference on Bioinformatics & Bioengineering, 2012

2011
Querying large read collections in main memory: a versatile data structure.
BMC Bioinformatics, 2011

Computing Abelian Periods in Words.
Proceedings of the Prague Stringology Conference 2011, 2011

2001-2010: Ten Years of Exact String Matching Algorithms.
Proceedings of the Prague Stringology Conference 2011, 2011

An Efficient Motif Search Algorithm Based on a Minimal Forbidden Patterns Approach.
Proceedings of the 5th International Conference on Practical Applications of Computational Biology & Bioinformatics, 2011

Improving Algorithms for Knowledge Discovery in Genetics Databases.
Proceedings of the 2011 Database and Expert Systems Applications, 2011

2010
Dynamic extended suffix arrays.
J. Discrete Algorithms, 2010

The Exact String Matching Problem: a Comprehensive Experimental Evaluation
CoRR, 2010

An Automated Approach to map a French terminology to UMLS.
Proceedings of the MEDINFO 2010, 2010

SMS-Forbid: An Efficient Agorithm for Simple Motif Problem.
Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, 2010

2009
Trie.
Proceedings of the Encyclopedia of Database Systems, 2009

Suffix Tree.
Proceedings of the Encyclopedia of Database Systems, 2009

A four-stage algorithm for updating a Burrows-Wheeler transform.
Theor. Comput. Sci., 2009

Identification de répétitions dans les navigations au sein d'un catalogue de santé.
Revue d'Intelligence Artificielle, 2009

Efficient validation and construction of border arrays and validation of string matching automata.
ITA, 2009

Efficient Variants of the Backward-Oracle-Matching Algorithm.
Int. J. Found. Comput. Sci., 2009

Projection and Inheritance of SNOMED CT Relations between MeSH Terms.
Proceedings of the Medical Informatics in a United and Healthy Europe - Proceedings of MIE 2009, The XXIInd International Congress of the European Federation for Medical Informatics, Sarajevo, Bosnia and Herzegovina, August 30, 2009

CPM's 20th Anniversary: A Statistical Retrospective.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Alignments and Approximate String Matching.
Proceedings of the New Developments in Formal Languages and Applications, 2008

Sequential Multiple String Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Sequential Exact String Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

On-line construction of compact suffix vectors and maximal repeats.
Theor. Comput. Sci., 2008

Efficient Pattern Matching on Binary Strings
CoRR, 2008

Dynamic Burrows-Wheeler Transform.
Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Searching Related Resources in a Quality Controlled Health Gateway: a Feasibility Study.
Proceedings of the eHealth Beyond the Horizon, 2008

2007
Fast exact string matching algorithms.
Inf. Process. Lett., 2007

Algorithms on strings.
Cambridge University Press, ISBN: 978-0-521-84899-2, 2007

2006
Text Searching and Indexing.
Proceedings of the Recent Advances in Formal Languages and Applications, 2006

From Suffix Trees to Suffix Vectors.
Int. J. Found. Comput. Sci., 2006

2005
Border Array on Bounded Alphabet.
Journal of Automata, Languages and Combinatorics, 2005

2004
Linear-time computation of local periods.
Theor. Comput. Sci., 2004

Handbook of Exact String Matching Algorithms.
College Publications, ISBN: 978-0-9543006-4-7, 2004

String Algorithmics.
College Publications, ISBN: 978-1-904987-02-4, 2004

2003
A unifying look at the Apostolico-Giancarlo string-matching algorithm.
J. Discrete Algorithms, 2003

An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle.
Journal of Automata, Languages and Combinatorics, 2003

On special families of morphisms related to [delta]-matching and don't care symbols.
Inf. Process. Lett., 2003

Occurrence and Substring Heuristics for i-Matching.
Fundam. Inform., 2003

FORRepeats: detects repeats on entire chromosomes and between genomes.
Bioinformatics, 2003

2002
Compror: On-line lossless data compression with a factor oracle.
Inf. Process. Lett., 2002

A Heuristic for Computing Repeats with a Factor Oracle: Application to Biological Sequences.
Int. J. Comput. Math., 2002

Three Heuristics for delta-Matching: delta-BM Algorithms.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word.
Proceedings of the ISCA 17th International Conference Computers and Their Applications, 2002

2001
Approximate String Matching in Musical Sequences.
Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

Compror: Compression with a Factor Oracle.
Proceedings of the Data Compression Conference, 2001

2000
Computing Approximate Repetitions in Musical Sequences.
Proceedings of the Prague Stringology Club Workshop 2000, Prague, Czech Republic, 2000

1999
Fast Practical Multi-Pattern Matching.
Inf. Process. Lett., 1999

1998
Experiments on String Matching in Memory Structures.
Softw., Pract. Exper., 1998

A One-Phase Parallel Algorithm for the Sequence Alignment Problem.
Parallel Processing Letters, 1998

Exact String Matching Animation in Java.
Proceedings of the Prague Stringology Club Workshop 1998, Prague, Czech Republic, 1998

A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998

1997
A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence.
Inf. Process. Lett., 1997

Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm.
Inf. Process. Lett., 1997

Pattern Matching and Text Compression Algorithms.
Proceedings of the Computer Science and Engineering Handbook, 1997

1996
Pattern-Matching and Text-Compression Algorithms.
ACM Comput. Surv., 1996

1995
Experimental Results on String Matching Algorithms.
Softw., Pract. Exper., 1995

1994
Speeding Up Two String-Matching Algorithms.
Algorithmica, 1994

1992
A Variation on the Boyer-Moore Algorithm.
Theor. Comput. Sci., 1992


  Loading...