Eric Tannier

Affiliations:
  • University of Lyon, LBBE, France


According to our database1, Eric Tannier authored at least 56 papers between 2001 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Phylogenetic reconciliation.
PLoS Comput. Biol., November, 2022

Thirdkind: displaying phylogenetic encounters beyond 2-level reconciliation.
Bioinform., 2022

2020
Zombi: a phylogenetic simulator of trees, genomes and sequences that accounts for dead linages.
Bioinform., 2020

Treerecs: an integrated phylogenetic tool, from sequences to reconciliations.
Bioinform., 2020

2019
Gene tree reconciliation including transfers with replacement is NP-hard and FPT.
J. Comb. Optim., 2019

2018
Phylogenetic signal from rearrangements in 18 Anopheles species by joint scaffolding extant and ancestral genomes.
BMC Genom., 2018

RecPhyloXML: a format for reconciled gene trees.
Bioinform., 2018

2017
Gene tree reconciliation including transfers with replacement is hard and FPT.
CoRR, 2017

Gene tree species tree reconciliation with gene conversion.
CoRR, 2017

Resolution and reconciliation of non-binary gene trees with transfers, duplications and losses.
Bioinform., 2017

Algorithms for computing the double cut and join distance on both gene order and intergenic sizes.
Algorithms Mol. Biol., 2017

2016
Sorting Signed Permutations by Reversal (Reversal Sequence).
Encyclopedia of Algorithms, 2016

Genome rearrangements with indels in intergenes restrict the scenario space.
BMC Bioinform., 2016

Genome Rearrangements on Both Gene Order and Intergenic Regions.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Comparative Genomics on Artificial Life.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Probabilistic modeling of the evolution of gene synteny within reconciled phylogenies.
BMC Bioinform., December, 2015

Moments of genome evolution by Double Cut-and-Join.
BMC Bioinform., December, 2015

2014
Counting and sampling SCJ small parsimony solutions.
Theor. Comput. Sci., 2014

2013
On sampling SCJ rearrangement scenarios
CoRR, 2013

Lateral gene transfer, rearrangement, reconciliation.
BMC Bioinform., 2013

Gene tree correction guided by orthology.
BMC Bioinform., 2013

FPSAC: fast phylogenetic scaffolding of ancient contigs.
Bioinform., 2013

Duplication, Rearrangement and Reconciliation: A Follow-Up 13 Years Later.
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
Approximating the number of Double Cut-and-Join scenarios.
Theor. Comput. Sci., 2012

Linearization of ancestral multichromosomal genomes.
BMC Bioinform., 2012

ANGES: reconstructing ANcestral GEnomeS maps.
Bioinform., 2012

Evolution of gene neighborhoods within reconciled phylogenies.
Bioinform., 2012

Preserving Inversion Phylogeny Reconstruction.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
Reconstructing the architecture of the ancestral amniote genome.
Bioinform., 2011

Mapping ancestral genomes with massive gene loss: A matrix sandwich problem.
Bioinform., 2011

Evolution Combinatoire, Algorithmique des Chromosomes.
, 2011

2010
Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods II.
J. Comput. Biol., 2010

Detecting lateral gene transfers by statistical reconciliation of phylogenetic forests.
BMC Bioinform., 2010

Bayesian sampling of genomic rearrangement scenarios via double cut and join.
Bioinform., 2010

Cassis: detection of genomic rearrangement breakpoints.
Bioinform., 2010

Guided Genome Halving: Provably Optimal Solutions Provide Good Insights into the Preduplication Ancestral Genome of Saccharomyces Cerevisiae.
Proceedings of the Biocomputing 2010: Proceedings of the Pacific Symposium, 2010

2009
Computation of Perfect DCJ Rearrangement Scenarios with Linear and Circular Chromosomes.
J. Comput. Biol., 2009

Multichromosomal median and halving problems under different genomic distances.
BMC Bioinform., 2009

Yeast Ancestral Genome Reconstructions: The Possibilities of Computational Methods.
Proceedings of the Comparative Genomics, International Workshop, 2009

Prediction of Contiguous Regions in the Amniote Ancestral Genome.
Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

Combinatorics of Genome Rearrangements.
Computational molecular biology, MIT Press, ISBN: 978-0-262-06282-4, 2009

2008
Sorting Signed Permutations by Reversal (Reversal Sequence).
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

A Methodological Framework for the Reconstruction of Contiguous Regions of Ancestral Genomes and Its Application to Mammalian Genomes.
PLoS Comput. Biol., 2008

Precise detection of rearrangement breakpoints in mammalian chromosomes.
BMC Bioinform., 2008

Multichromosomal Genome Median and Halving Problems.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Perfect DCJ Rearrangement.
Proceedings of the Comparative Genomics, International Workshop, 2008

Reactive Stochastic Local Search Algorithms for the Genomic Median Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2007
Evolution under Reversals: Parsimony and Conservation of Common Intervals.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Advances on sorting by reversals.
Discret. Appl. Math., 2007

The Solution Space of Sorting by Reversals.
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

2005
Perfect Sorting by Reversals.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
On Metric Generators of Graphs.
Math. Oper. Res., 2004

Sorting by Reversals in Subquadratic Time.
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2003
On a modular domination game.
Theor. Comput. Sci., 2003

2001
Connected Joins in Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001


  Loading...