Arnaud Lefebvre

Bioinform., 2018

Three Strategies for the Dead-Zone String Matching Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2018, 2018

2016

Abelian powers and repetitions in Sturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Fast computation of abelian runs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Binary block order Rouen Transform.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

A note on easy and efficient computation of full abelian periods of a word.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Abelian Powers and Repetitions in Sturmian Words.

[BibT_eX]

[DOI]

CoRR, 2015

Efficient Algorithms for Longest Closed Factor Array.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Online Computation of Abelian Runs.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

2014

Linear computation of unbordered conjugate on unordered alphabet.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Algorithms for computing Abelian periods of words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Omic Data Modelling for Information Retrieval.

[BibT_eX]

[DOI]

Stéfan Jacques Darmoni

Proceedings of the International Work-Conference on Bioinformatics and Biomedical Engineering, 2014

2013

Abelian Repetitions in Sturmian Words.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

BMC Bioinform., 2012

Quasi-linear Time Computation of the Abelian Periods of a Word.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2012, 2012

2011

A methodology of alarm filtering using dynamic fault tree.

[BibT_eX]

[DOI]

Zineb Simeu-Abazi

Jean-Pierre Derain

Reliab. Eng. Syst. Saf., 2011

Computing Abelian Periods in Words.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2011, 2011

2009

Efficient validation and construction of border arrays and validation of string matching automata.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

2008

Business processes integration and performance indicators in a PLM

[BibT_eX]

[DOI]

CoRR, 2008

Evaluation and exploitation of knowledge robustness in knowledge-based systems

[BibT_eX]

[DOI]

CoRR, 2008

2006

Maps of Dispersions for Machining Processes.

[BibT_eX]

[DOI]

Valéry Wolff

Jean Renaud

Concurr. Eng. Res. Appl., 2006

2004

Improvement of the Design Process through Knowledge Capitalization: an Approach by Know-how Mapping.

[BibT_eX]

[DOI]

Jean Renaud

Christian Fonteix

Concurr. Eng. Res. Appl., 2004

2003

An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle.

[BibT_eX]

[DOI]

Joël Alexandre

J. Autom. Lang. Comb., 2003

FORRepeats: detects repeats on entire chromosomes and between genomes.

[BibT_eX]

[DOI]

Bioinform., 2003

Linear-Time Computation of Local Periods.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002

Words over an ordered alphabet and suffix permutations.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2002

Compror: On-line lossless data compression with a factor oracle.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

A Heuristic for Computing Repeats with a Factor Oracle: Application to Biological Sequences.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2002

Border Array on Bounded Alphabet.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2002, Prague, Czech Republic, 2002

2001

Compror: Compression with a Factor Oracle.

[BibT_eX]

[DOI]