Skip to Main content
Number of documents

9

CV


Arnaud Lefebvre    Thierry Lecroq   

Journal articles3 documents

  • 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⟩
  • 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⟩

Conference papers2 documents

  • 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. London Stringology Days/London Algorithmic Workshop 2011, 2011, Londres, United Kingdom. ⟨hal-00569139⟩

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, 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, 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. Online Computation of Abelian Runs. 2015. ⟨hal-01956121⟩