The Internet Archive has a preservation copy of this work in our general collections.
The file type is
American Art News
Patrick Vincent Berry. Patrick Vincent Berry, or as he was better known in the art world, and as he signed his pictures, P. V. Berry, passed away after a painful illness at St. ... Berry is survived by three sisters and one brother, Mr. John D. Berry of Brooklyn, Miss J. Berry, MVIiss Mary Berry and Mlrs. T. Slatterv of New York. Helen WV. ...fatcat:brl6rue6tbabxishvhz7oshyle
Vincent Berry, L’expérience virtuelle. ... Vincent Berry , L'expérience virtuelle . ...doi:10.4000/lectures.18211 fatcat:wyjatnqqcjgfpjxipnalxthaae
Introduction Les Mondes du jeu Vincent Berry et Manouk Borzakian Le jeu : un objet des sciences humaines et sociales 1 Dans la lignée, plus ou moins critique, de Johan Huizinga (1951 Huizinga ( [1938 ... La relation que le jeu vidéo entretient avec le monde du jouet et du jeu de société est tout aussi importante (Berry, 2011 ; Sidre, 2014) , au regard, notamment, de la place prépondérante des distributeurs ... » AUTEURS VINCENT BERRY Université Paris 13, EXPERICE MANOUK BORZAKIAN École Polytechnique Fédérale de Lausanne ...doi:10.4000/reset.541 fatcat:vm767vsrwnhkxpsa2ajf4wimne
Introduction Game Worlds Vincent Berry and Manouk Borzakian The game: a Social Sciences and Humanities object 1 Following, in a more or less critical way, Johan Huizinga (1980 Huizinga ( [1949 )'s ...doi:10.4000/reset.545 fatcat:lakyfweprzbajbgndvm3ya63hu
Encyclopedia of Algorithms
Encyclopedia of Algorithms
Maximum Compatible Tree (2001; Ganapathy,Warnow) Vincent Berry, lirmm, univ. montpellier ii -cnrs, www.lirmm.fr/˜vberry entry editor: Vincent Berry INDEX TERMS: Trees, Phylogenetics, Maximum Compatible ...doi:10.1007/978-3-642-27848-8_223-2 fatcat:pbsrvythtjdjrilf73rpwi6xta
Encyclopedia of Algorithms
Maximum Compatible Tree (2001; Ganapathy,Warnow) Vincent Berry, lirmm, univ. montpellier ii -cnrs, www.lirmm.fr/˜vberry entry editor: Vincent Berry INDEX TERMS: Trees, Phylogenetics, Maximum Compatible ...doi:10.1007/978-0-387-30162-4_223 fatcat:6sayl2esdjblnbff46fn6b5jz4
IP address: 184.108.40.206, on 25 Jul 2018 at 09:56:24, subject to the JOHN BERRY Since Silent Spring, by Frank Graham Jnr. Hamish Hamilton, 40s. ... In A Continent in Danger, published in 1966, Vincent Serventy warned that many of Australia's unique plants and animals might be threatened with extinction, and in this latest work he repeats his warning ...doi:10.1017/s0030605300009248 fatcat:wwurcxxzinhejmlhmsr7lmcw6a
Supertree methods combine phylogenies with overlapping sets of taxa into a larger one. Topological conflicts frequently arise among source trees for methodological or biological reasons, such as long branch attraction, lateral gene transfers, gene duplication/loss or deep gene coalescence. When topological conflicts occur among source trees, liberal methods infer supertrees containing the most frequent alternative, while veto methods infer supertrees not contradicting any source tree, i.e.doi:10.1186/1471-2105-9-413 pmid:18834542 pmcid:PMC2576265 fatcat:i45rqwpe5ngpnmjh3h7hsq3sgy
more »... rd all conflicting resolutions. When the source trees host a significant number of topological conflicts or have a small taxon overlap, supertree methods of both kinds can propose poorly resolved, hence uninformative, supertrees. Results: To overcome this problem, we propose to infer non-plenary supertrees, i.e. supertrees that do not necessarily contain all the taxa present in the source trees, discarding those whose position greatly differs among source trees or for which insufficient information is provided. We detail a variant of the PhySIC veto method called PhySIC IST that can infer non-plenary supertrees. PhySIC IST aims at inferring supertrees that satisfy the same appealing theoretical properties as with PhySIC, while being as informative as possible under this constraint. The informativeness of a supertree is estimated using a variation of the CIC (Cladistic Information Content) criterion, that takes into account both the presence of multifurcations and the absence of some taxa. Additionally, we propose a statistical preprocessing step called STC (Source Trees Correction) to correct the
Lecture Notes in Computer Science
Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of some labels, i.e. species. Inferring a species tree from a set of multi-labeled gene trees (MUL trees) is a wellknown problem in computational biology. We propose a novel approach to tackle this problem, mainly to transform a collection of MUL trees into a collection of evolutionary trees, each containing single copies of labels.doi:10.1007/978-3-642-00982-2_60 fatcat:hiam42c3lngrbjsrktq3h6e7ty
more »... o that aim, we provide several algorithmic building stones and describe how they fit within a general species tree inference process. Most algorithms have a linear-time complexity, except for an FPT algorithm proposed for a problem that we show to be intractable.
Moreover, the time evolution of Berry curvature and polarization induced by shaking is purely dynamical. ... These findings suggest that the present lattice shaking scheme provides a versatile platform for the investigation of the orbital physics and the dynamical Berry curvature. ... t) = i u sk (r, t) |∇ k |u sk (r, t) is the dynamical Berry connection. ...arXiv:2012.01822v1 fatcat:23gicx5blvdmbdumcwrbekfwqm
Collaborative tools are of great help in conducting projects involving distant workers. Recent web technologies have helped to build such tools for jointly editing office documents and scientific data, yet none are available for handling phylogenies. Though a large number of studies and projects in evolutionary biology and systematics involve collaborations between scientists of different institutes, current tree comparison visualization software and websites are directed toward single-userdoi:10.1186/s12862-014-0253-5 pmid:25496383 pmcid:PMC4271409 fatcat:ddq7tzg4tvfyzgknvgqfeqirje
more »... ss. Moreover, tree comparison functionalities are dispersed between different software that mainly focus on high level single tree visualization but to the detriment of basic tree comparison features. Results: The web platform presented here, named CompPhy, intends to fill this gap by allowing collaborative work on phylogenies and by gathering simple advanced tools dedicated to tree comparison. It offers functionalities for tree edition, tree comparison, supertree inference and data management in a collaborative environment. The latter aspect is a specific feature of the platform, allowing people located in different places to work together at the same time on a common project. CompPhy thus proposes shared tree visualization, both synchronous and asynchronous tree manipulation, data exchange/storage, as well as facilities to keep track of the progress of analyses in working sessions. Specific advanced comparison tools are also available, such as consensus and supertree inference, or automated branch swaps of compared trees. As projects can be readily created and shared, CompPhy is also a tool that can be used easily to interact with students in a educational setting, either in the classroom or for assignments. Conclusions: CompPhy is the first web platform devoted to the comparison of phylogenetic trees allowing real-time distant collaboration on a phylogenetic/phylogenomic project. This application can be accessed freely with a recent browser at the following page of the ATGC bioinformatics platform: http://www.atgc-montpellier.fr/compphy/.
Comparative genomic studies are often conducted by reconciliation analyses comparing gene and species trees. One of the issues with reconciliation approaches is that an exponential number of optimal scenarios is possible. The resulting complexity is masked by the fact that a majority of reconciliation software pick up a random optimal solution that is returned to the end-user. However, the alternative solutions should not be ignored since they tell different stories that parsimony considers asdoi:10.1142/s0219720012500254 pmid:23600816 fatcat:a734n3somne3dnnpedmdyfsg7q
more »... iable as the output solution. In this paper we describe a polynomial space and time algorithm to build a minimum reconciliation graph -a graph that summarizes the set of all most parsimonious reconciliations. Amongst numerous applications, it is shown how this graph allows counting the number of non-equivalent most parsimonious reconciliations.
Lecture Notes in Computer Science
. * Corresponding author Email address: email@example.com (Vincent Berry). ...doi:10.1007/978-3-540-27801-6_15 fatcat:hchjnoadnber7feo45i55l3puu
Sciences du jeu
INDEX Mots-clés : jeu de société, sociologie des pratiques, évolution des publics Keywords : board game, sociology of practices, evolution of audiences AUTEUR VINCENT BERRY Experice, Université Sorbonne ... Le « succès mondial » du plus célèbre des jeux des Frères Parker se révèle selon les géographes « un excellent indicateur des (Whitehill, 1992)e de Vincent Berry et Samuel Coavoux propose un cadrage ...doi:10.4000/sdj.2796 fatcat:4yqab3lx3zdbnbqahwnpdfasvm
« Previous Showing results 1 — 15 out of 13,941 results