Skip to Main content
New interface
Number of documents

23

CV


Thierry Lecroq   

Journal articles12 documents

  • Vincent Sater, Pierre-Julien Viailly, Thierry Lecroq, Élise Prieur-Gaston, Elodie Bohers, et al.. UMI-VarCal: a new UMI-based variant caller that efficiently improves low-frequency variant detection in paired-end sequencing NGS libraries. Bioinformatics, Oxford University Press (OUP), 2020, ⟨10.1093/bioinformatics/btaa053⟩. ⟨hal-02468271⟩
  • Nadia Ben Nsira, Thierry Lecroq, Élise Prieur Gaston. Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences. International Journal of Data Mining and Bioinformatics, Inderscience, 2019, 22 (1), pp.1. ⟨10.1504/IJDMB.2019.099285⟩. ⟨hal-02113316⟩
  • Jacqueline Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, et al.. A survey of string orderings and their application to the Burrows–Wheeler transform. Theoretical Computer Science, Elsevier, 2018, 710, pp.52 - 65. ⟨10.1016/j.tcs.2017.02.021⟩. ⟨hal-01894859⟩
  • Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston, William F. Smyth. A note on easy and efficient computation of full abelian periods of a word. Discrete Applied Mathematics, Elsevier, 2016, 212, pp.88 - 95. ⟨10.1016/j.dam.2015.09.024⟩. ⟨hal-01894875⟩
  • J. W. Daykin, Richard Groult, Guesnet Yannick, Thierry Lecroq, Arnaud Lefebvre, et al.. Binary block order Rouen transform. Theoretical Computer Science, Elsevier, 2016, ⟨10.1016/j.tcs.2016.05.028⟩. ⟨hal-01323759⟩
  • Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston. Fast computation of abelian runs. Theoretical Computer Science, Elsevier, 2016, 656, pp.256-264. ⟨10.1016/j.tcs.2015.12.010⟩. ⟨hal-01956124⟩
  • Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, et al.. Abelian powers and repetitions in Sturmian words. Theoretical Computer Science, Elsevier, 2016, 635, pp.16 - 34. ⟨10.1016/j.tcs.2016.04.039⟩. ⟨hal-01894873⟩
  • Sophie Coutant, Chloé Cabot, Arnaud Lefebvre, Martine Léonard, Elise Prieur-Gaston, et al.. EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics. BMC Bioinformatics, BioMed Central, 2012, 13 (Suppl 14), pp.S9. ⟨inserm-00730215⟩
  • Lina F Soualmia, Elise Prieur-Gaston, Zied Moalla, Thierry Lecroq, Stéfan J Darmoni. Matching health information seekers' queries to medical terms. BMC Bioinformatics, BioMed Central, 2012, 13 Suppl 14, pp.S11. ⟨10.1186/1471-2105-13-S14-S11⟩. ⟨hal-00845358⟩
  • Alexandre Pauchet, Mohamad El-Abed, Tayeb Merabti, Élise Prieur, Thierry Lecroq, et al.. Identification de répétitions dans les navigations au sein d'un catalogue de santé. Revue des Sciences et Technologies de l'Information - Série RIA : Revue d'Intelligence Artificielle, Lavoisier, 2009, 23 (1), pp.113-132. ⟨hal-00450114⟩
  • Elise Prieur, Thierry Lecroq. On-line construction of compact suffix vectors and maximal repeats. Theoretical Computer Science, Elsevier, 2008, 407 (1-3), pp.290-301. ⟨hal-00469299⟩
  • Elise Prieur, Thierry Lecroq. From Suffix Trees to Suffix Vectors. International Journal of Foundations of Computer Science, World Scientific Publishing, 2006, 17 (6), pp.1385-1402. ⟨hal-00469409⟩

Conference papers7 documents

  • Nadia Ben Nsira, Thierry Lecroq, Élise Prieur-Gaston. Practical fast on-line exact pattern matching algorithms for highly similar sequences. Proceedings of the IEEE BIBM 2018 Workshop on Data Mining from Genomic Variants and Its Application to Genome-wide Analysis, Dec 2018, Madrid, Spain. pp.1772--1777. ⟨hal-01956537⟩
  • Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, et al.. Three Strategies for the Dead-Zone String Matching Algorithm. Proceedings of the Prague Stringology Conference 2018, Aug 2017, Prague, Czech Republic. pp.117--128. ⟨hal-01956358⟩
  • Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston. Online Computation of Abelian Runs. LATA, Feb 2015, Nice, France. pp.391-401. ⟨hal-01955960⟩
  • Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston. Computing Abelian Periods in Words. SeqBi11 - Workshop Algorithmique, combinatoire du texte et applications en bio-informatique, 2011, Rennes, France. ⟨hal-00560414⟩
  • Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston. Computing Abelian Periods in Words. Prague Stringology Conference, 2011, Prague, Czech Republic. pp.184-196. ⟨hal-00627216⟩
  • Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston. Computing abelian periods in words. London Stringology Days/London Algorithmic Workshop 2011, 2011, Londres, United Kingdom. ⟨hal-00569139⟩
  • Elise Prieur, Thierry Lecroq. On-line construction of compact suffix vectors and maximal repeats. Journées montoises, 2006, Rennes, France. pp.311-322. ⟨hal-00469601⟩

Preprints, Working Papers, ...4 documents

  • Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, et al.. Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. 2018. ⟨hal-01956003⟩
  • Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, et al.. Abelian Powers and Repetitions in Sturmian Words. 2018. ⟨hal-01956122⟩
  • Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston, William F. Smyth. A Note on Easy and Efficient Computation of Full Abelian Periods of a Word. 2018. ⟨hal-01956126⟩
  • Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Elise Prieur-Gaston. Online Computation of Abelian Runs. 2015. ⟨hal-01956121⟩