default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarie-France Sagot
- > Home > Persons > Marie-France Sagot
Publications
- 2014
[j54]Maria Federico, Pierre Peterlongo, Nadia Pisanti
, Marie-France Sagot:
Rime: Repeat identification. Discret. Appl. Math. 163: 275-286 (2014)- 2012
- [j49]Gustavo Akio Tominaga Sacomoto, Janice Kielbassa, Rayan Chikhi, Raluca Uricaru, Pavlos Antoniou, Marie-France Sagot, Pierre Peterlongo, Vincent Lacroix:
KISSPLICE: de-novo calling alternative splicing events from RNA-seq data. BMC Bioinform. 13(S-6): S5 (2012) - 2011
- [c33]Maria Federico, Pierre Peterlongo, Nadia Pisanti, Marie-France Sagot:
Finding Long and Multiple Repeats with Edit Distance. Stringology 2011: 83-97 - 2010
- [c31]Pierre Peterlongo, Nicolas Schnel, Nadia Pisanti, Marie-France Sagot, Vincent Lacroix:
Identifying SNPs without a Reference Genome by Comparing Raw Reads. SPIRE 2010: 147-158 - 2009
- [j34]Pierre Peterlongo, Gustavo Akio Tominaga Sacomoto, Alair Pereira do Lago, Nadia Pisanti, Marie-France Sagot:
Lossless filter for multiple repeats with bounded edit distance. Algorithms Mol. Biol. 4 (2009) - 2008
- [j25]Pierre Peterlongo, Julien Allali, Marie-France Sagot:
Indexing Gapped-Factors Using a Tree. Int. J. Found. Comput. Sci. 19(1): 71-87 (2008) - [j23]Pierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Alair Pereira do Lago, Marie-France Sagot:
Lossless filter for multiple repetitions with Hamming distance. J. Discrete Algorithms 6(3): 497-509 (2008) - 2006
- [c23]Pierre Peterlongo, Julien Allali, Marie-France Sagot:
The gapped-factor tree. Stringology 2006: 182-196 - 2005
- [j10]Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot:
A first approach to finding common motifs with gaps. Int. J. Found. Comput. Sci. 16(6): 1145-1154 (2005) - [c19]Pierre Peterlongo, Nadia Pisanti, Frédéric Boyer, Marie-France Sagot:
Lossless Filter for Finding Long Multiple Approximate Repetitions Using a New Data Structure, the Bi-factor Array. SPIRE 2005: 179-190 - 2004
- [c11]Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot:
A First Approach to Finding Common Motifs With Gaps. Stringology 2004: 88-97
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-08-05 21:14 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:
