default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartine Léonard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j14]Jacqueline W. Daykin
, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur, Bruce W. Watson:
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform. Inf. Process. Lett. 147: 82-87 (2019)- 2018
- [j13]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
A survey of string orderings and their application to the Burrows-Wheeler transform. Theor. Comput. Sci. 710: 52-65 (2018) - [j12]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment with gaps. Theor. Comput. Sci. 710: 148-157 (2018) - [c4]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
- [i3]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
- [j11]Joong Chae Na, Hyunjoon Kim, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of alignment: A compressed index for similar strings. Theor. Comput. Sci. 638: 159-170 (2016) - [j10]Alice Héliou, Martine Léonard, Laurent Mouchard, Mikaël Salson:
Efficient dynamic range minimum query. Theor. Comput. Sci. 656: 108-117 (2016) - [j9]Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston:
Binary block order Rouen Transform. Theor. Comput. Sci. 656: 118-134 (2016) - [i2]Joong Chae Na, Hyunjoon Kim, Seunghwan Min, Heejin Park, Thierry Lecroq, Martine Léonard, Laurent Mouchard, Kunsoo Park:
FM-index of Alignment with Gaps. CoRR abs/1606.03897 (2016) - 2012
- [j8]Sophie Coutant, Chloé Cabot, Arnaud Lefebvre, Martine Léonard, Élise Prieur-Gaston, Dominique Campion, Thierry Lecroq, Hélène Dauchel:
EVA: Exome Variation Analyzer, an efficient and versatile tool for filtering strategies in medical genomics. BMC Bioinform. 13(S-14): S9 (2012) - [j7]Martine Léonard, Laurent Mouchard, Mikaël Salson:
On the number of elements to reorder when updating a suffix array. J. Discrete Algorithms 11: 87-99 (2012) - [i1]Eric Rivals, Nicolas Philippe, Mikaël Salson, Martine Léonard, Therese Commes, Thierry Lecroq:
A Scalable Indexing Solution to Mine Huge Genomic Sequence Collections. ERCIM News 2012(89) (2012) - 2011
- [j6]Nicolas Philippe, Mikaël Salson, Thierry Lecroq, Martine Léonard, Therese Commes, Eric Rivals:
Querying large read collections in main memory: a versatile data structure. BMC Bioinform. 12: 242 (2011) - 2010
- [j5]Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard:
Dynamic extended suffix arrays. J. Discrete Algorithms 8(2): 241-257 (2010)
2000 – 2009
- 2009
- [j4]Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard:
A four-stage algorithm for updating a Burrows-Wheeler transform. Theor. Comput. Sci. 410(43): 4350-4359 (2009) - 2008
- [c3]Mikaël Salson, Thierry Lecroq, Martine Léonard, Laurent Mouchard:
Dynamic Burrows-Wheeler Transform. Stringology 2008: 13-25 - 2005
- [j3]Richard Groult, Martine Léonard, Laurent Mouchard:
A Linear Algorithm for the Detection of Evolutive Tandem Repeats. J. Autom. Lang. Comb. 10(5/6): 671-685 (2005) - 2004
- [j2]Richard Groult, Martine Léonard, Laurent Mouchard:
Speeding up the detection of evolutive tandem repeats. Theor. Comput. Sci. 310(1-3): 309-328 (2004) - 2003
- [c2]Richard Groult, Martine Léonard, Laurent Mouchard:
A Linear Algorithm for the Detection of Evolutive Tandem Repeats. Stringology 2003: 77-90 - 2002
- [c1]Richard Groult, Martine Léonard, Laurent Mouchard:
Evolutive Tandem Repeats Using Hamming Distance. MFCS 2002: 292-304
1980 – 1989
- 1988
- [j1]Martine Léonard:
A Property of Biprefix Codes. RAIRO Theor. Informatics Appl. 22(3): 311-318 (1988)
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-24 22:55 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:
