| Counting distinct palindromes in a word in linear time R Groult, É Prieur, G Richomme Information Processing Letters 110 (20), 908-912, 2010 | 50 | 2010 |
| Combining MEDLINE and publisher data to create parallel corpora for the automatic translation of biomedical text A Jimeno Yepes, E Prieur-Gaston, A Névéol BMC bioinformatics 14, 1-10, 2013 | 31 | 2013 |
| UMI-VarCal: a new UMI-based variant caller that efficiently improves low-frequency variant detection in paired-end sequencing NGS libraries V Sater, PJ Viailly, T Lecroq, É Prieur-Gaston, É Bohers, M Viennot, ... Bioinformatics 36 (9), 2718-2724, 2020 | 25 | 2020 |
| EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics S Coutant, C Cabot, A Lefebvre, M Léonard, E Prieur-Gaston, D Campion, ... BMC bioinformatics 13, 1-12, 2012 | 24 | 2012 |
| Computing Abelian Periods in Words. G Fici, T Lecroq, A Lefebvre, É Prieur-Gaston Stringology, 184-196, 2011 | 22 | 2011 |
| Multiple terminologies in a health portal: automatic indexing and information retrieval SJ Darmoni, S Pereira, S Sakji, T Merabti, É Prieur, M Joubert, B Thirion Artificial Intelligence in Medicine: 12th Conference on Artificial …, 2009 | 22 | 2009 |
| Abelian powers and repetitions in Sturmian words G Fici, A Langiu, T Lecroq, A Lefebvre, F Mignosi, J Peltomäki, ... Theoretical Computer Science 635, 16-34, 2016 | 20 | 2016 |
| Algorithms for computing Abelian periods of words G Fici, T Lecroq, A Lefebvre, É Prieur-Gaston Discrete Applied Mathematics 163, 287-297, 2014 | 15 | 2014 |
| Quasi-linear Time Computation of the Abelian Periods of a Word. G Fici, T Lecroq, A Lefebvre, É Prieur-Gaston, WF Smyth Stringology, 103-110, 2012 | 14 | 2012 |
| Matching health information seekers' queries to medical terms LF Soualmia, E Prieur-Gaston, Z Moalla, T Lecroq, SJ Darmoni BMC bioinformatics 13, 1-15, 2012 | 13 | 2012 |
| Efficient pattern matching in degenerate strings with the Burrows–Wheeler transform JW Daykin, R Groult, Y Guesnet, T Lecroq, A Lefebvre, M Léonard, ... Information Processing Letters 147, 82-87, 2019 | 12 | 2019 |
| Abelian repetitions in Sturmian words G Fici, A Langiu, T Lecroq, A Lefebvre, F Mignosi, É Prieur-Gaston International Conference on Developments in Language Theory, 227-238, 2013 | 12 | 2013 |
| UMI-Gen: A UMI-based read simulator for variant calling evaluation in paired-end sequencing NGS libraries V Sater, PJ Viailly, T Lecroq, P Ruminy, C Bérard, É Prieur-Gaston, ... Computational and structural biotechnology journal 18, 2270-2280, 2020 | 10 | 2020 |
| A survey of string orderings and their application to the Burrows–Wheeler transform JW Daykin, R Groult, Y Guesnet, T Lecroq, A Lefebvre, M Léonard, ... Theoretical Computer Science 710, 52-65, 2018 | 9 | 2018 |
| A note on easy and efficient computation of full abelian periods of a word G Fici, T Lecroq, A Lefebvre, É Prieur-Gaston, WF Smyth Discrete Applied Mathematics 212, 88-95, 2016 | 7 | 2016 |
| Recherche d’information multiterminologique en contexte: étude préliminaire AD Dirieh Dibad, S Sakji, E Prieur, S Pereira, M Joubert, SJ Darmoni Informatique et Santé 17, 101-12, 2009 | 6 | 2009 |
| On-line construction of compact suffix vectors and maximal repeats É Prieur, T Lecroq Theoretical computer science 407 (1-3), 290-301, 2008 | 6 | 2008 |
| From suffix trees to suffix vectors E Prieur, T Lecroq International Journal of Foundations of Computer Science 17 (06), 1385-1402, 2006 | 6 | 2006 |
| Binary block order Rouen transform JW Daykin, R Groult, Y Guesnet, T Lecroq, A Lefebvre, M Léonard, ... Theoretical Computer Science 656, 118-134, 2016 | 4 | 2016 |
| Spell-checking queries by combining Levenshtein and Stoilos distances Z Moalla, LF Soualmia, E Prieur-Gaston, T Lecroq, SJ Darmoni Proceedings of Network Tools and Applications in Biology, 2011 | 3 | 2011 |
Thierry LecroqLITIS UR 4108, University of Rouen Normandy, FranceVerified email at univ-rouen.fr