default search action
Vincent Berry
Person information
- affiliation: LIRMM Montpellier, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Vincent Berry, Arnaud Castelltort, Benoit Lange, Joan Teriihoania, Chouki Tibermacine, Catia Trubiani:
Is it Worth Migrating a Monolith to Microservices? An Experience Report on Performance, Availability and Energy Usage. ICWS 2024: 944-954 - 2022
- [c18]Jeremiah J. Blanchard
, John R. Hott
Stop Reinventing the Wheel! Promoting Community Software in Computing Education. ITiCSE-WGR 2022: 261-292 - [c17]Vincent Berry
ShellOnYou: Learning by Doing Unix Command Line. ITiCSE (1) 2022: 379-385 - [c16]Jeremiah J. Blanchard
Leveraging Community Software in CS Education to Avoid Reinventing the Wheel. ITiCSE (2) 2022: 580-581 - 2021
- [j20]Charles-Elie Rabier, Vincent Berry
On the inference of complex phylogenetic networks by Markov Chain Monte-Carlo. PLoS Comput. Biol. 17(9) (2021) - 2020
- [c15]Vincent Berry
Scanning Phylogenetic Networks Is NP-hard. SOFSEM 2020: 519-530
2010 – 2019
- 2018
- [j19]Wandrille Duchemin
RecPhyloXML: a format for reconciled gene trees. Bioinform. 34(21): 3646-3652 (2018) - 2016
- [j18]François Chevenet
SylvX: a viewer for phylogenetic tree reconciliations. Bioinform. 32(4): 608-610 (2016) - [r2]Vincent Berry:
Maximum Compatible Tree. Encyclopedia of Algorithms 2016: 1230-1234 - 2013
- [j17]Thi Hau Nguyen, Vincent Ranwez
Reconciliation and local gene tree rearrangement can be of mutual profit. Algorithms Mol. Biol. 8: 12 (2013) - [j16]Céline Scornavacca, Wojciech Paprotny, Vincent Berry, Vincent Ranwez
Representing a Set of Reconciliations in a Compact Way. J. Bioinform. Comput. Biol. 11(2) (2013) - 2012
- [j15]Philippe Gambette
Quartets and Unrooted phylogenetic Networks. J. Bioinform. Comput. Biol. 10(4) (2012) - [c14]Thi Hau Nguyen, Jean-Philippe Doyon, Stéphanie Pointet, Anne-Muriel Arigon Chifolleau, Vincent Ranwez
Accounting for Gene Tree Uncertainties Improves Gene Trees and Reconciliation Inference. WABI 2012: 123-134 - 2011
- [j14]Jean-Philippe Doyon, Vincent Ranwez
Models, algorithms and programs for phylogeny reconciliation. Briefings Bioinform. 12(5): 392-400 (2011) - [j13]Céline Scornavacca, Vincent Berry
Building species trees from larger parts of phylogenomic databases. Inf. Comput. 209(3): 590-605 (2011) - 2010
- [j12]François Chevenet
ScripTree: scripting phylogenetic graphics. Bioinform. 26(8): 1125-1126 (2010) - [j11]Sylvain Guillemot, Vincent Berry:
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 7(2): 342-353 (2010) - [c13]Jean-Philippe Doyon, Céline Scornavacca, K. Yu. Gorbunov, Gergely J. Szöllosi
An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers. RECOMB-CG 2010: 93-108
2000 – 2009
- 2009
- [j10]Daniel H. Huson, Regula Rupp, Vincent Berry
Computing galled networks from real data. Bioinform. 25(12) (2009) - [j9]Sylvain Guillemot, François Nicolas, Vincent Berry
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems. Discret. Appl. Math. 157(7): 1555-1570 (2009) - [j8]Vincent Berry
Linear time 3-approximation for the MAST problem. ACM Trans. Algorithms 5(2): 23:1-23:18 (2009) - [c12]Philippe Gambette
The Structure of Level-k Phylogenetic Networks. CPM 2009: 289-300 - [c11]Céline Scornavacca, Vincent Berry
From Gene Trees to Species Trees through a Supertree Approach. LATA 2009: 702-714 - 2008
- [b1]Vincent Berry:
On building and comparing trees Application to supertrees in phylogenetics. Montpellier 2 University, France, 2008 - [j7]Vincent Berry, Zeshan Peng, H. F. Ting:
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time. Algorithmica 50(3): 369-385 (2008) - [j6]Céline Scornavacca, Vincent Berry
PhySIC_IST: cleaning source trees to infer more informative supertrees. BMC Bioinform. 9 (2008) - [r1]Vincent Berry
Maximum Compatible Tree. Encyclopedia of Algorithms 2008 - 2007
- [j5]R. R. K. Sharma, Vincent Berry:
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. 177(2): 803-812 (2007) - [j4]Vincent Berry
Maximum agreement and compatible supertrees. J. Discrete Algorithms 5(3): 564-591 (2007) - [c10]Sylvain Guillemot, Vincent Berry:
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem. CPM 2007: 274-285 - 2006
- [j3]Vincent Berry
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 3(3): 289-302 (2006) - 2005
- [c9]Vincent Berry
On the Approximation of Computing Evolutionary Trees. COCOON 2005: 115-125 - 2004
- [c8]Vincent Berry
Maximum Agreement and Compatible Supertrees (Extended Abstract). CPM 2004: 205-219 - 2001
- [j2]David Bryant, Vincent Berry:
A Structured Family of Clustering and Tree Construction Methods. Adv. Appl. Math. 27(4): 705-732 (2001) - 2000
- [j1]Vincent Berry, Olivier Gascuel:
Inferring evolutionary trees with strong combinatorial evidence. Theor. Comput. Sci. 240(2): 271-298 (2000) - [c7]Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang:
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). SODA 2000: 287-296
1990 – 1999
- 1999
- [c6]Vincent Berry, Tao Jiang
Quartet Cleaning: Improved Algorithms and Simulations. ESA 1999: 313-324 - [c5]Vincent Berry, David Bryant:
Faster reliable phylogenetic analysis. RECOMB 1999: 59-68 - 1997
- [c4]Vincent Berry, Olivier Gascuel:
Inferring Evolutionary Trees with Strong Combinatorial Evidence. COCOON 1997: 111-123 - 1995
- [c3]Vincent Berry, Philippe Ézéquel:
Évaluation répartie asynchrone de (certaines) requêtes DATALOG. JFPLC 1995: 405-407 - 1994
- [c2]Vincent Berry, Philippe Ézéquel:
Distinguer les variables distinguées. JFPLC 1994: 3-14 - 1993
- [c1]Vincent Berry, Philippe Ézéquel:
Generating Goals and Their Use In Recursive Query Processing. ILPS 1993: 649
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: