default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnelyse Thévenin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j5]Nina Luhmann
, Manuel Lafond, Annelyse Thévenin, Aïda Ouangraoua, Roland Wittler, Cédric Chauve:
The SCJ Small Parsimony Problem for Weighted Gene Adjacencies. IEEE ACM Trans. Comput. Biol. Bioinform. 16(4): 1364-1373 (2019)- 2016
- [c4]Nina Luhmann, Annelyse Thévenin, Aïda Ouangraoua, Roland Wittler, Cédric Chauve:
The SCJ Small Parsimony Problem for Weighted Gene Adjacencies. ISBRA 2016: 200-210 - [i2]Nina Luhmann, Annelyse Thévenin, Aïda Ouangraoua, Roland Wittler, Cédric Chauve:
The SCJ small parsimony problem for weighted gene adjacencies (Extended version). CoRR abs/1603.08819 (2016) - 2015
- [j4]Pedro Feijão, Fábio Viduani Martinez, Annelyse Thévenin:
On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance. BMC Bioinform. 16(S19): S1 (2015) - 2014
- [c3]Pedro Feijão, Fábio Viduani Martinez, Annelyse Thévenin:
On the Multichromosomal Hultman Number. BSB 2014: 9-16 - 2013
- [p1]Marília D. V. Braga, Cédric Chauve, Daniel Doerr, Katharina Jahn, Jens Stoye, Annelyse Thévenin, Roland Wittler:
The Potential of Family-Free Genome Comparison. Models and Algorithms for Genome Evolution 2013: 287-307 - 2012
- [j3]Daniel Doerr, Annelyse Thévenin, Jens Stoye:
Gene family assignment-free comparative genomics. BMC Bioinform. 13(S-19): S3 (2012)
2000 – 2009
- 2009
- [b1]Annelyse Thévenin:
Aspects algorithmiques des réarrangements génomiques : duplications et ordres partiels. (Algorithmic Aspects of Genome Rearrangements: Duplications and Partial Orders). University of Paris-Sud, Orsay, France, 2009 - [j2]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
On the Approximability of Comparing Genomes with Duplicates. J. Graph Algorithms Appl. 13(1): 19-53 (2009) - [c2]Sébastien Angibaud, Guillaume Fertin, Annelyse Thévenin, Stéphane Vialette:
Pseudo Boolean Programming for Partially Ordered Genomes. RECOMB-CG 2009: 126-137 - 2008
- [j1]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes. J. Comput. Biol. 15(8): 1093-1115 (2008) - [i1]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
On the Approximability of Comparing Genomes with Duplicates. CoRR abs/0806.1103 (2008) - 2007
- [c1]Sébastien Angibaud, Guillaume Fertin, Irena Rusu, Annelyse Thévenin, Stéphane Vialette:
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes. RECOMB-CG 2007: 16-29
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:06 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:
