Thierry Lecroq

From MaRDI portal
Person:287178

Available identifiers

zbMath Open lecroq.thierryWikidataQ58154022 ScholiaQ58154022MaRDI QIDQ287178

List of research outcomes

PublicationDate of PublicationType
Speeding up two string-matching algorithms2022-08-18Paper
125 Problems in Text Algorithms2021-04-06Paper
Fast algorithms for single and multiple pattern Cartesian tree matching2020-12-15Paper
Algorithms for Indexing Highly Similar DNA Sequences2020-08-07Paper
Fast multiple pattern Cartesian tree matching2020-07-22Paper
Fast string matching for DNA sequences2020-02-20Paper
Linking indexing data structures to de Bruijn graphs: construction and update2019-06-25Paper
A survey of string orderings and their application to the Burrows-Wheeler transform2018-02-16Paper
FM-index of alignment with gaps2018-02-16Paper
On-line string matching in highly similar DNA sequences2017-07-17Paper
Binary block order Rouen transform2017-02-06Paper
Fast computation of abelian runs2017-02-06Paper
A note on easy and efficient computation of full abelian periods of a word2016-09-12Paper
FM-index of alignment: a compressed index for similar strings2016-06-16Paper
A faster linear systolic algorithm for recovering a longest common subsequence2016-06-01Paper
Tight bounds on the complexity of the Apostolico-Giancarlo algorithm2016-05-26Paper
Abelian powers and repetitions in Sturmian words2016-05-26Paper
Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree2016-04-08Paper
Online Computation of Abelian Runs2016-04-08Paper
Reducing the structure space of Bayesian classifiers using some general algorithms2015-12-01Paper
Algorithms for computing abelian periods of words2015-09-22Paper
Structure space of Bayesian networks is dramatically reduced by subdividing it in sub-networks2015-06-02Paper
Algorithms on Strings2014-10-23Paper
The exact online string matching problem2014-08-13Paper
From Indexing Data Structures to de Bruijn Graphs2014-06-30Paper
Linear computation of unbordered conjugate on unordered alphabet2014-01-24Paper
Abelian Repetitions in Sturmian Words2013-06-28Paper
A Fast Suffix Automata Based Algorithm for Exact Online String Matching2012-09-20Paper
https://portal.mardi4nfdi.de/entity/Q35700402010-06-23Paper
Dynamic extended suffix arrays2010-05-25Paper
Fast exact string matching algorithms2010-01-29Paper
EFFICIENT VARIANTS OF THE BACKWARD-ORACLE-MATCHING ALGORITHM2010-01-08Paper
A four-stage algorithm for updating a Burrows-Wheeler transform2009-10-09Paper
Efficient validation and construction of border arrays and validation of string matching automata2009-05-06Paper
On special families of morphisms related to \(\delta \)-matching and don't care symbols2009-03-23Paper
On-line construction of compact suffix vectors and maximal repeats2008-11-18Paper
https://portal.mardi4nfdi.de/entity/Q35270152008-09-25Paper
https://portal.mardi4nfdi.de/entity/Q54584882008-04-15Paper
Algorithms on Strings2008-02-22Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
A unifying look at the Apostolico--Giancarlo string-matching algorithm2007-04-26Paper
From Suffix Trees to Suffix Vectors2007-02-08Paper
https://portal.mardi4nfdi.de/entity/Q33700082006-02-06Paper
Linear-time computation of local periods2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q48208732004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q47376992004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44329702003-12-15Paper
Compror: On-line lossless data compression with a factor oracle.2003-01-21Paper
Fast practical multi-pattern matching2002-07-25Paper
A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences2002-01-01Paper
Speeding up two string-matching algorithms1996-02-26Paper
A variation on the Boyer-Moore algorithm1992-09-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Thierry Lecroq