Vincent Berry

Orcid: 0000-0001-7271-4027

Affiliations:
  • LIRMM Montpellier, France


According to our database1, Vincent Berry authored at least 39 papers between 1993 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Stop Reinventing the Wheel! Promoting Community Software in Computing Education.
Proceedings of the 2022 Working Group Reports on Innovation and Technology in Computer Science Education, 2022

Leveraging Community Software in CS Education to Avoid Reinventing the Wheel.
Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022

ShellOnYou: Learning by Doing Unix Command Line.
Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022

2021
On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo.
PLoS Comput. Biol., 2021

2020
Scanning Phylogenetic Networks Is NP-hard.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

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

2016
Maximum Compatible Tree.
Encyclopedia of Algorithms, 2016

SylvX: a viewer for phylogenetic tree reconciliations.
Bioinform., 2016

2013
Representing a Set of Reconciliations in a Compact Way.
J. Bioinform. Comput. Biol., 2013

Reconciliation and local gene tree rearrangement can be of mutual profit.
Algorithms Mol. Biol., 2013

2012
Quartets and Unrooted phylogenetic Networks.
J. Bioinform. Comput. Biol., 2012

Accounting for Gene Tree Uncertainties Improves Gene Trees and Reconciliation Inference.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
Building species trees from larger parts of phylogenomic databases.
Inf. Comput., 2011

Models, algorithms and programs for phylogeny reconciliation.
Briefings Bioinform., 2011

2010
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

ScripTree: scripting phylogenetic graphics.
Bioinform., 2010

An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers.
Proceedings of the Comparative Genomics - International Workshop, 2010

2009
Linear time 3-approximation for the MAST problem.
ACM Trans. Algorithms, 2009

On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems.
Discret. Appl. Math., 2009

Computing galled networks from real data.
Bioinform., 2009

From Gene Trees to Species Trees through a Supertree Approach.
Proceedings of the Language and Automata Theory and Applications, 2009

The Structure of Level-k Phylogenetic Networks.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Maximum Compatible Tree.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

PhySIC_IST: cleaning source trees to infer more informative supertrees.
BMC Bioinform., 2008

From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time.
Algorithmica, 2008

On building and comparing trees Application to supertrees in phylogenetics.
, 2008

2007
Maximum agreement and compatible supertrees.
J. Discrete Algorithms, 2007

Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing relative strengths and computational effort.
Eur. J. Oper. Res., 2007

2006
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

2005
On the Approximation of Computing Evolutionary Trees.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Maximum Agreement and Compatible Supertrees (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, 15th Annual Symposium, 2004

2001
A Structured Family of Clustering and Tree Construction Methods.
Adv. Appl. Math., 2001

2000
Inferring evolutionary trees with strong combinatorial evidence.
Theor. Comput. Sci., 2000

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Faster reliable phylogenetic analysis.
Proceedings of the Third Annual International Conference on Research in Computational Molecular Biology, 1999

Quartet Cleaning: Improved Algorithms and Simulations.
Proceedings of the Algorithms, 1999

1995
Évaluation répartie asynchrone de (certaines) requêtes DATALOG.
Proceedings of the JFPLC'95, 1995

1994
Distinguer les variables distinguées.
Proceedings of the JFPLC'94, 1994

1993
Generating Goals and Their Use In Recursive Query Processing.
Proceedings of the Logic Programming, 1993


  Loading...