Mots-clés

Co-auteurs

Nombre de documents

50

Vincent Berry


Article dans une revue28 documents

Communication dans un congrès13 documents

  • Yoann Anselmetti, Vincent Berry, Cedric Chauve, Annie Château, Eric Tannier, et al.. Comment la reconstruction de génomes ancestraux peut aider à l'assemblage de génomes actuels. Journées Ouvertes Biologie Informatique Mathématiques, 2016, Lyon, France. 2016. <hal-01394409>
  • Thi-Hau Nguyen, Jean-Philippe Doyon, Stéphanie Pointet, Anne-Muriel Arigon Chifolleau, Vincent Ranwez, et al.. Accounting for gene tree uncertainty improves gene tree accuracy as well as duplications, transfers and losses predictions. WABI'12 : Workshop on Algorithms in Bioinformatics, Sep 2012, Ljubljana, Slovenia. pp.N/A, 2012. <hal-00718347v3>
  • Thi-Hau Nguyen, Jean-Philippe Doyon, Stéphanie Pointet, Anne-Muriel Arigon Chifolleau, Vincent Ranwez, et al.. Accounting for gene tree uncertainty improves gene tree accuracy as well as duplications, transfers and losses  predictions. WABI: Workshop on Algorithms in Bioinformatics, Sep 2012, Ljubljana, Slovenia. 12th International Workshop on Algorithms in Bioinformatics, LNCS (7534), pp.123-134, 2012, Algorithms in Bioinformatics. <http://algo12.fri.uni-lj.si/?file=wabi>. <10.1007/978-3-642-33122-0_10>. <hal-01189848>
  • Jean-Philippe Doyon, Celine Scornavacca, Yu Gorbunov, Gergely Szöllősi, Vincent Ranwez, et al.. An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers. Eric Tannier. RECOMB'10: Comparative Genomics, Oct 2010, Ottawa, Canada. Springer Berlin Heidelberg, 6398 (6398), pp.93-108, 2010, LNCS. <http://recombcg.uottawa.ca/recombcg2010/>. <10.1007/978-3-642-16181-0_9>. <lirmm-00818889>
  • Jean-Philippe Doyon, Celine Scornavacca, Gergely J. Szöllősi, Vincent Ranwez, Vincent Berry. Un algorithme de parcimonie efficace pour la réconciliation d'arbres de gènes/espèces avec pertes, duplications et transferts. Journées Ouvertes en Biologie, Informatique et Mathématiques, Sep 2010, France. pp.8, 2010, <http://www.jobim2010.fr/>. <lirmm-00833164>
  • Celine Scornavacca, Vincent Berry, Vincent Ranwez. From Gene Trees to Species Trees Through a Supertree Approach. Dediu, Adrian Horia, Ionescu, Armand Mihai, Martin-Vide, Carlos. LATA'09: Third International Conference on Language and Automata Theory and Applications, Apr 2009, Tarragone, Espagne, Springer, 5457, pp.10-19, 2009, Lecture Notes in Computer Science (LNCS). <http://grammars.grlmc.com/LATA2009/>. <lirmm-00367086>
  • Philippe Gambette, Vincent Berry, Christophe Paul. The Structure of Level-k Phylogenetic Networks. CPM: Combinatorial Pattern Matching, Jun 2009, Lille, France. Springer Berlin / Heidelberg, 20th Annual Symposium on Combinatorial Pattern Matching, LNCS (5577), pp.289-300, 2009, <http://bioinfo.lifl.fr/cpm09/>. <10.1007/978-3-642-02441-2_26>. <lirmm-00371485>
  • Daniel Huson, Regula Rupp, Vincent Berry, Philippe Gambette, Christophe Paul. Computing Galled Networks from Real Data. ISMB/ECCB'09: 17th Annual Conference on Intelligent Systems for Molecular Biology & 8th European Conference on Computational Biology, Jun 2009, France. Oxford Journals, 25(12), pp.i85-i93, 2009, Bioinformatics. <http://www.iscb.org/ismbeccb2009/>. <10.1093/bioinformatics/btp217>. <lirmm-00368545v2>
  • Sylvain Guillemot, Vincent Berry. Fixed-parameter Tractability of the Maximum Agreement Supertree Problem. CPM: Combinatorial Pattern Matching, 2007, Montpellier, France. 18th Annual Combinatorial Pattern Matching Symposium, LNCS (4580), pp.274-285, 2007. <lirmm-00130406v2>
  • Vincent Berry, Vincent Ranwez, Pierre-Henri Fabre, Emmanuel Douzery. Votez veto pour l'Arbre de la Vie. A. Denise, P. Durrens, S. Robin, E. Rocha, A. de Daruvar, A. Groppi. JOBIM'06 : Journées Ouvertes Biologie, Informatique, Mathématiques, Jul 2006, Bordeaux, France, pp.251-263, 2006. <lirmm-00131866>
  • Vincent Berry, N. Francois, Sylvain Guillemot, Christophe Paul. On the Approximation of Computing Evolutionary Trees. Lusheng Wang. COCOON'05: 11th Annual International Conference on Computing and Combinatorics, 2005, pp.115-125, 2005, Lecture Notes in Computer Science. <lirmm-00106451>
  • Alexis Criscuolo, Vincent Berry, Emmanuel J.P. Douzery, Olivier Gascuel. SDM: Une Méthode de Distance Rapide pour les Etudes de Phylogénomique. G. Perrière; A. Guenoche; C. Geourjon. JOBIM: Journées Ouvertes Biologie, Informatique, Mathématiques, Jul 2005, Lyon, France. 6èmes Journées Ouvertes Biologie, Informatique, Mathématiques, pp.231-244, 2005. <lirmm-00106495>
  • Vincent Berry, François Nicolas. Maximum Agreement and Compatible Supertrees. CPM: Combinatorial Pattern Matching, 2004, Istanbul, Turkey. Springer Verlag, 15th Annual Symposium on Combinatorial Pattern Matching, LNCS (3109), pp.205-219, 2004, <10.1007/978-3-540-27801-6_15>. <lirmm-00108782>

