Publications

Mes publications sur DBLP.
Mon CV sur : Hal .

Mon profil ResearchGate et mon profil Google Scholar.

Liste des publications (à mettre à jour)

2019

  • [DOI] J. W. Daykin, R. Groult, Y. Guesnet, T. Lecroq, A. Lefebvre, M. Léonard, L. Mouchard, É. Prieur-Gaston, and B. Watson, « Efficient pattern matching in degenerate strings with the burrows–wheeler transform, » Information processing letters, vol. 147, pp. 82-87, 2019.
    [Bibtex] 
    @article{DAYKIN201982,
title = "Efficient pattern matching in degenerate strings with the Burrows–Wheeler transform",
journal = "Information Processing Letters",
volume = "147",
pages = "82 - 87",
year = "2019",
issn = "0020-0190",
doi = "https://doi.org/10.1016/j.ipl.2019.03.003",
url = "http://www.sciencedirect.com/science/article/pii/S0020019019300535",
author = "J.W. Daykin and R. Groult and Y. Guesnet and T. Lecroq and A. Lefebvre and M. Léonard and L. Mouchard and É. Prieur-Gaston and B. Watson",
keywords = "Algorithms, Burrows–Wheeler transform, Degenerate, Pattern matching, String",
abstract = "A degenerate or indeterminate string on an alphabet Σ is a sequence of non-empty subsets of Σ. Given a degenerate string t of length n and its Burrows–Wheeler transform we present a new method for searching for a degenerate pattern of length m in t running in O(mn) time on a constant size alphabet Σ. Furthermore, it is a hybrid pattern matching technique that works on both regular and degenerate strings. A degenerate string is said to be conservative if its number of non-solid letters is upper-bounded by a fixed positive constant q; in this case we show that the search time complexity is O(qm2) for counting the number of occurrences and O(qm2+occ) for reporting the found occurrences where occ is the number of occurrences of the pattern in t. Experimental results show that our method performs well in practice."
}

