Elise Prieur-Gaston
Elise Prieur-Gaston
LITIS - université de Rouen Normandie
Подтвержден адрес электронной почты в домене univ-rouen.fr - Главная страница
Название
Процитировано
Процитировано
Год
Counting distinct palindromes in a word in linear time
R Groult, É Prieur, G Richomme
Information Processing Letters 110 (20), 908-912, 2010
402010
Combining MEDLINE and publisher data to create parallel corpora for the automatic translation of biomedical text
AJ Yepes, E Prieur-Gaston, A Névéol
BMC bioinformatics 14 (1), 1-10, 2013
232013
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 (14), 1-12, 2012
212012
Computing Abelian Periods in Words.
G Fici, T Lecroq, A Lefebvre, É Prieur-Gaston
Stringology, 184-196, 2011
202011
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
172016
Multiple terminologies in a health portal: automatic indexing and information retrieval
SJ Darmoni, S Pereira, S Sakji, T Merabti, É Prieur, M Joubert, B Thirion
Conference on Artificial Intelligence in Medicine in Europe, 255-259, 2009
172009
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
142012
Algorithms for computing Abelian periods of words
G Fici, T Lecroq, A Lefebvre, É Prieur-Gaston
Discrete Applied Mathematics 163, 287-297, 2014
132014
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
112013
Matching health information seekers' queries to medical terms
LF Soualmia, E Prieur-Gaston, Z Moalla, T Lecroq, SJ Darmoni
BMC bioinformatics 13 (14), 1-15, 2012
92012
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
72016
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
62020
On-line construction of compact suffix vectors and maximal repeats
É Prieur, T Lecroq
Theoretical computer science 407 (1-3), 290-301, 2008
62008
From suffix trees to suffix vectors
E Prieur, T Lecroq
International Journal of Foundations of Computer Science 17 (06), 1385-1402, 2006
62006
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
52019
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
52009
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
42018
Fast computation of abelian runs
G Fici, T Kociumaka, T Lecroq, A Lefebvre, É Prieur-Gaston
Theoretical Computer Science 656, 256-264, 2016
32016
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
32011
Identification de répétitions dans les navigations au sein d'un catalogue de santé
A Pauchet, M EL ABED, T Merabti, É Prieur, T Lecroq
Revue d'intelligence artificielle 23 (1), 113-132, 2009
32009
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20