Chapitre d'ouvrage2 documents

  • Vincent Berry. Maximum Compatible Tree. Ming-Yang Kao. Encyclopedia of Algorithms, Springer, 2016, Foundations of Computing. <lirmm-01264556>
  • Vincent Berry. Maximum Compatible Tree. Ming-Yang Kao. Encyclopedia of Algorithms, Springer, pp.499-502, 2008, Foundations of Computing, 978-0-387-30770-1. <10.1007/978-0-387-30162-4_223>. <lirmm-00324061>

Rapport6 documents

  • Sylvain Guillemot, Vincent Berry. Finding a Largest Subset of Rooted Triples Identifying a Tree is an NP-hard task. RR-07010, 2007, pp.7. <lirmm-00143208>
  • Vincent Berry. Improving the Reduction from the Constrained to the Unconstrained MAST. 05041, 2005, pp.2. <lirmm-00106642>
  • Vincent Berry, François Nicolas. Approximating the Maximum Compatible Tree. 05019, 2005. <lirmm-00106626>
  • Vincent Berry. Super-Arbre d'Accord Maximum. 03040, 2003, pp.5. <lirmm-00269757>
  • Vincent Berry. Super-arbre d'Accord Maximum. 03040, 2003, pp.5. <lirmm-00269481>
  • Vincent Berry. Super-Arbre d'Accord Maximum. 03040, 2003, pp.5. <lirmm-00191964>

HDR1 document

  • Vincent Berry. On building and comparing trees
    Application to supertrees in phylogenetics. Informatique [cs]. Université Montpellier II - Sciences et Techniques du Languedoc, 2008. <tel-00360926>