Arnaud Lefebvre

897 total citations
30 papers, 462 citations indexed

About

Arnaud Lefebvre is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Arnaud Lefebvre has authored 30 papers receiving a total of 462 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Artificial Intelligence, 14 papers in Molecular Biology and 14 papers in Computational Theory and Mathematics. Recurrent topics in Arnaud Lefebvre's work include Algorithms and Data Compression (19 papers), semigroups and automata theory (13 papers) and DNA and Biological Computing (6 papers). Arnaud Lefebvre is often cited by papers focused on Algorithms and Data Compression (19 papers), semigroups and automata theory (13 papers) and DNA and Biological Computing (6 papers). Arnaud Lefebvre collaborates with scholars based in France, United Kingdom and Italy. Arnaud Lefebvre's co-authors include Thierry Lecroq, Raymond Cespuglio, О. О. Солдаткін, А. П. Солдаткин, Hélène Dauchel, Zineb Simeu-Abazi, Camille Marchet, Antoine Limasset, Martine Léonard and Gabriele Fici and has published in prestigious journals such as Bioinformatics, Scientific Reports and Analytica Chimica Acta.

In The Last Decade

Arnaud Lefebvre

28 papers receiving 442 citations

Peers

Arnaud Lefebvre
Fei Xue China
Simon L. Harding United Kingdom
K. Kim United States
Arnaud Lefebvre
Citations per year, relative to Arnaud Lefebvre Arnaud Lefebvre (= 1×) peers Simone Spolaor

Countries citing papers authored by Arnaud Lefebvre

Since Specialization
Citations

This map shows the geographic impact of Arnaud Lefebvre's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Arnaud Lefebvre with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Arnaud Lefebvre more than expected).

Fields of papers citing papers by Arnaud Lefebvre

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Arnaud Lefebvre. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Arnaud Lefebvre. The network helps show where Arnaud Lefebvre may publish in the future.

Co-authorship network of co-authors of Arnaud Lefebvre

This figure shows the co-authorship network connecting the top 25 collaborators of Arnaud Lefebvre. A scholar is included among the top collaborators of Arnaud Lefebvre based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Arnaud Lefebvre. Arnaud Lefebvre is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Marchet, Camille, et al.. (2021). Scalable long read self-correction and assembly polishing with multiple sequence alignment. Scientific Reports. 11(1). 29 indexed citations
2.
Marchet, Camille, et al.. (2019). ELECTOR: evaluator for long reads correction methods. NAR Genomics and Bioinformatics. 2(1). 5 indexed citations
3.
Vaudry, Hubert, Philippe Chan, Thierry Lecroq, et al.. (2019). Strategies for the Identification of Bioactive Neuropeptides in Vertebrates. Frontiers in Neuroscience. 13. 948–948. 15 indexed citations
4.
Lecroq, Thierry, et al.. (2019). Efficient pattern matching in degenerate strings with the Burrows–Wheeler transform. Information Processing Letters. 147. 82–87. 3 indexed citations
5.
Lecroq, Thierry, et al.. (2018). Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph. Bioinformatics. 34(24). 4213–4222. 21 indexed citations
6.
Lecroq, Thierry, et al.. (2017). A survey of string orderings and their application to the Burrows–Wheeler transform. Theoretical Computer Science. 710. 52–65. 6 indexed citations
7.
Fici, Gabriele, et al.. (2016). Abelian powers and repetitions in Sturmian words. Theoretical Computer Science. 635. 16–34. 7 indexed citations
8.
Lecroq, Thierry, et al.. (2016). Binary block order Rouen Transform. Theoretical Computer Science. 656. 118–134. 2 indexed citations
9.
Fici, Gabriele, et al.. (2015). A note on easy and efficient computation of full abelian periods of a word. Discrete Applied Mathematics. 212. 88–95.
10.
Fici, Gabriele, et al.. (2015). Fast computation of abelian runs. Theoretical Computer Science. 656. 256–264.
11.
Cabot, C., Julien Grosjean, Arnaud Lefebvre, et al.. (2014). Omic Data Modelling for Information Retrieval. 415–424. 2 indexed citations
12.
Lecroq, Thierry, et al.. (2013). Linear computation of unbordered conjugate on unordered alphabet. Theoretical Computer Science. 522. 77–84. 1 indexed citations
13.
Fici, Gabriele, et al.. (2013). Algorithms for computing Abelian periods of words. Discrete Applied Mathematics. 163. 287–297. 6 indexed citations
14.
Fici, Gabriele, et al.. (2012). Quasi-linear Time Computation of the Abelian Periods of a Word. UWA Profiles and Research Repository (University of Western Australia). 103–110. 6 indexed citations
15.
Coutant, Sophie, C. Cabot, Arnaud Lefebvre, et al.. (2012). EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics. BMC Bioinformatics. 13(S14). S9–S9. 19 indexed citations
16.
Солдаткін, О. О., et al.. (2006). Highly selective microbiosensors for in vivo measurement of glucose, lactate and glutamate. Analytica Chimica Acta. 573-574. 110–116. 106 indexed citations
17.
Kolpakov, Roman, et al.. (2004). Linear-time computation of local periods. Theoretical Computer Science. 326(1-3). 229–240. 14 indexed citations
18.
Lefebvre, Arnaud, et al.. (2003). FORRepeats: detects repeats on entire chromosomes and between genomes. Bioinformatics. 19(3). 319–326. 52 indexed citations
19.
Lefebvre, Arnaud & Thierry Lecroq. (2002). A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences. International Journal of Computer Mathematics. 79(12). 1303–1315. 6 indexed citations
20.
Lefebvre, Arnaud & Thierry Lecroq. (2001). Compror: Compression with a Factor Oracle. 502. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026