default search action
Élise Prieur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j16]Vincent Sater, Pierre-Julien Viailly, Thierry Lecroq
, Élise Prieur-Gaston, Élodie Bohers
UMI-VarCal: a new UMI-based variant caller that efficiently improves low-frequency variant detection in paired-end sequencing NGS libraries. Bioinform. 36(9): 2718-2724 (2020)
2010 – 2019
- 2019
- [j15]Nadia Ben Nsira, Thierry Lecroq
Fast practical online exact single and multiple pattern matching algorithms in highly similar sequences. Int. J. Data Min. Bioinform. 22(1): 1-18 (2019) - [j14]Jacqueline W. Daykin
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. Inf. Process. Lett. 147: 82-87 (2019) - 2018
- [j13]Jacqueline W. Daykin
A survey of string orderings and their application to the Burrows-Wheeler transform. Theor. Comput. Sci. 710: 52-65 (2018) - [c8]Nadia Ben Nsira, Thierry Lecroq
Practical fast on-line exact pattern matching algorithms for highly similar sequences. BIBM 2018: 1772-1777 - [c7]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Three Strategies for the Dead-Zone String Matching Algorithm. Stringology 2018: 117-128 - 2017
- [i7]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce W. Watson:
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. CoRR abs/1708.01130 (2017) - 2016
- [j12]Gabriele Fici
A note on easy and efficient computation of full abelian periods of a word. Discret. Appl. Math. 212: 88-95 (2016) - [j11]Gabriele Fici
Abelian powers and repetitions in Sturmian words. Theor. Comput. Sci. 635: 16-34 (2016) - [j10]Jacqueline W. Daykin
Binary block order Rouen Transform. Theor. Comput. Sci. 656: 118-134 (2016) - [j9]Gabriele Fici
Fast computation of abelian runs. Theor. Comput. Sci. 656: 256-264 (2016) - 2015
- [c6]Gabriele Fici
Online Computation of Abelian Runs. LATA 2015: 391-401 - [i6]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Online Computation of Abelian Runs. CoRR abs/1501.01429 (2015) - [i5]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Powers and Repetitions in Sturmian Words. CoRR abs/1506.02797 (2015) - [i4]Gabriele Fici, Tomasz Kociumaka, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Fast Computation of Abelian Runs. CoRR abs/1506.08518 (2015) - [i3]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
A Note on Easy and Efficient Computation of Full Abelian Periods of a Word. CoRR abs/1510.00634 (2015) - 2014
- [j8]Gabriele Fici
Algorithms for computing Abelian periods of words. Discret. Appl. Math. 163: 287-297 (2014) - 2013
- [j7]Antonio Jimeno-Yepes
Combining MEDLINE and publisher data to create parallel corpora for the automatic translation of biomedical text. BMC Bioinform. 14: 146 (2013) - [c5]Gabriele Fici
Abelian Repetitions in Sturmian Words. Developments in Language Theory 2013: 227-238 - 2012
- [j6]Lina Fatima Soualmia
Matching health information seekers' queries to medical terms. BMC Bioinform. 13(S-14): S11 (2012) - [j5]Sophie Coutant, Chloé Cabot, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston, Dominique Campion, Thierry Lecroq
EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics. BMC Bioinform. 13(S-14): S9 (2012) - [c4]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston, William F. Smyth:
Quasi-linear Time Computation of the Abelian Periods of a Word. Stringology 2012: 103-110 - [i2]Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi, Élise Prieur-Gaston:
Abelian Repetitions in Sturmian Words. CoRR abs/1209.6013 (2012) - [i1]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Algorithms for Computing Abelian Periods of Words. CoRR abs/1211.5389 (2012) - 2011
- [c3]Gabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston:
Computing Abelian Periods in Words. Stringology 2011: 184-196 - 2010
- [j4]Richard Groult, Élise Prieur, Gwénaël Richomme:
Counting distinct palindromes in a word in linear time. Inf. Process. Lett. 110(20): 908-912 (2010)
2000 – 2009
- 2009
- [j3]Alexandre Pauchet, Mohamad El-Abed, Tayeb Merabti, Élise Prieur, Thierry Lecroq
Identification de répétitions dans les navigations au sein d'un catalogue de santé. Rev. d'Intelligence Artif. 23(1): 113-132 (2009) - [c2]Stéfan Jacques Darmoni, Suzanne Pereira, Saoussen Sakji, Tayeb Merabti, Élise Prieur, Michel Joubert, Benoît Thirion:
Multiple Terminologies in a Health Portal: Automatic Indexing and Information Retrieval. AIME 2009: 255-259 - 2008
- [j2]Élise Prieur, Thierry Lecroq
On-line construction of compact suffix vectors and maximal repeats. Theor. Comput. Sci. 407(1-3): 290-301 (2008) - 2006
- [j1]Élise Prieur, Thierry Lecroq
From Suffix Trees to Suffix Vectors. Int. J. Found. Comput. Sci. 17(6): 1385-1402 (2006) - 2005
- [c1]Élise Prieur, Thierry Lecroq:
From suffix trees to suffix vectors. Stringology 2005: 37-53
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: