default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Stéphane Varré
Person information
- affiliation: LIFL Lille, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j7]Pierre Marijon
, Rayan Chikhi, Jean-Stéphane Varré:
yacrd and fpa: upstream tools for long-read genome assembly. Bioinform. 36(12): 3894-3896 (2020)
2010 – 2019
- 2019
- [j6]Pierre Marijon, Rayan Chikhi, Jean-Stéphane Varré:
Graph analysis of fragmented long-read bacterial genome assemblies. Bioinform. 35(21): 4239-4246 (2019) - 2015
- [c10]Tuan Tu Tran, Mathieu Giraud, Jean-Stéphane Varré:
Perfect Hashing Structures for Parallel Similarity Searches. IPDPS Workshops 2015: 332-341 - 2012
- [c9]Antoine Thomas, Aïda Ouangraoua, Jean-Stéphane Varré:
Genome Halving by Block Interchange. BIOINFORMATICS 2012: 58-65 - [c8]Antoine Thomas, Aïda Ouangraoua, Jean-Stéphane Varré:
Single Tandem Halving by Block Interchange. BIOSTEC (Selected Papers) 2012: 162-174 - [c7]Antoine Thomas, Aïda Ouangraoua, Jean-Stéphane Varré:
Tandem Halving Problems by DCJ. WABI 2012: 417-429 - 2011
- [j5]Antoine Thomas, Jean-Stéphane Varré, Aïda Ouangraoua:
Genome dedoubling by DCJ and reversal. BMC Bioinform. 12(S-9): S20 (2011) - [j4]Mathieu Giraud, Jean-Stéphane Varré:
Parallel Position Weight Matrices algorithms. Parallel Comput. 37(8): 466-478 (2011) - [c6]Tuan Tu Tran, Mathieu Giraud, Jean-Stéphane Varré:
Bit-Parallel Multiple Pattern Matching. PPAM (2) 2011: 292-301 - [i1]Antoine Thomas, Aïda Ouangraoua, Jean-Stéphane Varré:
Genome Halving by Block Interchange. CoRR abs/1107.1076 (2011) - 2010
- [j3]Laurie Tonon, Hélène Touzet, Jean-Stéphane Varré:
TFM-Explorer: mining cis-regulatory regions in genomes. Nucleic Acids Res. 38(Web-Server-Issue): 286-292 (2010)
2000 – 2009
- 2009
- [c5]Mathieu Giraud, Jean-Stéphane Varré:
Parallel Position Weight Matrices Algorithms. ISPDC 2009: 65-72 - [c4]Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré:
Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching. LATA 2009: 481-492 - 2008
- [b1]Jean-Stéphane Varré:
Algorithmes pour la comparaison de génomes et la recherche de signaux cis-régulateurs. Lille University of Science and Technology, France, 2008 - 2007
- [j2]Hélène Touzet, Jean-Stéphane Varré:
Efficient and accurate P-value computation for Position Weight Matrices. Algorithms Mol. Biol. 2 (2007) - 2006
- [c3]Aude Liefooghe, Hélène Touzet, Jean-Stéphane Varré:
Large Scale Matching for Position Weight Matrices. CPM 2006: 401-412 - 2004
- [c2]Martin Figeac, Jean-Stéphane Varré:
Sorting by Reversals with Common Intervals. WABI 2004: 26-37
1990 – 1999
- 1999
- [j1]Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals:
Transformation distances: a family of dissimilarity measures based on movements of segments. Bioinform. 15(3): 194-202 (1999) - 1998
- [c1]Jean-Stéphane Varré, Jean-Paul Delahaye, Eric Rivals:
The transformation distance: A dissimilarity measure based an movements of segments. German Conference on Bioinformatics 1998
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 23:08 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:
