Annelyse Thévenin

According to our database1, Annelyse Thévenin authored at least 12 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
The SCJ Small Parsimony Problem for Weighted Gene Adjacencies.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

2016
The SCJ small parsimony problem for weighted gene adjacencies (Extended version).
CoRR, 2016

The SCJ Small Parsimony Problem for Weighted Gene Adjacencies.
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

2015
On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance.
BMC Bioinform., December, 2015

2014
On the Multichromosomal Hultman Number.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2014

2013
The Potential of Family-Free Genome Comparison.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
Gene family assignment-free comparative genomics.
BMC Bioinform., 2012

2009
Aspects algorithmiques des réarrangements génomiques : duplications et ordres partiels. (Algorithmic Aspects of Genome Rearrangements: Duplications and Partial Orders).
PhD thesis, 2009

On the Approximability of Comparing Genomes with Duplicates.
J. Graph Algorithms Appl., 2009

Pseudo Boolean Programming for Partially Ordered Genomes.
Proceedings of the Comparative Genomics, International Workshop, 2009

2008
Efficient Tools for Computing the Number of Breakpoints and the Number of Adjacencies between Two Genomes with Duplicate Genes.
J. Comput. Biol., 2008

2007
A Pseudo-boolean Programming Approach for Computing the Breakpoint Distance Between Two Genomes with Duplicate Genes.
Proceedings of the Comparative Genomics, RECOMB 2007 International Workshop, 2007


  Loading...