- 24
- 14
- 5
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
Vincent Berry
64
Documents
Publications
- 10
- 6
- 6
- 6
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 5
- 4
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 17
- 14
- 8
- 7
- 6
- 6
- 6
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 3
- 1
- 3
- 1
- 2
- 4
- 5
- 1
- 2
- 5
- 4
- 2
- 3
- 7
- 5
- 4
- 5
- 4
- 1
- 2
|
Is it Worth Migrating a Monolith to Microservices? An Experience Report on Performance, Availability and Energy UsageICWS 2024 - IEEE International Conference on Web Services, Jul 2024, Shenzhen, China. pp.944-954, ⟨10.1109/ICWS62655.2024.00112⟩
Conference papers
hal-04781943v1
|
|
Analyse des traces de consultations des ressources en ligne et de la réalisation des activité dans un module hybride en école d’ingénieurAIPU 2023 - 33e congrès de l'Association Internationale de Pédagogie Universitaire, Mar 2023, Perpignan, France
Conference papers
lirmm-04027971v1
|
|
ShellOnYou : Learning by Doing Unix Command LineITiCSE 2022 - 27th ACM Conference on on Innovation and Technology in Computer Science Education, Jul 2022, Dublin, Ireland. pp.379-385, ⟨10.1145/3502718.3524753⟩
Conference papers
halshs-03726175v1
|
|
Quand collaborer répond à une « urgence » : l'atout d'une structuration RéseauAIPU 2022 - 32e congrès de l'Association Internationale de Pédagogie Universitaire, May 2022, Rennes, France
Conference papers
lirmm-04028069v1
|
|
Stop Reinventing the Wheel! Promoting Community Software in Computing EducationITiCSE-WG 2022 - 27th ACM Conference on Innovation and Technology in Computer Science Education, Jul 2022, Dublin, Ireland. pp.261-292, ⟨10.1145/3571785.3574129⟩
Conference papers
lirmm-04025606v1
|
|
Scanning Phylogenetic Networks is NP-hardSOFSEM 2020 - 46th International Conference on Current Trends in Theory and Practice of Informatics, Jan 2020, Limassol, Cyprus. pp.519-530, ⟨10.1007/978-3-030-38919-2_42⟩
Conference papers
hal-02353161v3
|
|
Comment la reconstruction de génomes ancestraux peut aider à l'assemblage de génomes actuelsJournées Ouvertes Biologie Informatique Mathématiques, 2016, Lyon, France
Conference papers
hal-01394409v1
|
|
Accounting for gene tree uncertainty improves gene tree accuracy as well as duplications, transfers and losses predictions12th International Workshop on Algorithms in Bioinformatics (WABI 2012), Sep 2012, Ljubljana, Slovenia. pp.123-134, ⟨10.1007/978-3-642-33122-0_10⟩
Conference papers
hal-00718347v3
|
Phylogenetic reconstruction in Quercus based on multiple nuclear genesIUFRO working group “Genetics of Quercus and Nothofagus”, Institut National de Recherche Agronomique (INRA). UMR Biodiversité, Gènes et Communautés (1202)., Oct 2012, Bordeaux, France
Conference papers
hal-02804068v1
|
|
|
Un algorithme de parcimonie efficace pour la réconciliation d'arbres de gènes/espèces avec pertes, duplications et transfertsJournées Ouvertes en Biologie, Informatique et Mathématiques, Institut National d'Etudes Supérieures Agronomiques de Montpellier (Montpellier SupAgro). Montpellier, FRA., Sep 2010, Montpellier, France. pp.8
Conference papers
lirmm-00833164v1
|
|
The Structure of Level-k Phylogenetic NetworksCPM: Combinatorial Pattern Matching, Jun 2009, Lille, France. pp.289-300, ⟨10.1007/978-3-642-02441-2_26⟩
Conference papers
lirmm-00371485v1
|
|
From Gene Trees to Species Trees Through a Supertree ApproachLanguage and Automata Theory and Applications : LATA 2009, Apr 2009, Tarragona, Spain. pp.10-19, ⟨10.1007/978-3-642-00982-2_60⟩
Conference papers
lirmm-00367086v1
|
|
Fixed-parameter Tractability of the Maximum Agreement Supertree ProblemCPM: Combinatorial Pattern Matching, 2007, Montpellier, France. pp.274-285
Conference papers
lirmm-00130406v2
|
|
Votez veto pour l'Arbre de la VieJOBIM 2006 - 7es Journées Ouvertes en Biologie, Informatique et Mathématiques, Jul 2006, Bordeaux, France. pp.251-263
Conference papers
lirmm-00131866v1
|
|
On the Approximation of Computing Evolutionary TreesCOCOON: Computing and Combinatorics Conference, Aug 2005, Kunming, China. pp.115-125, ⟨10.1007/11533719_14⟩
Conference papers
lirmm-00106451v1
|
|
SDM: Une Méthode de Distance Rapide pour les Etudes de PhylogénomiqueJOBIM 2005 - 6es Journées Ouvertes en Biologie, Informatique et Mathématiques, Jul 2005, Lyon, France. pp.231-244
Conference papers
lirmm-00106495v1
|
|
Maximum Agreement and Compatible SupertreesCPM: Combinatorial Pattern Matching, 2004, Istanbul, Turkey. pp.205-219, ⟨10.1007/978-3-540-27801-6_15⟩
Conference papers
lirmm-00108782v1
|
|
On the inference of complex phylogenetic networks by Markov Chain Monte-CarloJOBIM 2020 - 20e Journées Ouvertes de Biologie, Informatique et Mathématique, Jun 2020, Montpellier, France.
Conference poster
lirmm-04027842v1
|
CompPhy v2 : une plate-forme collaborative pour visualiser et comparer des phylogéniesJOBIM: Journées ouvertes de biologie informatique et mathématiques, Jun 2016, Lyon, France. , 437 p., 2016, JOBIM 2016
Conference poster
hal-01594479v1
|
Maximum Compatible TreeMing-Yang Kao. Encyclopedia of Algorithms, Springer, 2016, Foundations of Computing, 978-1-4939-2863-7. ⟨10.1007/978-1-4939-2864-4⟩
Book sections
lirmm-01264556v1
|
|
|
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and TransfersEric Tannier. Comparative Genomics. RECOMB-CG 2010, LNCS (6398), Springer Berlin Heidelberg, pp.93-108, 2010, 978-3-642-16181-0. ⟨10.1007/978-3-642-16181-0_9⟩
Book sections
lirmm-00818889v1
|
|
Maximum Compatible TreeMing-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⟩
Book sections
lirmm-00324061v1
|
|
Multiomics analysis reveals B. MO1 as a distinct Babesia species and provides insights into its evolution and virulence2024
Preprints, Working Papers, ...
lirmm-04828058v1
|
|
CompPhy2: a flexible and real time collaborative web platform for editing and comparing phylogenies2018
Preprints, Working Papers, ...
hal-01885401v1
|
|
Finding a Largest Subset of Rooted Triples Identifying a Tree is an NP-hard taskRR-07010, 2007, pp.7
Reports
lirmm-00143208v1
|
Approximating the Maximum Compatible Tree05019, 2005
Reports
lirmm-00106626v1
|
|
Improving the Reduction from the Constrained to the Unconstrained MAST05041, 2005, pp.2
Reports
lirmm-00106642v1
|
|
|
Super-arbre d'Accord Maximum03040, 2003, pp.5
Reports
lirmm-00269481v1
|
|
Super-Arbre d'Accord Maximum03040, 2003, pp.5
Reports
lirmm-00191964v1
|
|
On building and comparing trees
|