Élise Prieur

According to our database1, Élise Prieur authored at least 24 papers between 2006 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
UMI-VarCal: a new UMI-based variant caller that efficiently improves low-frequency variant detection in paired-end sequencing NGS libraries.
Bioinform., 2020

2019
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform.
Inf. Process. Lett., 2019

Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences.
Int. J. Data Min. Bioinform., 2019

2018
A survey of string orderings and their application to the Burrows-Wheeler transform.
Theor. Comput. Sci., 2018

Three Strategies for the Dead-Zone String Matching Algorithm.
Proceedings of the Prague Stringology Conference 2018, 2018

Practical fast on-line exact pattern matching algorithms for highly similar sequences.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2016
Abelian powers and repetitions in Sturmian words.
Theor. Comput. Sci., 2016

Fast computation of abelian runs.
Theor. Comput. Sci., 2016

Binary block order Rouen Transform.
Theor. Comput. Sci., 2016

A note on easy and efficient computation of full abelian periods of a word.
Discret. Appl. Math., 2016

2015
Abelian Powers and Repetitions in Sturmian Words.
CoRR, 2015

Online Computation of Abelian Runs.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Algorithms for computing Abelian periods of words.
Discret. Appl. Math., 2014

2013
Combining MEDLINE and publisher data to create parallel corpora for the automatic translation of biomedical text.
BMC Bioinform., 2013

Abelian Repetitions in Sturmian Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
Matching health information seekers' queries to medical terms.
BMC Bioinform., 2012

EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics.
BMC Bioinform., 2012

Quasi-linear Time Computation of the Abelian Periods of a Word.
Proceedings of the Prague Stringology Conference 2012, 2012

2011
Computing Abelian Periods in Words.
Proceedings of the Prague Stringology Conference 2011, 2011

2010
Counting distinct palindromes in a word in linear time.
Inf. Process. Lett., 2010

2009
Identification de répétitions dans les navigations au sein d'un catalogue de santé.
Rev. d'Intelligence Artif., 2009

Multiple Terminologies in a Health Portal: Automatic Indexing and Information Retrieval.
Proceedings of the Artificial Intelligence in Medicine, 2009

2008
On-line construction of compact suffix vectors and maximal repeats.
Theor. Comput. Sci., 2008

2006
From Suffix Trees to Suffix Vectors.
Int. J. Found. Comput. Sci., 2006


  Loading...