@article{6819, abstract = {Glyphosate (N-phosphonomethyl glycine) and its commercial herbicide formulations have been shown to exert toxicity via various mechanisms. It has been asserted that glyphosate substitutes for glycine in polypeptide chains leading to protein misfolding and toxicity. However, as no direct evidence exists for glycine to glyphosate substitution in proteins, including in mammalian organisms, we tested this claim by conducting a proteomics analysis of MDA-MB-231 human breast cancer cells grown in the presence of 100 mg/L glyphosate for 6 days. Protein extracts from three treated and three untreated cell cultures were analysed as one TMT-6plex labelled sample, to highlight a specific pattern (+/+/+/−/−/−) of reporter intensities for peptides bearing true glyphosate treatment induced-post translational modifications as well as allowing an investigation of the total proteome.}, author = {Antoniou, Michael N. and Nicolas, Armel and Mesnage, Robin and Biserni, Martina and Rao, Francesco V. and Martin, Cristina Vazquez}, issn = {1756-0500}, journal = {BMC Research Notes}, publisher = {BioMed Central}, title = {{Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells}}, doi = {10.1186/s13104-019-4534-3}, volume = {12}, year = {2019}, } @misc{9784, abstract = {Additional file 1: Table S1. Kinetics of MDA-MB-231 cell growth in either the presence or absence of 100Â mg/L glyphosate. Cell counts are given at day-1 of seeding flasks and following 6-days of continuous culture. Note: no differences in cell numbers were observed between negative control and glyphosate treated cultures.}, author = {Antoniou, Michael N. and Nicolas, Armel and Mesnage, Robin and Biserni, Martina and Rao, Francesco V. and Martin, Cristina Vazquez}, publisher = {Springer Nature}, title = {{MOESM1 of Glyphosate does not substitute for glycine in proteins of actively dividing mammalian cells}}, doi = {10.6084/m9.figshare.9411761.v1}, year = {2019}, } @misc{9839, abstract = {More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range.}, author = {Polechova, Jitka}, publisher = {Dryad}, title = {{Data from: Is the sky the limit? On the expansion threshold of a species' range}}, doi = {10.5061/dryad.5vv37}, year = {2019}, } @article{8418, abstract = {For the Restricted Circular Planar 3 Body Problem, we show that there exists an open set U in phase space of fixed measure, where the set of initial points which lead to collision is O(μ120) dense as μ→0.}, author = {Guardia, Marcel and Kaloshin, Vadim and Zhang, Jianlu}, issn = {0003-9527}, journal = {Archive for Rational Mechanics and Analysis}, keywords = {Mechanical Engineering, Mathematics (miscellaneous), Analysis}, number = {2}, pages = {799--836}, publisher = {Springer Nature}, title = {{Asymptotic density of collision orbits in the Restricted Circular Planar 3 Body Problem}}, doi = {10.1007/s00205-019-01368-7}, volume = {233}, year = {2019}, } @article{8416, abstract = {In this paper, we show that any smooth one-parameter deformations of a strictly convex integrable billiard table Ω0 preserving the integrability near the boundary have to be tangent to a finite dimensional space passing through Ω0.}, author = {Huang, Guan and Kaloshin, Vadim}, issn = {1609-4514}, journal = {Moscow Mathematical Journal}, number = {2}, pages = {307--327}, publisher = {American Mathematical Society}, title = {{On the finite dimensionality of integrable deformations of strictly convex integrable billiard tables}}, doi = {10.17323/1609-4514-2019-19-2-307-327}, volume = {19}, year = {2019}, } @article{8693, abstract = {We review V. I. Arnold’s 1963 celebrated paper [1] Proof of A. N. Kolmogorov’s Theorem on the Conservation of Conditionally Periodic Motions with a Small Variation in the Hamiltonian, and prove that, optimising Arnold’s scheme, one can get “sharp” asymptotic quantitative conditions (as ε → 0, ε being the strength of the perturbation). All constants involved are explicitly computed.}, author = {Chierchia, Luigi and Koudjinan, Edmond}, journal = {Regular and Chaotic Dynamics}, pages = {583–606}, publisher = {Springer}, title = {{V. I. Arnold’s “pointwise” KAM theorem}}, doi = {10.1134/S1560354719060017}, volume = {24}, year = {2019}, } @article{9018, abstract = {Anti-silencing function 1 (ASF1) is a conserved H3-H4 histone chaperone involved in histone dynamics during replication, transcription, and DNA repair. Overexpressed in proliferating tissues including many tumors, ASF1 has emerged as a promising therapeutic target. Here, we combine structural, computational, and biochemical approaches to design peptides that inhibit the ASF1-histone interaction. Starting from the structure of the human ASF1-histone complex, we developed a rational design strategy combining epitope tethering and optimization of interface contacts to identify a potent peptide inhibitor with a dissociation constant of 3 nM. When introduced into cultured cells, the inhibitors impair cell proliferation, perturb cell-cycle progression, and reduce cell migration and invasion in a manner commensurate with their affinity for ASF1. Finally, we find that direct injection of the most potent ASF1 peptide inhibitor in mouse allografts reduces tumor growth. Our results open new avenues to use ASF1 inhibitors as promising leads for cancer therapy.}, author = {Bakail, May M and Gaubert, Albane and Andreani, Jessica and Moal, Gwenaëlle and Pinna, Guillaume and Boyarchuk, Ekaterina and Gaillard, Marie-Cécile and Courbeyrette, Regis and Mann, Carl and Thuret, Jean-Yves and Guichard, Bérengère and Murciano, Brice and Richet, Nicolas and Poitou, Adeline and Frederic, Claire and Le Du, Marie-Hélène and Agez, Morgane and Roelants, Caroline and Gurard-Levin, Zachary A. and Almouzni, Geneviève and Cherradi, Nadia and Guerois, Raphael and Ochsenbein, Françoise}, issn = {2451-9456}, journal = {Cell Chemical Biology}, keywords = {Clinical Biochemistry, Molecular Medicine, Biochemistry, Molecular Biology, Pharmacology, Drug Discovery}, number = {11}, pages = {1573--1585.e10}, publisher = {Elsevier}, title = {{Design on a rational basis of high-affinity peptides inhibiting the histone chaperone ASF1}}, doi = {10.1016/j.chembiol.2019.09.002}, volume = {26}, year = {2019}, } @article{9530, abstract = {Background DNA methylation of active genes, also known as gene body methylation, is found in many animal and plant genomes. Despite this, the transcriptional and developmental role of such methylation remains poorly understood. Here, we explore the dynamic range of DNA methylation in honey bee, a model organism for gene body methylation. Results Our data show that CG methylation in gene bodies globally fluctuates during honey bee development. However, these changes cause no gene expression alterations. Intriguingly, despite the global alterations, tissue-specific CG methylation patterns of complete genes or exons are rare, implying robust maintenance of genic methylation during development. Additionally, we show that CG methylation maintenance fluctuates in somatic cells, while reaching maximum fidelity in sperm cells. Finally, unlike universally present CG methylation, we discovered non-CG methylation specifically in bee heads that resembles such methylation in mammalian brain tissue. Conclusions Based on these results, we propose that gene body CG methylation can oscillate during development if it is kept to a level adequate to preserve function. Additionally, our data suggest that heightened non-CG methylation is a conserved regulator of animal nervous systems.}, author = {Harris, Keith D. and Lloyd, James P. B. and Domb, Katherine and Zilberman, Daniel and Zemach, Assaf}, issn = {1756-8935}, journal = {Epigenetics and Chromatin}, publisher = {Springer Nature}, title = {{DNA methylation is maintained with high fidelity in the honey bee germline and exhibits global non-functional fluctuations during somatic development}}, doi = {10.1186/s13072-019-0307-4}, volume = {12}, year = {2019}, } @article{9586, abstract = {Consider integers 𝑘,ℓ such that 0⩽ℓ⩽(𝑘2) . Given a large graph 𝐺 , what is the fraction of 𝑘 -vertex subsets of 𝐺 which span exactly ℓ edges? When 𝐺 is empty or complete, and ℓ is zero or (𝑘2) , this fraction can be exactly 1. On the other hand, if ℓ is far from these extreme values, one might expect that this fraction is substantially smaller than 1. This was recently proved by Alon, Hefetz, Krivelevich, and Tyomkyn who initiated the systematic study of this question and proposed several natural conjectures. Let ℓ∗=min{ℓ,(𝑘2)−ℓ} . Our main result is that for any 𝑘 and ℓ , the fraction of 𝑘 -vertex subsets that span ℓ edges is at most log𝑂(1)(ℓ∗/𝑘)√ 𝑘/ℓ∗, which is best-possible up to the logarithmic factor. This improves on multiple results of Alon, Hefetz, Krivelevich, and Tyomkyn, and resolves one of their conjectures. In addition, we also make some first steps towards some analogous questions for hypergraphs. Our proofs involve some Ramsey-type arguments, and a number of different probabilistic tools, such as polynomial anticoncentration inequalities, hypercontractivity, and a coupling trick for random variables defined on a ‘slice’ of the Boolean hypercube.}, author = {Kwan, Matthew Alan and Sudakov, Benny and Tran, Tuan}, issn = {1469-7750}, journal = {Journal of the London Mathematical Society}, number = {3}, pages = {757--777}, publisher = {Wiley}, title = {{Anticoncentration for subgraph statistics}}, doi = {10.1112/jlms.12192}, volume = {99}, year = {2019}, } @article{9580, abstract = {An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut of size m/2+Ω)(m−−√) and this is best possible. That is, there exist cuts which exceed the expected size of a random cut by some multiple of the standard deviation. We study analogues of this and related results in hypergraphs. First, we observe that similarly to graphs, every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m−−√) larger than the expected size of a random r-cut. Moreover, in the case where k = 3 and r = 2 this bound is best possible and is attained by Steiner triple systems. Surprisingly, for all other cases (that is, if k ≥ 4 or r ≥ 3), we show that every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m5/9) larger than the expected size of a random r-cut. This is a significant difference in behaviour, since the amount by which the size of the largest cut exceeds the expected size of a random cut is now considerably larger than the standard deviation.}, author = {Conlon, David and Fox, Jacob and Kwan, Matthew Alan and Sudakov, Benny}, issn = {1565-8511}, journal = {Israel Journal of Mathematics}, number = {1}, pages = {67--111}, publisher = {Springer}, title = {{Hypergraph cuts above the average}}, doi = {10.1007/s11856-019-1897-z}, volume = {233}, year = {2019}, } @article{9585, abstract = {An n-vertex graph is called C-Ramsey if it has no clique or independent set of size C log n. All known constructions of Ramsey graphs involve randomness in an essential way, and there is an ongoing line of research towards showing that in fact all Ramsey graphs must obey certain “richness” properties characteristic of random graphs. More than 25 years ago, Erdős, Faudree and Sós conjectured that in any C-Ramsey graph there are Ω(n^5/2) induced subgraphs, no pair of which have the same numbers of vertices and edges. Improving on earlier results of Alon, Balogh, Kostochka and Samotij, in this paper we prove this conjecture.}, author = {Kwan, Matthew Alan and Sudakov, Benny}, issn = {1088-6850}, journal = {Transactions of the American Mathematical Society}, number = {8}, pages = {5571--5594}, publisher = {American Mathematical Society}, title = {{Proof of a conjecture on induced subgraphs of Ramsey graphs}}, doi = {10.1090/tran/7729}, volume = {372}, year = {2019}, } @article{9677, abstract = {Progress in the atomic-scale modeling of matter over the past decade has been tremendous. This progress has been brought about by improvements in methods for evaluating interatomic forces that work by either solving the electronic structure problem explicitly, or by computing accurate approximations of the solution and by the development of techniques that use the Born–Oppenheimer (BO) forces to move the atoms on the BO potential energy surface. As a consequence of these developments it is now possible to identify stable or metastable states, to sample configurations consistent with the appropriate thermodynamic ensemble, and to estimate the kinetics of reactions and phase transitions. All too often, however, progress is slowed down by the bottleneck associated with implementing new optimization algorithms and/or sampling techniques into the many existing electronic-structure and empirical-potential codes. To address this problem, we are thus releasing a new version of the i-PI software. This piece of software is an easily extensible framework for implementing advanced atomistic simulation techniques using interatomic potentials and forces calculated by an external driver code. While the original version of the code (Ceriotti et al., 2014) was developed with a focus on path integral molecular dynamics techniques, this second release of i-PI not only includes several new advanced path integral methods, but also offers other classes of algorithms. In other words, i-PI is moving towards becoming a universal force engine that is both modular and tightly coupled to the driver codes that evaluate the potential energy surface and its derivatives.}, author = {Kapil, Venkat and Rossi, Mariana and Marsalek, Ondrej and Petraglia, Riccardo and Litman, Yair and Spura, Thomas and Cheng, Bingqing and Cuzzocrea, Alice and Meißner, Robert H. and Wilkins, David M. and Helfrecht, Benjamin A. and Juda, Przemysław and Bienvenue, Sébastien P. and Fang, Wei and Kessler, Jan and Poltavsky, Igor and Vandenbrande, Steven and Wieme, Jelle and Corminboeuf, Clemence and Kühne, Thomas D. and Manolopoulos, David E. and Markland, Thomas E. and Richardson, Jeremy O. and Tkatchenko, Alexandre and Tribello, Gareth A. and Van Speybroeck, Veronique and Ceriotti, Michele}, issn = {0010-4655}, journal = {Computer Physics Communications}, pages = {214--223}, publisher = {Elsevier}, title = {{i-PI 2.0: A universal force engine for advanced molecular simulations}}, doi = {10.1016/j.cpc.2018.09.020}, volume = {236}, year = {2019}, } @article{9680, abstract = {Atomistic modeling of phase transitions, chemical reactions, or other rare events that involve overcoming high free energy barriers usually entails prohibitively long simulation times. Introducing a bias potential as a function of an appropriately chosen set of collective variables can significantly accelerate the exploration of phase space, albeit at the price of distorting the distribution of microstates. Efficient reweighting to recover the unbiased distribution can be nontrivial when employing adaptive sampling techniques such as metadynamics, variationally enhanced sampling, or parallel bias metadynamics, in which the system evolves in a quasi-equilibrium manner under a time-dependent bias. We introduce an iterative unbiasing scheme that makes efficient use of all the trajectory data and that does not require the distribution to be evaluated on a grid. The method can thus be used even when the bias has a high dimensionality. We benchmark this approach against some of the existing schemes on model systems with different complexity and dimensionality.}, author = {Giberti, F. and Cheng, Bingqing and Tribello, G. A. and Ceriotti, M.}, issn = {1549-9626}, journal = {Journal of Chemical Theory and Computation}, number = {1}, pages = {100--107}, publisher = {American Chemical Society}, title = {{Iterative unbiasing of quasi-equilibrium sampling}}, doi = {10.1021/acs.jctc.9b00907}, volume = {16}, year = {2019}, } @article{12600, abstract = {The snow cover dynamics of High Mountain Asia are usually assessed at spatial resolutions of 250 m or greater, but this scale is too coarse to clearly represent the rugged topography common to the region. Higher-resolution measurement of snow-covered area often results in biased sampling due to cloud cover and deep shadows. We therefore develop a Normalized Difference Snow Index-based workflow to delineate snow lines from Landsat Thematic Mapper/Enhanced Thematic Mapper+ imagery and apply it to the upper Langtang Valley in Nepal, processing 194 scenes spanning 1999 to 2013. For each scene, we determine the spatial distribution of snow line altitudes (SLAs) with respect to aspect and across six subcatchments. Our results show that the mean SLA exhibits distinct seasonal behavior based on aspect and subcatchment position. We find that SLA dynamics respond to spatial and seasonal trade-offs in precipitation, temperature, and solar radiation, which act as primary controls. We identify two SLA spatial gradients, which we attribute to the effect of spatially variable precipitation. Our results also reveal that aspect-related SLA differences vary seasonally and are influenced by solar radiation. In terms of seasonal dominant controls, we demonstrate that the snow line is controlled by snow precipitation in winter, melt in premonsoon, a combination of both in postmonsoon, and temperature in monsoon, explaining to a large extent the spatial and seasonal variability of the SLA in the upper Langtang Valley. We conclude that while SLA and snow-covered area are complementary metrics, the SLA has a strong potential for understanding local-scale snow cover dynamics and their controlling mechanisms.}, author = {Girona‐Mata, Marc and Miles, Evan S. and Ragettli, Silvan and Pellicciotti, Francesca}, issn = {1944-7973}, journal = {Water Resources Research}, keywords = {Water Science and Technology}, number = {8}, pages = {6754--6772}, publisher = {American Geophysical Union}, title = {{High‐resolution snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment}}, doi = {10.1029/2019wr024935}, volume = {55}, year = {2019}, } @article{12602, abstract = {This study aims at developing and applying a spatially-distributed coupled glacier mass balance and ice-flow model to attribute the response of glaciers to natural and anthropogenic climate change. We focus on two glaciers with contrasting surface characteristics: a debris-covered glacier (Langtang Glacier in Nepal) and a clean-ice glacier (Hintereisferner in Austria). The model is applied from the end of the Little Ice Age (1850) to the present-day (2016) and is forced with four bias-corrected General Circulation Models (GCMs) from the historical experiment of the CMIP5 archive. The selected GCMs represent region-specific warm-dry, warm-wet, cold-dry, and cold-wet climate conditions. To isolate the effects of anthropogenic climate change on glacier mass balance and flow runs from these GCMs with and without further anthropogenic forcing after 1970 until 2016 are selected. The outcomes indicate that both glaciers experience the largest reduction in area and volume under warm climate conditions, whereas area and volume reductions are smaller under cold climate conditions. Simultaneously with changes in glacier area and volume, surface velocities generally decrease over time. Without further anthropogenic forcing the results reveal a 3% (9%) smaller decline in glacier area (volume) for the debris-covered glacier and a 18% (39%) smaller decline in glacier area (volume) for the clean-ice glacier. The difference in the magnitude between the two glaciers can mainly be attributed to differences in the response time of the glaciers, where the clean-ice glacier shows a much faster response to climate change. We conclude that the response of the two glaciers can mainly be attributed to anthropogenic climate change and that the impact is larger on the clean-ice glacier. The outcomes show that the model performs well under different climate conditions and that the developed approach can be used for regional-scale glacio-hydrological modeling.}, author = {Wijngaard, René R. and Steiner, Jakob F. and Kraaijenbrink, Philip D. A. and Klug, Christoph and Adhikari, Surendra and Banerjee, Argha and Pellicciotti, Francesca and van Beek, Ludovicus P. H. and Bierkens, Marc F. P. and Lutz, Arthur F. and Immerzeel, Walter W.}, issn = {2296-6463}, journal = {Frontiers in Earth Science}, publisher = {Frontiers Media}, title = {{Modeling the response of the Langtang Glacier and the Hintereisferner to a changing climate since the Little Ice Age}}, doi = {10.3389/feart.2019.00143}, volume = {7}, year = {2019}, } @article{12601, abstract = {Ice cliffs and ponds on debris-covered glaciers have received increased attention due to their role in amplifying local melt. However, very few studies have looked at these features on the catchment scale to determine their patterns and changes in space and time. We have compiled a detailed inventory of cliffs and ponds in the Langtang catchment, central Himalaya, from six high-resolution satellite orthoimages and DEMs between 2006 and 2015, and a historic orthophoto from 1974. Cliffs cover between 1.4% (± 0.4%) in the dry and 3.4% (± 0.9%) in the wet seasons and ponds between 0.6% (± 0.1%) and 1.6% (± 0.3%) of the total debris-covered tongues. We find large variations between seasons, as cliffs and ponds tend to grow in the wetter monsoon period, but there is no obvious trend in total area over the study period. The inventory further shows that cliffs are predominately north-facing irrespective of the glacier flow direction. Both cliffs and ponds appear in higher densities several hundred metres from the terminus in areas where tributaries reach the main glacier tongue. On the largest glacier in the catchment ~10% of all cliffs and ponds persisted over nearly a decade.}, author = {STEINER, JAKOB F. and BURI, PASCAL and MILES, EVAN S. and RAGETTLI, SILVAN and Pellicciotti, Francesca}, issn = {1727-5652}, journal = {Journal of Glaciology}, number = {252}, pages = {617--632}, publisher = {Cambridge University Press}, title = {{Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and characteristics}}, doi = {10.1017/jog.2019.40}, volume = {65}, year = {2019}, } @article{12192, abstract = {Transposable elements (TEs), the movement of which can damage the genome, are epigenetically silenced in eukaryotes. Intriguingly, TEs are activated in the sperm companion cell – vegetative cell (VC) – of the flowering plant Arabidopsis thaliana. However, the extent and mechanism of this activation are unknown. Here we show that about 100 heterochromatic TEs are activated in VCs, mostly by DEMETER-catalyzed DNA demethylation. We further demonstrate that DEMETER access to some of these TEs is permitted by the natural depletion of linker histone H1 in VCs. Ectopically expressed H1 suppresses TEs in VCs by reducing DNA demethylation and via a methylation-independent mechanism. We demonstrate that H1 is required for heterochromatin condensation in plant cells and show that H1 overexpression creates heterochromatic foci in the VC progenitor cell. Taken together, our results demonstrate that the natural depletion of H1 during male gametogenesis facilitates DEMETER-directed DNA demethylation, heterochromatin relaxation, and TE activation.}, author = {He, Shengbo and Vickers, Martin and Zhang, Jingyi and Feng, Xiaoqi}, issn = {2050-084X}, journal = {eLife}, keywords = {General Immunology and Microbiology, General Biochemistry, Genetics and Molecular Biology, General Medicine, General Neuroscience}, publisher = {eLife Sciences Publications, Ltd}, title = {{Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation}}, doi = {10.7554/elife.42530}, volume = {8}, year = {2019}, } @unpublished{8305, abstract = {In this paper, we present the first fully asynchronous distributed key generation (ADKG) algorithm as well as the first distributed key generation algorithm that can create keys with a dual (f,2f+1)−threshold that are necessary for scalable consensus (which so far needs a trusted dealer assumption). In order to create a DKG with a dual (f,2f+1)− threshold we first answer in the affirmative the open question posed by Cachin et al. how to create an AVSS protocol with recovery thresholds f+1