Arnaud Lefebvre

Orcid: 0000-0001-9631-2292

According to our database1, Arnaud Lefebvre authored at least 32 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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.
Bioinform., 2018

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

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

A note on easy and efficient computation of full abelian periods of a word.
Discret. Appl. Math., 2016

2015
Abelian Powers and Repetitions in Sturmian Words.
CoRR, 2015

Efficient Algorithms for Longest Closed Factor Array.
Proceedings of the String Processing and Information Retrieval, 2015

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

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

Algorithms for computing Abelian periods of words.
Discret. Appl. Math., 2014

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

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

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

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

2011
A methodology of alarm filtering using dynamic fault tree.
Reliab. Eng. Syst. Saf., 2011

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

2009
Efficient validation and construction of border arrays and validation of string matching automata.
RAIRO Theor. Informatics Appl., 2009

2008
Business processes integration and performance indicators in a PLM
CoRR, 2008

Evaluation and exploitation of knowledge robustness in knowledge-based systems
CoRR, 2008

2006
Maps of Dispersions for Machining Processes.
Concurr. Eng. Res. Appl., 2006

2005
Border Array on Bounded Alphabet.
J. Autom. Lang. Comb., 2005

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

Improvement of the Design Process through Knowledge Capitalization: an Approach by Know-how Mapping.
Concurr. Eng. Res. Appl., 2004

2003
An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle.
J. Autom. Lang. Comb., 2003

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

2002
Words over an ordered alphabet and suffix permutations.
RAIRO Theor. Informatics Appl., 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

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


  Loading...