2018

  • J. W. Daykin, R. Groult, Y. Guesnet, T. Lecroq, A. Lefebvre, M. Léonard, L. Mouchard, É. Prieur-Gaston, and B. Watson, « Three Strategies for the Dead-Zone String Matching Algorithm, » in Proceedings of the Prague Stringology Conference 2018, Prague, Czech Republic, 2018, p. 117–128.
    [Bibtex] 
    @inproceedings{daykin:hal-01956358,
TITLE = {{Three Strategies for the Dead-Zone String Matching Algorithm}},
AUTHOR = "Daykin, Jacqueline W. and Groult, Richard and Guesnet, Yannick and Lecroq, Thierry and Lefebvre, Arnaud and L{\'e}onard, Martine and Mouchard, Laurent and Prieur-Gaston, {\'E}lise and Watson, Bruce",
URL = {https://hal.archives-ouvertes.fr/hal-01956358},
BOOKTITLE = {{Proceedings of the Prague Stringology Conference 2018}},
ADDRESS = {Prague, Czech Republic},
EDITOR = {Jan Holub and Jan {\v Z}\vd{\'a}rek},
PAGES = {117--128},
YEAR = {2018},
MONTH = Aug,
HAL_ID = {hal-01956358},
HAL_VERSION = {v1},
}
  • [DOI] N. B. Nsira, T. Lecroq, and É. Prieur-Gaston, « Practical fast on-line exact pattern matching algorithms for highly similar sequences, » in IEEE international conference on bioinformatics and biomedicine, BIBM 2018, madrid, spain, december 3-6, 2018, 2018, p. 1772–1777.
    [Bibtex] 
    @inproceedings{DBLP:conf/bibm/NsiraLP18,
author = {Nadia Ben Nsira and
Thierry Lecroq and
Élise Prieur-Gaston},
title = {Practical fast on-line exact pattern matching algorithms for highly
similar sequences},
booktitle = {{IEEE} International Conference on Bioinformatics and Biomedicine,
{BIBM} 2018, Madrid, Spain, December 3-6, 2018},
pages = {1772--1777},
year = {2018},
crossref = {DBLP:conf/bibm/2018},
url = {http://doi.ieeecomputersociety.org/10.1109/BIBM.2018.8621319},
doi = {10.1109/BIBM.2018.8621319},
timestamp = {Tue, 05 Feb 2019 12:34:17 +0100},
biburl = {https://dblp.org/rec/bib/conf/bibm/NsiraLP18},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
  • [DOI] J. W. Daykin, R. Groult, Y. Guesnet, T. Lecroq, A. Lefebvre, M. Léonard, and É. Prieur-Gaston, « A survey of string orderings and their application to the burrows-wheeler transform, » Theor. comput. sci., vol. 710, p. 52–65, 2018.
    [Bibtex] 
    @article{DBLP:journals/tcs/DaykinGGLLLP18,
author = {Jacqueline W. Daykin and
Richard Groult and
Yannick Guesnet and
Thierry Lecroq and
Arnaud Lefebvre and
Martine L{\'{e}}onard and
Élise Prieur-Gaston},
title = {A survey of string orderings and their application to the Burrows-Wheeler
transform},
journal = {Theor. Comput. Sci.},
volume = {710},
pages = {52--65},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.02.021},
doi = {10.1016/j.tcs.2017.02.021},
timestamp = {Fri, 30 Nov 2018 13:25:22 +0100},
biburl = {https://dblp.org/rec/bib/journals/tcs/DaykinGGLLLP18},
bibsource = {dblp computer science bibliography, https://dblp.org}
}

2017

  • J. W. Daykin, R. Groult, Y. Guesnet, T. Lecroq, A. Lefebvre, M. Léonard, L. Mouchard, É. Prieur-Gaston, and B. Watson, « Efficient pattern matching in degenerate strings with the burrows-wheeler transform, » Corr, vol. abs/1708.01130, 2017.
    [Bibtex] 
    @article{DBLP:journals/corr/abs-1708-01130,
author = {Jacqueline W. Daykin and
Richard Groult and
Yannick Guesnet and
Thierry Lecroq and
Arnaud Lefebvre and
Martine L{\'{e}}onard and
Laurent Mouchard and
Élise Prieur-Gaston and
Bruce Watson},
title = {Efficient pattern matching in degenerate strings with the Burrows-Wheeler
transform},
journal = {CoRR},
volume = {abs/1708.01130},
year = {2017},
url = {http://arxiv.org/abs/1708.01130},
archivePrefix = {arXiv},
eprint = {1708.01130},
timestamp = {Tue, 05 Sep 2017 10:03:46 +0200},
biburl = {http://dblp.org/rec/bib/journals/corr/abs-1708-01130},
bibsource = {dblp computer science bibliography, http://dblp.org}
}

2016

  • [DOI] G. Fici, A. Langiu, T. Lecroq, A. Lefebvre, F. Mignosi, J. Peltomäki, and É. Prieur-Gaston, « Abelian powers and repetitions in sturmian words, » Theoretical computer science, vol. 635, pp. 16-34, 2016.
    [Bibtex] 
    @article{Fici201616,
title = "Abelian powers and repetitions in Sturmian words ",
journal = "Theoretical Computer Science ",
volume = "635",
number = "",
pages = "16 - 34",
year = "2016",
note = "",
issn = "0304-3975",
doi = "10.1016/j.tcs.2016.04.039",
url = "http://www.sciencedirect.com/science/article/pii/S0304397516301128",
author = "Gabriele Fici and Alessio Langiu and Thierry Lecroq and Arnaud Lefebvre and Filippo Mignosi and Jarkko Peltomäki and Élise Prieur-Gaston",
keywords = "Sturmian word",
keywords = "Abelian power",
keywords = "Abelian period",
keywords = "Lagrange constant",
keywords = "Critical exponent ",
abstract = "Abstract Richomme, Saari and Zamboni (2011) [39] proved that at every position of a Sturmian word starts an abelian power of exponent k for every k > 0 . We improve on this result by studying the maximum exponents of abelian powers and abelian repetitions (an abelian repetition is an analogue of a fractional power) in Sturmian words. We give a formula for computing the maximum exponent of an abelian power of abelian period m starting at a given position in any Sturmian word of rotation angle α. By considering all possible abelian periods m, we recover the result of Richomme, Saari and Zamboni. As an analogue of the critical exponent, we introduce the abelian critical exponent A ( s α ) of a Sturmian word s α of angle α as the quantity A ( s α ) = lim sup k m / m = lim sup k m ′ / m , where k m (resp. k m ′ ) denotes the maximum exponent of an abelian power (resp. of an abelian repetition) of abelian period m (the superior limits coincide for Sturmian words). We show that A ( s α ) equals the Lagrange constant of the number α. This yields a formula for computing A ( s α ) in terms of the partial quotients of the continued fraction expansion of α. Using this formula, we prove that A ( s α ) ≥ 5 and that the equality holds for the Fibonacci word. We further prove that A ( s α ) is finite if and only if α has bounded partial quotients, that is, if and only if s α is β-power-free for some real number β. Concerning the infinite Fibonacci word, we prove that: i) The longest prefix that is an abelian repetition of period F j , j > 1 , has length F j ( F j + 1 + F j − 1 + 1 ) − 2 if j is even or F j ( F j + 1 + F j − 1 ) − 2 if j is odd, where F j is the jth Fibonacci number; ii) The minimum abelian period of any factor is a Fibonacci number. Further, we derive a formula for the minimum abelian periods of the finite Fibonacci words: we prove that for j ≥ 3 the Fibonacci word f j , of length F j , has minimum abelian period equal to F ⌊ j / 2 ⌋ if j = 0 , 1 , 2 mod 4 or to F 1 + ⌊ j / 2 ⌋ if j = 3 mod 4 . "
}
  • [DOI] J. W. Daykin, R. Groult, Y. Guesnet, T. Lecroq, A. Lefebvre, M. Léonard, and É. Prieur-Gaston, « Binary block order rouen transform, » Theoretical computer science, vol. 656, Part B, pp. 118-134, 2016.
    [Bibtex] 
    @article{Daykin2016118,
title = "Binary block order Rouen Transform ",
journal = "Theoretical Computer Science ",
volume = "656, Part B",
number = "",
pages = "118 - 134",
year = "2016",
note = "Stringology: In Celebration of Bill Smyth’s 80th Birthday ",
issn = "0304-3975",
doi = "http://dx.doi.org/10.1016/j.tcs.2016.05.028",
url = "http://www.sciencedirect.com/science/article/pii/S0304397516301645",
author = "Jacqueline W. Daykin and Richard Groult and Yannick Guesnet and Thierry Lecroq and Arnaud Lefebvre and Martine Léonard and Élise Prieur-Gaston",
keywords = "Algorithm",
keywords = "Bijective",
keywords = "Binary alphabet",
keywords = "Block order",
keywords = "Burrows–Wheeler Transform",
keywords = "B-word",
keywords = "Data clustering",
keywords = "Inverse transform",
keywords = "Lexicographic order",
keywords = "Linear",
keywords = "Lyndon word",
keywords = "String",
keywords = "Suffix array",
keywords = "Suffix-sorting",
keywords = "Word "
}
  • [DOI] G. Fici, T. Kociumaka, T. Lecroq, A. Lefebvre, and É. Prieur-Gaston, « Fast computation of abelian runs, » Theoretical computer science, vol. 656, Part B, pp. 256-264, 2016.
    [Bibtex] 
    @article{Fici2016256,
title = "Fast computation of abelian runs ",
journal = "Theoretical Computer Science ",
volume = "656, Part B",
number = "",
pages = "256 - 264",
year = "2016",
note = "Stringology: In Celebration of Bill Smyth's 80th Birthday ",
issn = "0304-3975",
doi = "http://dx.doi.org/10.1016/j.tcs.2015.12.010",
url = "http://www.sciencedirect.com/science/article/pii/S0304397515011718",
author = "Gabriele Fici and Tomasz Kociumaka and Thierry Lecroq and Arnaud Lefebvre and {\'E}lise Prieur-Gaston",
keywords = "Combinatorics on words",
keywords = "Text algorithms",
keywords = "Abelian period",
keywords = "Abelian run "
}
  • [DOI] G. Fici, T. Lecroq, A. Lefebvre, É. Prieur-Gaston, and W. F. Smyth, « A note on easy and efficient computation of full abelian periods of a word, » Discrete applied mathematics, vol. 212, pp. 88-95, 2016.
    [Bibtex] 
    @article{Fici201688,
title = "A note on easy and efficient computation of full abelian periods of a word ",
journal = "Discrete Applied Mathematics ",
volume = "212",
number = "",
pages = "88 - 95",
year = "2016",
note = "Stringology Algorithms ",
issn = "0166-218X",
doi = "http://dx.doi.org/10.1016/j.dam.2015.09.024",
url = "http://www.sciencedirect.com/science/article/pii/S0166218X15004850",
author = "Gabriele Fici and Thierry Lecroq and Arnaud Lefebvre and Élise Prieur-Gaston and William F. Smyth",
keywords = "Abelian period",
keywords = "Abelian power",
keywords = "Weak repetition",
keywords = "Design of algorithms",
keywords = "Text algorithms",
keywords = "Combinatorics on words "
}

2015

  • [DOI] G. Fici, T. Lecroq, A. Lefebvre, and É. Prieur-Gaston, « Online computation of abelian runs, » in Language and automata theory and applications: 9th international conference, lata 2015, nice, france, march 2-6, 2015, proceedings, A. Dediu, E. Formenti, C. Martín-Vide, and B. Truthe, Eds., Cham: Springer International Publishing, 2015, p. 391–401.
    [Bibtex] 
    @Inbook{Fici2015,
author="Fici, Gabriele
and Lecroq, Thierry
and Lefebvre, Arnaud
and Prieur-Gaston, {\'E}lise",
editor="Dediu, Adrian-Horia
and Formenti, Enrico
and Mart{\'i}n-Vide, Carlos
and Truthe, Bianca",
title="Online Computation of Abelian Runs",
bookTitle="Language and Automata Theory and Applications: 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings",
year="2015",
publisher="Springer International Publishing",
address="Cham",
pages="391--401",
isbn="978-3-319-15579-1",
doi="10.1007/978-3-319-15579-1_30",
url="http://dx.doi.org/10.1007/978-3-319-15579-1_30"
}

2014

  • [DOI] G. Fici, T. Lecroq, A. Lefebvre, and É. Prieur-Gaston, « Algorithms for computing abelian periods of words, » Discrete applied mathematics, vol. 163, Part 3, pp. 287-297, 2014.
    [Bibtex] 
    @article{Fici2014287,
title = "Algorithms for computing Abelian periods of words ",
journal = "Discrete Applied Mathematics ",
volume = "163, Part 3",
number = "",
pages = "287 - 297",
year = "2014",
note = "Stringology Algorithms ",
issn = "0166-218X",
doi = "10.1016/j.dam.2013.08.021",
url = "http://www.sciencedirect.com/science/article/pii/S0166218X13003624",
author = "Gabriele Fici and Thierry Lecroq and Arnaud Lefebvre and Élise Prieur-Gaston",
keywords = "Abelian period",
keywords = "Abelian repetition",
keywords = "Weak repetition",
keywords = "Design of algorithms",
keywords = "Text algorithms",
keywords = "Combinatorics on words ",
abstract = "Abstract Constantinescu and Ilie [S. Constantinescu, L. Ilie. Fine and Wilf’s theorem for abelian periods, Bulletin of the European Association for Theoretical Computer Science 89 (2006) 167–170] introduced the notion of an Abelian period of a word. A word of length n over an alphabet of size σ can have Θ ( n 2 ) distinct Abelian periods. The Brute-Force algorithm computes all the Abelian periods of a word in time O ( n 2 × σ ) using O ( n × σ ) space. We present an offline algorithm based on a select function having the same worst-case theoretical complexity as the Brute-Force one, but outperforming it in practice. We then present online algorithms that also enable us to compute all the Abelian periods of all the prefixes of w . "
}

2013

  • [DOI] A. Yepes, E. Prieur-Gaston, and A. Névéol, « Combining medline and publisher data to create parallel corpora for the automatic translation of biomedical text, » Bmc bioinformatics, vol. 14, iss. 1, p. 146, 2013.
    [Bibtex] 
    @article{Yepes2013,
author = {Yepes, AJJ and Prieur-Gaston, E and Névéol, A},
title = {Combining MEDLINE and publisher data to create parallel corpora for the automatic translation of biomedical text},
journal = {BMC Bioinformatics},
year = {2013},
volume = {14},
number = {1},
pages = {146},
url = {http://www.biomedcentral.com/1471-2105/14/146/abstract},
doi = {10.1186/1471-2105-14-146}
}
  • G. Fici, A. Langiu, T. Lecroq, A. Lefebvre, F. Mignosi, and E. Prieur-Gaston, « Abelian repetitions in sturmian words, » in Developments in language theory, Springer Berlin Heidelberg, 2013, p. 227–238.
    [Bibtex] 
    @incollection{Fici2013a,
author = {Fici, Gabriele and Langiu, Alessio and Lecroq, Thierry and Lefebvre, Arnaud and Mignosi, Filippo and Prieur-Gaston, Elise},
title = {Abelian Repetitions in Sturmian Words},
booktitle = {Developments in Language Theory},
month = {January},
publisher = {Springer Berlin Heidelberg},
year = {2013},
series = {Lecture Notes in Computer Science},
number = {7907},
pages = {227--238},
url = {http://link.springer.com/chapter/10.1007/978-3-642-38771-5_21}
}
  • G. Fici, A. Langiu, T. Lecroq, A. Lefebvre, F. Mignosi, and É. Prieur-Gaston, Sturmian words and abelian repetitions, 2013.
    [Bibtex] 
    @misc{seqbio2013a,
author = {Fici,G. and Langiu, A. and Lecroq, T. and Lefebvre, A. and Mignosi, F. and Prieur-Gaston, \'E.},
title = {Sturmian Words and Abelian Repetitions},
year = {2013},
note = {Montpellier, {F}rance}
}

2012

  • [DOI] S. Coutant, C. Cabot, A. Lefebvre, M. Léonard, É. Prieur-Gaston, D. Campion, T. Lecroq, and H. Dauchel, « Eva: exome variation analyzer, an efficient and versatile tool for filtering strategies in medical genomics, » Bmc bioinformatics, vol. 13, iss. Suppl 14, p. S9, 2012.
    [Bibtex] 
    @article{Coutant2012a,
author = {Coutant, S and Cabot, C and Lefebvre, A and Léonard, M and Prieur-Gaston, \'E and Campion, D and Lecroq, T and Dauchel, H},
title = {EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics},
journal = {BMC Bioinformatics},
year = {2012},
volume = {13},
number = {Suppl 14},
pages = {S9},
url = {http://www.biomedcentral.com/1471-2105/13/S14/S9},
doi = {10.1186/1471-2105-13-S14-S9}
}
  • [DOI] L. Soualmia, É. Prieur-Gaston, Z. Moalla, T. Lecroq, and S. Darmoni, « Matching health information seekers’ queries to medical terms., » Bmc bioinformatics, vol. 13, iss. Suppl 14, p. S11, 2012.
    [Bibtex] 
    @article{Soualmia2012,
author = {Soualmia, LF and Prieur-Gaston, \'E and Moalla, Z and Lecroq, T and Darmoni, SJ},
title = {Matching health information seekers' queries to medical terms.},
journal = {BMC Bioinformatics},
year = {2012},
volume = {13},
number = {Suppl 14},
pages = {S11},
url = {http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3439674/},
doi = {10.1186/1471-2105-13-S14-S11}
}
  • G. Fici, T. Lecroq, A. Lefebvre, É. Prieur-Gaston, and W. F. Smyth, « Quasi-linear time computation of the smallest abelian period of a word, » in Prague stringology conference 2012 (psc 2012), Prague, Tcheque Republic, 2012.
    [Bibtex] 
    @inproceedings{Fici2012a,
author = {G. Fici and T. Lecroq and A. Lefebvre and \'E. Prieur-Gaston and W. F. Smyth},
title = {Quasi-Linear Time Computation of the Smallest Abelian Period of a Word},
booktitle = {Prague Stringology Conference 2012 (PSC 2012)},
address = {Prague, Tcheque Republic},
year = {2012}
}
  • [DOI] Z. Moalla, L. Soualmia, É. Prieur-Gaston, and S. Darmoni, « Correction orthographique de requ?tes : l’apport des distances de levenshtein et stoilos., » in Syst?mes d’information pour l’amélioration de la qualité en santé. comptes rendus des quatorzièmes journées francophones d’informatique médicale (jfim)., Tunis, 2012, pp. 3-12.
    [Bibtex] 
    @inproceedings{Moalla2011,
author = {Moalla, Z and Soualmia, LF and Prieur-Gaston, \'E and Darmoni, SJ},
title = {Correction orthographique de requ?tes : l'apport des distances de Levenshtein et Stoilos.},
booktitle = {Syst?mes d'information pour l'amélioration de la qualité en santé. Comptes rendus des quatorzièmes Journées francophones d'informatique médicale (JFIM).},
address = {Tunis},
month = {Septembre},
publisher = {Springer},
year = {2012},
series = {Informatique et Santé},
pages = {3-12},
url = {http://link.springer.com/chapter/10.1007%2F978-2-8178-0285-5_1},
doi = {10.1007/978-2-8178-0285-5_1}
}
  • G. Fici, T. Lecroq, A. Lefebvre, É. Prieur-Gaston, and W. F. Smyth, « Quasi-linear time computation of abelian periods of a word slides, » in Seqbio12 -workshop algorithmique, combinatoire du texte et applications en bio-informatique, Marne-la-Vallée, France, 2012.
    [Bibtex] 
    @inproceedings{Fici2012c,
author = {Fici, G and Lecroq, T and Lefebvre, A and Prieur-Gaston, \'E and Smyth, W. F.},
title = {Quasi-linear time computation of abelian periods of a word slides},
booktitle = {SeqBio12 -Workshop Algorithmique, combinatoire du texte et applications en bio-informatique},
address = {Marne-la-Vallée, France},
year = {2012}
}
  • S. Coutant, C. Cabot, W. Tair, A. Lefebvre, M. Léonard, É. Prieur-Gaston, D. Campion, T. Lecroq, and H. Dauchel, « Eva: exome variation analyzer, a tool for filtering strategies in medical genomics, » in 13e édition du colloque jobim (journées ouvertes en biologie, informatique et mathématiques), 2012.
    [Bibtex] 
    @inproceedings{Coutant2012,
author = {Coutant, S and Cabot, C and Tair, W and Lefebvre, A and Léonard, M and Prieur-Gaston, \'E and Campion, D and Lecroq, T and Dauchel, H},
title = {EVA: Exome Variation Analyzer, A tool for filtering strategies in medical genomics},
booktitle = {13e édition du colloque JOBIM (Journées Ouvertes en Biologie, Informatique et Mathématiques)},
year = {2012},
note = {Accepté},
url = {http://jobim2012.inria.fr/jobim_actes_2012_online.pdf}
}
  • G. Fici, A. Langiu, A. Lefebvre, and É. Prieur-Gaston, « Algorithms for computing abelian periods of words, » Corr, abs/1211.5389, 2012.
    [Bibtex] 
    @article{Fici2012b,
author = {Fici, G and Langiu, A and Lefebvre, A and Prieur-Gaston, \'E},
title = {Algorithms for computing abelian periods of words},
journal = {CoRR, abs/1211.5389},
year = {2012}
}

2011

  • S. Coutant, A. Lefebvre, M. Léonard, É. Prieur-Gaston, D. Campion, T. Lecroq, and H. Dauchel, « Eva: exome variation analyzer, a convivial tool for filtering strategies, » in Proccedings of nettab’11(network tools and applications in biology), Pavia, Italy, 2011.
    [Bibtex] 
    @inproceedings{Coutant2011,
author = {Coutant, S and Lefebvre, A and Léonard, M and Prieur-Gaston, \'E and Campion, D and Lecroq, T and Dauchel, H},
title = {EVA: Exome Variation Analyzer, a convivial tool for filtering strategies},
booktitle = {Proccedings of NETTAB'11(Network Tools and Applications in Biology)},
address = {Pavia, Italy},
year = {2011},
url = {http://f1000.com/posters/browse/summary/1089452}
}
  • G. Fici, T. Lecroq, A. Lefebvre, and É. Prieur-Gaston, « Computing Abelian periods in words, » in Proceedings of the prague stringology conference 2011, Prague, Tcheque Republic, 2011, pp. 184-196.
    [Bibtex] 
    @inproceedings{Fici2011a,
author = {Fici, G. and Lecroq, T. and Lefebvre, A. and Prieur-Gaston, \'E.},
title = { {C}omputing {A}belian periods in words},
booktitle = {Proceedings of the Prague Stringology Conference 2011},
address = {Prague, Tcheque Republic},
year = {2011},
pages = {184-196}
}
  • Z. Moalla, L. Soualmia, E. Prieur-Gaston, T. Lecroq, and S. Darmoni, « Spell-checking queries by combining levenshtein and stoilos distances, » in Proccedings of nettab’11(network tools and applications in biology), Pavia, Italy, 2011.
    [Bibtex] 
    @inproceedings{Moalla2011a,
author = {Moalla, Z and Soualmia, LF and Prieur-Gaston, E and Lecroq, T and Darmoni, SJ},
title = {Spell-checking queries by combining Levenshtein and Stoilos distances},
booktitle = {Proccedings of NETTAB'11(Network Tools and Applications in Biology)},
address = {Pavia, Italy},
month = {October},
year = {2011},
url = {http://www-igm.univ-mlv.fr/~lecroq/articles/nettab2011-dis.pdf}
}
  • G. Fici, T. Lecroq, A. Lefebvre, and E. Prieur Gaston, « Computing abelian periods in words, » in 10e anniversaire du séminaire mamux, IRCAM, Paris, France, 2011.
    [Bibtex] 
    @inproceedings{Fici2011,
author = {Fici, G and Lecroq, T and Lefebvre, A and Prieur Gaston, E},
title = {Computing Abelian Periods in Words},
booktitle = {10e anniversaire du Séminaire MaMuX},
address = {IRCAM, Paris, France},
year = {2011}
}
  • G. Fici, T. Lecroq, A. Lefebvre, and É. Prieur-Gaston, « Computing Abelian Periods in Words, » in SeqBi11 – Workshop Algorithmique, combinatoire du texte et applications en bio-informatique, Rennes France, 2011.
    [Bibtex] 
    @inproceedings{FICI:2011:HAL-00560414:1,
author = {Fici, G. and Lecroq, T. and Lefebvre, A. and Prieur-Gaston, \'E.},
title = {{C}omputing {A}belian {P}eriods in {W}ords},
booktitle = {{S}eq{B}i11 - {W}orkshop {A}lgorithmique, combinatoire du texte et applications en bio-informatique },
address = {Rennes France},
year = {2011},
url = {http://hal.archives-ouvertes.fr/hal-00560414/en/}
}
  • G. Fici, T. lecroq, A. Lefebvre, and É. Prieur-Gaston, « Computing abelian periods in words, » in London Stringology Days/London Algorithmic Workshop 2011, Londres Royaume-Uni, 2011, p. 184–196.
    [Bibtex] 
    @inproceedings{FICI:2011:HAL-00569139:1,
author = {Fici, G and lecroq, T and Lefebvre, A and Prieur-Gaston, \'E},
title = {{C}omputing abelian periods in words},
booktitle = {{L}ondon {S}tringology {D}ays/{L}ondon {A}lgorithmic {W}orkshop 2011 },
address = {Londres Royaume-Uni },
year = {2011},
pages = {184--196},
url = {http://hal.archives-ouvertes.fr/hal-00569139}
}
  • G. Fici, T. lecroq, A. Lefebvre, and É. Prieur-Gaston, « Computing abelian periods in words, » 2011.
    [Bibtex] 
    @techreport{Fici2011b,
author = {Fici, G and lecroq, T and Lefebvre, A and Prieur-Gaston, \'E},
title = {Computing Abelian periods in words},
year = {2011},
note = {Report ISRN I3S/RR-2011-01-FR}
}

2010

  • [DOI] R. Groult, E. Prieur, and G. Richomme, « Counting distinct palindromes in a word in linear time, » Information processing letters, vol. 110, iss. 20, p. 908–912, 2010.
    [Bibtex] 
    @article{groult_counting_2010,
author = {Groult, Richard and Prieur, Elise and Richomme, Gwénaël},
title = {Counting distinct palindromes in a word in linear time},
month = {September},
journal = {Information Processing Letters},
year = {2010},
volume = {110},
number = {20},
pages = {908--912},
url = {http://www.sciencedirect.com/science/article/pii/S002001901000236X},
doi = {16/j.ipl.2010.07.018}
}
  • B. Gaston, R. Groult, A. Lefebvre, M. Léonard, and E. Prieur-Gaston, « Multiplions et divisons avec des bâtons : Les réglettes de Genaille et Lucas., » Bulletin vert de l’apmep, iss. 488, p. p. 339-348, 2010.
    [Bibtex] 
    @article{Gaston2010,
author = {Gaston, Benoist and Groult, Richard and Lefebvre, Arnaud and L{\'e}onard, Martine and Prieur-Gaston, Elise},
title = {{Multiplions et divisons avec des b{\^a}tons : Les r{\'e}glettes de Genaille et Lucas.}},
month = {May},
journal = {Bulletin Vert de l'APMEP},
year = {2010},
number = {488},
pages = {p. 339-348},
url = {http://hal.archives-ouvertes.fr/hal-00488540/en/}
}
  • R. Groult, É. Prieur, and G. Richomme, « Counting different palindromes in a word in linear time, » in Workshop algorithmique, combinatoire du texte et applications en bio-informatique, Montpellier, France, 2010.
    [Bibtex] 
    @inproceedings{Groult2010,
author = {Groult, R and Prieur, \'E and Richomme, G},
title = {Counting different palindromes in a word in linear time},
booktitle = {Workshop Algorithmique, combinatoire du texte et applications en bio-informatique},
address = {Montpellier, France},
year = {2010}
}

2009

  • A. Pauchet, M. El-Abed, T. Merabti, É. Prieur, T. Lecroq, and S. Darmoni, « 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, vol. 23, iss. 1, pp. 113-132, 2009.
    [Bibtex] 
    @article{pauchet:hal-00450114,
TITLE = {{Identification de r{\'e}p{\'e}titions dans les navigations au sein d'un catalogue de sant{\'e}}},
AUTHOR = {Pauchet, Alexandre and El-Abed, Mohamad and Merabti, Tayeb and Prieur, {\'E}lise and Lecroq, Thierry and Darmoni, St{\'e}fan},
URL = {https://hal.archives-ouvertes.fr/hal-00450114},
JOURNAL = {{Revue des Sciences et Technologies de l'Information - S{\'e}rie RIA : Revue d'Intelligence Artificielle}},
PUBLISHER = {{Lavoisier}},
VOLUME = {23},
NUMBER = {1},
PAGES = {113-132},
YEAR = {2009},
MONTH = Jan,
HAL_ID = {hal-00450114},
HAL_VERSION = {v1},
}
  • [DOI] S. Darmoni, S. Sakji, S. Pereira, T. Merabti, E. Prieur, M. Joubert, and B. Thirion, « Multiple terminologies in an health portal: automatic indexing and information retrieval, » in Artificial intelligence in medicine, Verona, Italy, 2009, pp. 255-259.
    [Bibtex] 
    @inproceedings{Darmoni2009a,
author = {Darmoni, SJ and Sakji, S and Pereira, S and Merabti, T and Prieur, E and Joubert, M and Thirion, B},
title = {Multiple terminologies in an health portal: automatic indexing and information retrieval},
booktitle = {Artificial Intelligence in Medicine},
address = {Verona, Italy},
month = {July},
publisher = {Springer},
year = {2009},
series = {Lecture Notes in Computer Science},
pages = {255-259},
note = {PSIP. InterSTIS},
doi = {10.1007/978-3-642-02976-9_37}
}
  • [DOI] A. Dirieh Dibad, S. Sakji, E. Prieur, S. Pereira, M. Joubert, and S. Darmoni, « Recherche d’information multi-terminologique en contexte : etude préliminaire, » in Risques, technologies de l’information pour les pratiques médicales : comptes rendus des treizi?mes journées francophones d’informatique médicale (jfim), Nice, France, 2009, pp. 101-112.
    [Bibtex] 
    @inproceedings{Dirieh2009,
author = {Dirieh Dibad, AD and Sakji, S and Prieur, E and Pereira, S and Joubert, M and Darmoni, SJ},
title = {Recherche d'information multi-terminologique en contexte : Etude préliminaire},
booktitle = {Risques, technologies de l'information pour les pratiques médicales : comptes rendus des treizi?mes journées francophones d'informatique médicale (JFIM)},
address = {Nice, France},
month = {Avril},
publisher = {Springer},
year = {2009},
series = {Informatique et santé},
volume = {17},
pages = {101-112},
note = {PSIP},
url = {http://www.springerlink.com/content/p582765854143840/},
doi = {10.1007/978-2-287-99305-3_10}
}

2008

  • [DOI] É. Prieur and T. Lecroq, « On-line construction of compact suffix vectors and maximal repeats, » Theoretical computer science, vol. 407, iss. 1-3, pp. 290-301, 2008.
    [Bibtex] 
    @article{Prieur,
author = {Prieur, \'E and Lecroq, T},
title = {On-line construction of compact suffix vectors and maximal repeats},
journal = {Theoretical Computer Science},
year = {2008},
volume = {407},
number = {1-3},
pages = {290-301},
url = {http://www-igm.univ-mlv.fr/~lecroq/articles/tcs2008.pdf},
doi = {10.1016/j.tcs.2008.06.017}
}

2007

  • É. Prieur, « Méthodes et structures de données pour l’indexation et la détection de répétitions dans les séquences biologiques : les vecteurs de suffixes, » PhD Thesis, 2007.
    [Bibtex] 
    @phdthesis{Prieur2007,
author = {Prieur, \'E},
title = {M\'ethodes et structures de donn\'ees pour l'indexation et la d\'etection de r\'ep\'etitions dans les s\'equences biologiques : les vecteurs de suffixes},
school = {Universit\'e de Rouen, France},
year = {2007}
}

2006

  • É. Prieur and T. Lecroq, « On-line construction of suffix vectors and maximal repeats, » in Proceedings of the 11th mons days of theoretical computer science, Rennes, France, 2006, p. 311–322.
    [Bibtex] 
    @inproceedings{Prieur2006,
author = {Prieur, \'E and Lecroq, T},
title = {On-line construction of suffix vectors and maximal repeats},
booktitle = {Proceedings of the 11th Mons Days of Theoretical Computer Science},
address = {Rennes, France},
year = {2006},
pages = {311--322},
url = {http://www.irisa.fr/JM06/Papers/prieur.pdf}
}
  • É. Prieur and T. Lecroq, « From suffix trees to suffix vectors, » International journal on foundations of computer science, vol. 17, iss. 6, p. 1385–1402, 2006.
    [Bibtex] 
    @article{Prieur2006a,
author = {Prieur, \'E and Lecroq, T},
title = {From suffix trees to suffix vectors},
journal = {International Journal on Foundations of Computer Science},
year = {2006},
volume = {17},
number = {6},
pages = {1385--1402},
url = {http://www.stringology.org/cgi-bin/getfile.cgi?t=pdf&c=-&y=2005&n=3}
}

2005

  • É. Prieur and T. Lecroq, « From suffix trees to suffix vectors, » in Proceedings of the prague stringology conference (psc 2005), Prague, Czech Republic, 2005, p. 37–53.
    [Bibtex] 
    @inproceedings{Prieur2005a,
author = {Prieur, \'E and Lecroq, T},
title = {From suffix trees to suffix vectors},
booktitle = {Proceedings of the Prague Stringology Conference (PSC 2005)},
address = {Prague, Czech Republic},
year = {2005},
pages = {37--53}
}
  • É. Prieur and T. Lecroq, Des arbres de suffixes aux vecteurs de suffixes, 2005.
    [Bibtex] 
    @misc{Prieur2005,
author = {{\'E}. Prieur and T. Lecroq},
title = {Des arbres de suffixes aux vecteurs de suffixes},
year = {2005}
}