TY - JOUR AB - The large majority of three-dimensional structures of biological macromolecules have been determined by X-ray diffraction of crystalline samples. High-resolution structure determination crucially depends on the homogeneity of the protein crystal. Overall ‘rocking’ motion of molecules in the crystal is expected to influence diffraction quality, and such motion may therefore affect the process of solving crystal structures. Yet, so far overall molecular motion has not directly been observed in protein crystals, and the timescale of such dynamics remains unclear. Here we use solid-state NMR, X-ray diffraction methods and μs-long molecular dynamics simulations to directly characterize the rigid-body motion of a protein in different crystal forms. For ubiquitin crystals investigated in this study we determine the range of possible correlation times of rocking motion, 0.1–100 μs. The amplitude of rocking varies from one crystal form to another and is correlated with the resolution obtainable in X-ray diffraction experiments. AU - Ma, Peixiang AU - Xue, Yi AU - Coquelle, Nicolas AU - Haller, Jens D. AU - Yuwen, Tairan AU - Ayala, Isabel AU - Mikhailovskii, Oleg AU - Willbold, Dieter AU - Colletier, Jacques-Philippe AU - Skrynnikov, Nikolai R. AU - Schanda, Paul ID - 8456 JF - Nature Communications KW - General Biochemistry KW - Genetics and Molecular Biology KW - General Physics and Astronomy KW - General Chemistry SN - 2041-1723 TI - Observing the overall rocking motion of a protein in a crystal VL - 6 ER - TY - JOUR AB - We review recent advances in methodologies to study microseconds‐to‐milliseconds exchange processes in biological molecules using magic‐angle spinning solid‐state nuclear magnetic resonance (MAS ssNMR) spectroscopy. The particularities of MAS ssNMR, as compared to solution‐state NMR, are elucidated using numerical simulations and experimental data. These simulations reveal the potential of MAS NMR to provide detailed insight into short‐lived conformations of biological molecules. Recent studies of conformational exchange dynamics in microcrystalline ubiquitin are discussed. AU - Ma, Peixiang AU - Schanda, Paul ID - 8457 IS - 3 JF - eMagRes SN - 9780470034590 TI - Conformational exchange processes in biological systems: Detection by solid-state NMR VL - 4 ER - TY - JOUR AB - The nature of factors governing the tempo and mode of protein evolution is a fundamental issue in evolutionary biology. Specifically, whether or not interactions between different sites, or epistasis, are important in directing the course of evolution became one of the central questions. Several recent reports have scrutinized patterns of long-term protein evolution claiming them to be compatible only with an epistatic fitness landscape. However, these claims have not yet been substantiated with a formal model of protein evolution. Here, we formulate a simple covarion-like model of protein evolution focusing on the rate at which the fitness impact of amino acids at a site changes with time. We then apply the model to the data on convergent and divergent protein evolution to test whether or not the incorporation of epistatic interactions is necessary to explain the data. We find that convergent evolution cannot be explained without the incorporation of epistasis and the rate at which an amino acid state switches from being acceptable at a site to being deleterious is faster than the rate of amino acid substitution. Specifically, for proteins that have persisted in modern prokaryotic organisms since the last universal common ancestor for one amino acid substitution approximately ten amino acid states switch from being accessible to being deleterious, or vice versa. Thus, molecular evolution can only be perceived in the context of rapid turnover of which amino acids are available for evolution. AU - Usmanova, Dinara AU - Ferretti, Luca AU - Povolotskaya, Inna AU - Vlasov, Peter AU - Kondrashov, Fyodor ID - 848 IS - 2 JF - Molecular Biology and Evolution TI - A model of substitution trajectories in sequence space and long-term protein evolution VL - 32 ER - TY - JOUR AB - In the present note we announce a proof of a strong form of Arnold diffusion for smooth convex Hamiltonian systems. Let ${\mathbb T}^2$ be a 2-dimensional torus and B2 be the unit ball around the origin in ${\mathbb R}^2$ . Fix ρ > 0. Our main result says that for a 'generic' time-periodic perturbation of an integrable system of two degrees of freedom $H_0(p)+\varepsilon H_1(\theta,p,t),\quad \ \theta\in {\mathbb T}^2,\ p\in B^2,\ t\in {\mathbb T}={\mathbb R}/{\mathbb Z}$ , with a strictly convex H0, there exists a ρ-dense orbit (θε, pε, t)(t) in ${\mathbb T}^2 \times B^2 \times {\mathbb T}$ , namely, a ρ-neighborhood of the orbit contains ${\mathbb T}^2 \times B^2 \times {\mathbb T}$ . Our proof is a combination of geometric and variational methods. The fundamental elements of the construction are the usage of crumpled normally hyperbolic invariant cylinders from [9], flower and simple normally hyperbolic invariant manifolds from [36] as well as their kissing property at a strong double resonance. This allows us to build a 'connected' net of three-dimensional normally hyperbolic invariant manifolds. To construct diffusing orbits along this net we employ a version of the Mather variational method [41] equipped with weak KAM theory [28], proposed by Bernard in [7]. AU - Kaloshin, Vadim AU - Zhang, K ID - 8498 IS - 8 JF - Nonlinearity KW - Mathematical Physics KW - General Physics and Astronomy KW - Applied Mathematics KW - Statistical and Nonlinear Physics SN - 0951-7715 TI - Arnold diffusion for smooth convex systems of two and a half degrees of freedom VL - 28 ER - TY - JOUR AB - We consider the cubic defocusing nonlinear Schrödinger equation in the two dimensional torus. Fix s>1. Recently Colliander, Keel, Staffilani, Tao and Takaoka proved the existence of solutions with s-Sobolev norm growing in time. We establish the existence of solutions with polynomial time estimates. More exactly, there is c>0 such that for any K≫1 we find a solution u and a time T such that ∥u(T)∥Hs≥K∥u(0)∥Hs. Moreover, the time T satisfies the polynomial bound 0−1. However, there are major spatial differences both between glaciers and within any single glacier, exhibiting a very distinct nonlinear mass-balance profile with elevation. Through analysis of surface velocities derived from Landsat ETM+ imagery, we show that thinning occurs in areas of low velocity and low slope. These areas are prone to a general, dynamic decay of surface features and to the development of supraglacial lakes and ice cliffs, which may be responsible for a considerable increase in overall glacier ablation. AU - Pellicciotti, Francesca AU - Stephan, Christa AU - Miles, Evan AU - Herreid, Sam AU - Immerzeel, Walter W. AU - Bolch, Tobias ID - 12628 IS - 226 JF - Journal of Glaciology KW - Earth-Surface Processes SN - 0022-1430 TI - Mass-balance changes of the debris-covered glaciers in the Langtang Himal, Nepal, from 1974 to 1999 VL - 61 ER - TY - JOUR AB - Air temperature is one of the most relevant input variables for snow and ice melt calculations. However, local meteorological conditions, complex topography, and logistical concerns in glacierized regions make the measuring and modeling of air temperature a difficult task. In this study, we investigate the spatial distribution of 2 m air temperature over mountain glaciers and propose a modification to an existing model to improve its representation. Spatially distributed meteorological data from Haut Glacier d'Arolla (Switzerland), Place (Canada), and Juncal Norte (Chile) Glaciers are used to examine approximate flow line temperatures during their respective ablation seasons. During warm conditions (off-glacier temperatures well above 0°C), observed air temperatures in the upper reaches of Place Glacier and Haut Glacier d'Arolla decrease down glacier along the approximate flow line. At Juncal Norte and Haut Glacier d'Arolla, an increase in air temperature is observed over the glacier tongue. While the temperature behavior over the upper part can be explained by the cooling effect of the glacier surface, the temperature increase over the glacier tongue may be caused by several processes induced by the surrounding warm atmosphere. In order to capture the latter effect, we add an additional term to the Greuell and Böhm (GB) thermodynamic glacier wind model. For high off-glacier temperatures, the modified GB model reduces root-mean-square error up to 32% and provides a new approach for distributing air temperature over mountain glaciers as a function of off-glacier temperatures and approximate glacier flow lines. AU - Ayala, A. AU - Pellicciotti, Francesca AU - Shea, J. M. ID - 12631 IS - 8 JF - Journal of Geophysical Research: Atmospheres KW - Space and Planetary Science KW - Earth and Planetary Sciences (miscellaneous) KW - Atmospheric Science KW - Geophysics SN - 2169-897X TI - Modeling 2 m air temperatures over mountain glaciers: Exploring the influence of katabatic cooling and external warming VL - 120 ER - TY - JOUR AB - Meteorological studies in high-mountain environments form the basis of our understanding of catchment hydrology and glacier accumulation and melt processes, yet high-altitude (>4000 m above sea level, asl) observatories are rare. This research presents meteorological data recorded between December 2012 and November 2013 at seven stations in Nepal, ranging in elevation from 3860 to 5360 m asl. Seasonal and diurnal cycles in air temperature, vapour pressure, incoming short-wave and long-wave radiation, atmospheric transmissivity, wind speed, and precipitation are compared between sites. Solar radiation strongly affects diurnal temperature and vapour pressure cycles, but local topography and valley-scale circulations alter wind speed and precipitation cycles. The observed diurnal variability in vertical temperature gradients in all seasons highlights the importance of in situ measurements for melt modelling. The monsoon signal (progressive onset and sharp end) is visible in all data-sets, and the passage of the remnants of Typhoon Phailin in mid-October 2013 provides an interesting case study on the possible effects of such storms on glaciers in the region. AU - Shea, J.M. AU - Wagnon, P. AU - Immerzeel, W.W. AU - Biron, R. AU - Brun, F. AU - Pellicciotti, Francesca ID - 12629 IS - 2 JF - International Journal of Water Resources Development KW - Water Science and Technology KW - Development SN - 0790-0627 TI - A comparative high-altitude meteorological analysis from three catchments in the Nepalese Himalaya VL - 31 ER - TY - JOUR AB - Ice cliffs have been identified as a reason for higher ablation rates on debris-covered glaciers than are implied by the insulation effects of the debris. This study aims to improve our understanding of cliff backwasting, and the role of radiative fluxes in particular. An energy-balance model is forced with new data gathered in May and October 2013 on Lirung Glacier, Nepalese Himalaya. Observations show substantial variability in melt between cliffs, between locations on any cliff and between seasons. Using a high-resolution digital elevation model we calculate longwave fluxes incident to the cliff from surrounding terrain and include the effect of local shading on shortwave radiation. This is an advance over previous studies, that made simplified assumptions on cliff geometry and radiative fluxes. Measured melt rates varied between 3.25 and 8.6 cm d−1 in May and 0.18 and 1.34 cm d−1 in October. Model results reproduce the strong variability in space and time, suggesting considerable differences in radiative fluxes over one cliff. In October the model fails to reproduce stake readings, probably due to the lack of a refreezing component. Disregarding local topography can lead to overestimation of melt at the point scale by up to ∼9%. AU - Steiner, Jakob F. AU - Pellicciotti, Francesca AU - Buri, Pascal AU - Miles, Evan S. AU - Immerzeel, Walter W. AU - Reid, Tim D. ID - 12626 IS - 229 JF - Journal of Glaciology SN - 0022-1430 TI - Modelling ice-cliff backwasting on a debris-covered glacier in the Nepalese Himalaya VL - 61 ER - TY - JOUR AB - Spatial evolution of supraglacial debris cover on mountain glaciers is a largely unmonitored and poorly understood phenomenon that directly affects glacier melt. Supraglacial debris cover for 93 glaciers in the Karakoram, northern Pakistan, was mapped from Landsat imagery acquired in 1977, 1998, 2009 and 2014. Surge-type glaciers occupy 41% of the study area and were considered separately. The time series of debris-covered surface area change shows a mean value of zero or near-zero change for both surging and non-surging glaciers. An increase in debris-covered area is often associated with negative regional mass balances. We extend this logic to suggest that the stable regional mass balances in the Karakoram explain the zero or near-zero change in debris-covered area. This coupling of trends combined with our 37 year time series of data suggests the Karakoram anomaly extends further back in time than previously known. AU - Herreid, Sam AU - Pellicciotti, Francesca AU - Ayala, Alvaro AU - Chesnokova, Anna AU - Kienholz, Christian AU - Shea, Joseph AU - Shrestha, Arun ID - 12627 IS - 227 JF - Journal of Glaciology SN - 0022-1430 TI - Satellite observations show no net change in the percentage of supraglacial debris-covered area in northern Pakistan from 1977 to 2014 VL - 61 ER - TY - JOUR AB - CCL19 and CCL21 are chemokines involved in the trafficking of immune cells, particularly within the lymphatic system, through activation of CCR7. Concurrent expression of PSGL-1 and CCR7 in naive T-cells enhances recruitment of these cells to secondary lymphoid organs by CCL19 and CCL21. Here the solution structure of CCL19 is reported. It contains a canonical chemokine domain. Chemical shift mapping shows the N-termini of PSGL-1 and CCR7 have overlapping binding sites for CCL19 and binding is competitive. Implications for the mechanism of PSGL-1's enhancement of resting T-cell recruitment are discussed. AU - Veldkamp, Christopher AU - Kiermaier, Eva AU - Gabel Eissens, Skylar AU - Gillitzer, Miranda AU - Lippner, David AU - Disilvio, Frank AU - Mueller, Casey AU - Wantuch, Paeton AU - Chaffee, Gary AU - Famiglietti, Michael AU - Zgoba, Danielle AU - Bailey, Asha AU - Bah, Yaya AU - Engebretson, Samantha AU - Graupner, David AU - Lackner, Emily AU - Larosa, Vincent AU - Medeiros, Tysha AU - Olson, Michael AU - Phillips, Andrew AU - Pyles, Harley AU - Richard, Amanda AU - Schoeller, Scott AU - Touzeau, Boris AU - Williams, Larry AU - Sixt, Michael K AU - Peterson, Francis ID - 1618 IS - 27 JF - Biochemistry TI - Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites VL - 54 ER - TY - CONF AU - Martius, Georg S AU - Olbrich, Eckehard ID - 12881 SN - 9780262330275 T2 - Proceedings of the 13th European Conference on Artificial Life TI - Quantifying self-organizing behavior of autonomous robots ER - TY - JOUR AB - SNC1 (SUPPRESSOR OF NPR1, CONSTITUTIVE 1) is one of a suite of intracellular Arabidopsis NOD-like receptor (NLR) proteins which, upon activation, result in the induction of defense responses. However, the molecular mechanisms underlying NLR activation and the subsequent provocation of immune responses are only partially characterized. To identify negative regulators of NLR-mediated immunity, a forward genetic screen was undertaken to search for enhancers of the dwarf, autoimmune gain-of-function snc1 mutant. To avoid lethality resulting from severe dwarfism, the screen was conducted using mos4 (modifier of snc1, 4) snc1 plants, which display wild-type-like morphology and resistance. M2 progeny were screened for mutant, snc1-enhancing (muse) mutants displaying a reversion to snc1-like phenotypes. The muse9 mos4 snc1 triple mutant was found to exhibit dwarf morphology, elevated expression of the pPR2-GUS defense marker reporter gene and enhanced resistance to the oomycete pathogen Hyaloperonospora arabidopsidis Noco2. Via map-based cloning and Illumina sequencing, it was determined that the muse9 mutation is in the gene encoding the SWI/SNF chromatin remodeler SYD (SPLAYED), and was thus renamed syd-10. The syd-10 single mutant has no observable alteration from wild-type-like resistance, although the syd-4 T-DNA insertion allele displays enhanced resistance to the bacterial pathogen Pseudomonas syringae pv. maculicola ES4326. Transcription of SNC1 is increased in both syd-4 and syd-10. These data suggest that SYD plays a subtle, specific role in the regulation of SNC1 expression and SNC1-mediated immunity. SYD may work with other proteins at the chromatin level to repress SNC1 transcription; such regulation is important for fine-tuning the expression of NLR-encoding genes to prevent unpropitious autoimmunity. AU - Johnson, Kaeli C.M. AU - Xia, Shitou AU - Feng, Xiaoqi AU - Li, Xin ID - 12196 IS - 8 JF - Plant and Cell Physiology KW - Cell Biology KW - Plant Science KW - Physiology KW - General Medicine SN - 0032-0781 TI - The chromatin remodeler SPLAYED negatively regulates SNC1-mediated immunity VL - 56 ER - TY - JOUR AB - The chemical behaviour of molecules can be significantly modified by confinement to volumes comparable to the dimensions of the molecules. Although such confined spaces can be found in various nanostructured materials, such as zeolites, nanoporous organic frameworks and colloidal nanocrystal assemblies, the slow diffusion of molecules in and out of these materials has greatly hampered studying the effect of confinement on their physicochemical properties. Here, we show that this diffusion limitation can be overcome by reversibly creating and destroying confined environments by means of ultraviolet and visible light irradiation. We use colloidal nanocrystals functionalized with light-responsive ligands that readily self-assemble and trap various molecules from the surrounding bulk solution. Once trapped, these molecules can undergo chemical reactions with increased rates and with stereoselectivities significantly different from those in bulk solution. Illumination with visible light disassembles these nanoflasks, releasing the product in solution and thereby establishes a catalytic cycle. These dynamic nanoflasks can be useful for studying chemical reactivities in confined environments and for synthesizing molecules that are otherwise hard to achieve in bulk solution. AU - Zhao, Hui AU - Sen, Soumyo AU - Udayabhaskararao, T. AU - Sawczyk, Michał AU - Kučanda, Kristina AU - Manna, Debasish AU - Kundu, Pintu K. AU - Lee, Ji-Woong AU - Král, Petr AU - Klajn, Rafal ID - 13392 JF - Nature Nanotechnology KW - Electrical and Electronic Engineering KW - Condensed Matter Physics KW - General Materials Science KW - Biomedical Engineering KW - Atomic and Molecular Physics KW - and Optics KW - Bioengineering SN - 1748-3387 TI - Reversible trapping and reaction acceleration within dynamically self-assembling nanoflasks VL - 11 ER - TY - JOUR AB - The ability to guide the assembly of nanosized objects reversibly with external stimuli, in particular light, is of fundamental importance, and it contributes to the development of applications as diverse as nanofabrication and controlled drug delivery. However, all the systems described to date are based on nanoparticles (NPs) that are inherently photoresponsive, which makes their preparation cumbersome and can markedly hamper their performance. Here we describe a conceptually new methodology to assemble NPs reversibly using light that does not require the particles to be functionalized with light-responsive ligands. Our strategy is based on the use of a photoswitchable medium that responds to light in such a way that it modulates the interparticle interactions. NP assembly proceeds quantitatively and without apparent fatigue, both in solution and in gels. Exposing the gels to light in a spatially controlled manner allowed us to draw images that spontaneously disappeared after a specific period of time. AU - Kundu, Pintu K. AU - Samanta, Dipak AU - Leizrowice, Ron AU - Margulis, Baruch AU - Zhao, Hui AU - Börner, Martin AU - Udayabhaskararao, T. AU - Manna, Debasish AU - Klajn, Rafal ID - 13394 JF - Nature Chemistry KW - General Chemical Engineering KW - General Chemistry SN - 1755-4330 TI - Light-controlled self-assembly of non-photoresponsive nanoparticles VL - 7 ER - TY - JOUR AB - Precise control of the self-assembly of selected components within complex mixtures is a challenging goal whose realization is important for fabricating novel nanomaterials. Herein we show that by decorating the surfaces of metallic nanoparticles with differently substituted azobenzenes, it is possible to modulate the wavelength of light at which the self-assembly of these nanoparticles is induced. Exposing a mixture of two types of nanoparticles, each functionalized with a different azobenzene, to UV or blue light induces the selective self-assembly of only one type of nanoparticles. Irradiation with the other wavelength triggers the disassembly of the aggregates, and the simultaneous self-assembly of nanoparticles of the other type. By placing both types of azobenzenes on the same nanoparticles, we created unique materials (“frustrated” nanoparticles) whose self-assembly is induced irrespective of the wavelength of the incident light. AU - Manna, Debasish AU - Udayabhaskararao, Thumu AU - Zhao, Hui AU - Klajn, Rafal ID - 13393 IS - 42 JF - Angewandte Chemie International Edition KW - General Chemistry KW - Catalysis SN - 1433-7851 TI - Orthogonal light-induced self-assembly of nanoparticles using differently substituted azobenzenes VL - 54 ER - TY - JOUR AB - Metallic nanoparticles co-functionalised with monolayers of UV- and CO2-sensitive ligands were prepared and shown to respond to these two types of stimuli reversibly and in an orthogonal fashion. The composition of the coating could be tailored to yield nanoparticles capable of aggregating exclusively when both UV and CO2 were applied at the same time, analogously to the behaviour of an AND logic gate. AU - Lee, Ji-Woong AU - Klajn, Rafal ID - 13395 IS - 11 JF - Chemical Communications KW - Materials Chemistry KW - Metals and Alloys KW - Surfaces KW - Coatings and Films KW - General Chemistry KW - Ceramics and Composites KW - Electronic KW - Optical and Magnetic Materials KW - Catalysis SN - 1359-7345 TI - Dual-responsive nanoparticles that aggregate under the simultaneous action of light and CO2 VL - 51 ER - TY - JOUR AB - Photoswitching in densely packed azobenzene self-assembled monolayers (SAMs) is strongly affected by steric constraints and excitonic coupling between neighboring chromophores. Therefore, control of the chromophore density is essential for enhancing and manipulating the photoisomerization yield. We systematically compare two methods to achieve this goal: First, we assemble monocomponent azobenzene–alkanethiolate SAMs on gold nanoparticles of varying size. Second, we form mixed SAMs of azobenzene–alkanethiolates and “dummy” alkanethiolates on planar substrates. Both methods lead to a gradual decrease of the chromophore density and enable efficient photoswitching with low-power light sources. X-ray spectroscopy reveals that coadsorption from solution yields mixtures with tunable composition. The orientation of the chromophores with respect to the surface normal changes from a tilted to an upright position with increasing azobenzene density. For both systems, optical spectroscopy reveals a pronounced excitonic shift that increases with the chromophore density. In spite of exciting the optical transition of the monomer, the main spectral change in mixed SAMs occurs in the excitonic band. In addition, the photoisomerization yield decreases only slightly by increasing the azobenzene–alkanethiolate density, and we observed photoswitching even with minor dilutions. Unlike in solution, azobenzene in the planar SAM can be switched back almost completely by optical excitation from the cis to the original trans state within a short time scale. These observations indicate cooperativity in the photoswitching process of mixed SAMs. AU - Moldt, Thomas AU - Brete, Daniel AU - Przyrembel, Daniel AU - Das, Sanjib AU - Goldman, Joel R. AU - Kundu, Pintu K. AU - Gahl, Cornelius AU - Klajn, Rafal AU - Weinelt, Martin ID - 13396 IS - 3 JF - Langmuir KW - Electrochemistry KW - Spectroscopy KW - Surfaces and Interfaces KW - Condensed Matter Physics KW - General Materials Science SN - 0743-7463 TI - Tailoring the properties of surface-immobilized azobenzenes by monolayer dilution and surface curvature VL - 31 ER - TY - JOUR AB - Self-assembly of inorganic nanoparticles has been studied extensively for particles having different sizes and compositions. However, relatively little attention has been devoted to how the shape and surface chemistry of magnetic nanoparticles affects their self-assembly properties. Here, we undertook a combined experiment–theory study aimed at better understanding of the self-assembly of cubic magnetite (Fe3O4) particles. We demonstrated that, depending on the experimental parameters, such as the direction of the magnetic field and nanoparticle density, a variety of superstructures can be obtained, including one-dimensional filaments and helices, as well as C-shaped assemblies described here for the first time. Furthermore, we functionalized the surfaces of the magnetic nanocubes with light-sensitive ligands. Using these modified nanoparticles, we were able to achieve orthogonal control of self-assembly using a magnetic field and light. AU - Singh, Gurvinder AU - Chan, Henry AU - Udayabhaskararao, T. AU - Gelman, Elijah AU - Peddis, Davide AU - Baskin, Artem AU - Leitus, Gregory AU - Král, Petr AU - Klajn, Rafal ID - 13397 JF - Faraday Discussions KW - Physical and Theoretical Chemistry SN - 1359-6640 TI - Magnetic field-induced self-assembly of iron oxide nanocubes VL - 181 ER - TY - JOUR AU - Sun, Yugang AU - Scarabelli, Leonardo AU - Kotov, Nicholas AU - Tebbe, Moritz AU - Lin, Xiao-Min AU - Brullot, Ward AU - Isa, Lucio AU - Schurtenberger, Peter AU - Moehwald, Helmuth AU - Fedin, Igor AU - Velev, Orlin AU - Faivre, Damien AU - Sorensen, Christopher AU - Perzynski, Régine AU - Chanana, Munish AU - Li, Zhihai AU - Bresme, Fernando AU - Král, Petr AU - Firlar, Emre AU - Schiffrin, David AU - Souza Junior, Joao Batista AU - Fery, Andreas AU - Shevchenko, Elena AU - Tarhan, Ozgur AU - Alivisatos, Armand Paul AU - Disch, Sabrina AU - Klajn, Rafal AU - Ghosh, Suvojit ID - 13398 JF - Faraday Discussions KW - Physical and Theoretical Chemistry SN - 1359-6640 TI - Field-assisted self-assembly process: General discussion VL - 181 ER - TY - JOUR AB - The detection of electron motion and electronic wave-packet dynamics is one of the core goals of attosecond science. Recently, choosing the nitric oxide molecule as an example, we have introduced and demonstrated an experimental approach to measure coupled valence electronic and rotational wave packets using high-order-harmonic-generation (HHG) spectroscopy [Kraus et al., Phys. Rev. Lett. 111, 243005 (2013)]. A short outline of the theory to describe the combination of the pump and HHG probe process was published together with an extensive discussion of experimental results [Baykusheva et al., Faraday Discuss. 171, 113 (2014)]. The comparison of theory and experiment showed good agreement on a quantitative level. Here, we present the theory in detail, which is based on a generalized density-matrix approach that describes the pump process and the subsequent probing of the wave packets by a semiclassical quantitative rescattering approach. An in-depth analysis of the different Raman scattering contributions to the creation of the coupled rotational and electronic spin-orbit wave packets is made. We present results for parallel and perpendicular linear polarizations of the pump and probe laser pulses. Furthermore, an analysis of the combined rotational-electronic density matrix in terms of irreducible components is presented that facilitates interpretation of the results. AU - Zhang, Song Bin AU - Baykusheva, Denitsa Rangelova AU - Kraus, Peter M. AU - Wörner, Hans Jakob AU - Rohringer, Nina ID - 14017 IS - 2 JF - Physical Review A KW - Atomic and Molecular Physics KW - and Optics SN - 1050-2947 TI - Theoretical study of molecular electronic and rotational coherences by high-order-harmonic generation VL - 91 ER - TY - JOUR AB - All attosecond time-resolved measurements have so far relied on the use of intense near-infrared laser pulses. In particular, attosecond streaking, laser-induced electron diffraction and high-harmonic generation all make use of non-perturbative light–matter interactions. Remarkably, the effect of the strong laser field on the studied sample has often been neglected in previous studies. Here we use high-harmonic spectroscopy to measure laser-induced modifications of the electronic structure of molecules. We study high-harmonic spectra of spatially oriented CH3F and CH3Br as generic examples of polar polyatomic molecules. We accurately measure intensity ratios of even and odd-harmonic orders, and of the emission from aligned and unaligned molecules. We show that these robust observables reveal a substantial modification of the molecular electronic structure by the external laser field. Our insights offer new challenges and opportunities for a range of emerging strong-field attosecond spectroscopies. AU - Kraus, P. M. AU - Tolstikhin, O. I. AU - Baykusheva, Denitsa Rangelova AU - Rupenyan, A. AU - Schneider, J. AU - Bisgaard, C. Z. AU - Morishita, T. AU - Jensen, F. AU - Madsen, L. B. AU - Wörner, H. J. ID - 14016 JF - Nature Communications KW - General Physics and Astronomy KW - General Biochemistry KW - Genetics and Molecular Biology KW - General Chemistry KW - Multidisciplinary TI - Observation of laser-induced electronic structure in oriented polyatomic molecules VL - 6 ER - TY - JOUR AB - The ultrafast motion of electrons and holes after light-matter interaction is fundamental to a broad range of chemical and biophysical processes. We advanced high-harmonic spectroscopy to resolve spatially and temporally the migration of an electron hole immediately after ionization of iodoacetylene while simultaneously demonstrating extensive control over the process. A multidimensional approach, based on the measurement and accurate theoretical description of both even and odd harmonic orders, enabled us to reconstruct both quantum amplitudes and phases of the electronic states with a resolution of ~100 attoseconds. We separately reconstructed quasi-field-free and laser-controlled charge migration as a function of the spatial orientation of the molecule and determined the shape of the hole created by ionization. Our technique opens the prospect of laser control over electronic primary processes. AU - Kraus, P. M. AU - Mignolet, B. AU - Baykusheva, Denitsa Rangelova AU - Rupenyan, A. AU - Horný, L. AU - Penka, E. F. AU - Grassi, G. AU - Tolstikhin, O. I. AU - Schneider, J. AU - Jensen, F. AU - Madsen, L. B. AU - Bandrauk, A. D. AU - Remacle, F. AU - Wörner, H. J. ID - 14013 IS - 6262 JF - Science KW - Multidisciplinary SN - 0036-8075 TI - Measurement and laser control of attosecond charge migration in ionized iodoacetylene VL - 350 ER - TY - JOUR AB - We advance high-harmonic spectroscopy to resolve molecular charge migration in time and space and simultaneously demonstrate extensive control over the process. A multidimensional approach enables us to reconstruct both quantum amplitudes and phases with a resolution of better than 100 attoseconds and to separately reconstruct field-free and laser- driven charge migration. Our techniques make charge migration in molecules measurable on the attosecond time scale and open new avenues for laser control of electronic primary processes. AU - Kraus, P M AU - Mignolet, B AU - Baykusheva, Denitsa Rangelova AU - Rupenyan, A AU - Horný, L AU - Penka, E F AU - Tolstikhin, O I AU - Schneider, J AU - Jensen, F AU - Madsen, L B AU - Bandrauk, A D AU - Remacle, F AU - Wörner, H J ID - 14015 IS - 11 JF - Journal of Physics: Conference Series KW - General Physics and Astronomy SN - 1742-6588 TI - Attosecond charge migration and its laser control VL - 635 ER - TY - JOUR AB - We have studied a coupled electronic-nuclear wave packet in nitric oxide using time-resolved strong-field photoelectron holography and rescattering. We show that the electronic dynamics mainly appears in the holographic structures whereas nuclear motion strongly modulates the angular distribution of the rescattered photoelectrons. AU - Walt, Samuel G AU - Ram, N Bhargava AU - von Conta, Aaron AU - Baykusheva, Denitsa Rangelova AU - Atala, Marcos AU - Wörner, Hans Jakob ID - 14014 IS - 11 JF - Journal of Physics: Conference Series KW - General Physics and Astronomy SN - 1742-6588 TI - Resolving the dynamics of valence-shell electrons and nuclei through laser-induced diffraction and holography VL - 635 ER - TY - GEN AB - Parasitism creates selection for resistance mechanisms in host populations and is hypothesized to promote increased host evolvability. However, the influence of these traits on host evolution when parasites are no longer present is unclear. We used experimental evolution and whole-genome sequencing of Escherichia coli to determine the effects of past and present exposure to parasitic viruses (phages) on the spread of mutator alleles, resistance, and bacterial competitive fitness. We found that mutator alleles spread rapidly during adaptation to any of four different phage species, and this pattern was even more pronounced with multiple phages present simultaneously. However, hypermutability did not detectably accelerate adaptation in the absence of phages and recovery of fitness costs associated with resistance. Several lineages evolved phage resistance through elevated mucoidy, and during subsequent evolution in phage-free conditions they rapidly reverted to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this phenotypic reversion was achieved by additional genetic changes rather than by genotypic reversion of the initial resistance mutations. Insertion sequence (IS) elements played a key role in both the acquisition of resistance and adaptation in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions were not more frequent in mutator lineages. Our results provide a genetic explanation for rapid reversion of mucoidy, a phenotype observed in other bacterial species including human pathogens. Moreover, this demonstrates that the types of genetic change underlying adaptation to fitness costs, and consequently the impact of evolvability mechanisms such as increased point-mutation rates, depend critically on the mechanism of resistance. AU - Wielgoss, Sébastien AU - Bergmiller, Tobias AU - Bischofberger, Anna M. AU - Hall, Alex R. ID - 9719 TI - Data from: Adaptation to parasites and costs of parasite resistance in mutator and non-mutator bacteria ER - TY - THES AB - The human ability to recognize objects in complex scenes has driven research in the computer vision field over couple of decades. This thesis focuses on the object recognition task in images. That is, given the image, we want the computer system to be able to predict the class of the object that appears in the image. A recent successful attempt to bridge semantic understanding of the image perceived by humans and by computers uses attribute-based models. Attributes are semantic properties of the objects shared across different categories, which humans and computers can decide on. To explore the attribute-based models we take a statistical machine learning approach, and address two key learning challenges in view of object recognition task: learning augmented attributes as mid-level discriminative feature representation, and learning with attributes as privileged information. Our main contributions are parametric and non-parametric models and algorithms to solve these frameworks. In the parametric approach, we explore an autoencoder model combined with the large margin nearest neighbor principle for mid-level feature learning, and linear support vector machines for learning with privileged information. In the non-parametric approach, we propose a supervised Indian Buffet Process for automatic augmentation of semantic attributes, and explore the Gaussian Processes classification framework for learning with privileged information. A thorough experimental analysis shows the effectiveness of the proposed models in both parametric and non-parametric views. AU - Sharmanska, Viktoriia ID - 1401 SN - 2663-337X TI - Learning with attributes for object recognition: Parametric and non-parametrics views ER - TY - JOUR AB - The competition for resources among cells, individuals or species is a fundamental characteristic of evolution. Biological all-pay auctions have been used to model situations where multiple individuals compete for a single resource. However, in many situations multiple resources with various values exist and single reward auctions are not applicable. We generalize the model to multiple rewards and study the evolution of strategies. In biological all-pay auctions the bid of an individual corresponds to its strategy and is equivalent to its payment in the auction. The decreasingly ordered rewards are distributed according to the decreasingly ordered bids of the participating individuals. The reproductive success of an individual is proportional to its fitness given by the sum of the rewards won minus its payments. Hence, successful bidding strategies spread in the population. We find that the results for the multiple reward case are very different from the single reward case. While the mixed strategy equilibrium in the single reward case with more than two players consists of mostly low-bidding individuals, we show that the equilibrium can convert to many high-bidding individuals and a few low-bidding individuals in the multiple reward case. Some reward values lead to a specialization among the individuals where one subpopulation competes for the rewards and the other subpopulation largely avoids costly competitions. Whether the mixed strategy equilibrium is an evolutionarily stable strategy (ESS) depends on the specific values of the rewards. AU - Reiter, Johannes AU - Kanodia, Ayush AU - Gupta, Raghav AU - Nowak, Martin AU - Chatterjee, Krishnendu ID - 1709 IS - 1812 JF - Proceedings of the Royal Society of London Series B Biological Sciences TI - Biological auctions with multiple rewards VL - 282 ER - TY - THES AB - Cancer results from an uncontrolled growth of abnormal cells. Sequentially accumulated genetic and epigenetic alterations decrease cell death and increase cell replication. We used mathematical models to quantify the effect of driver gene mutations. The recently developed targeted therapies can lead to dramatic regressions. However, in solid cancers, clinical responses are often short-lived because resistant cancer cells evolve. We estimated that approximately 50 different mutations can confer resistance to a typical targeted therapeutic agent. We find that resistant cells are likely to be present in expanded subclones before the start of the treatment. The dominant strategy to prevent the evolution of resistance is combination therapy. Our analytical results suggest that in most patients, dual therapy, but not monotherapy, can result in long-term disease control. However, long-term control can only occur if there are no possible mutations in the genome that can cause cross-resistance to both drugs. Furthermore, we showed that simultaneous therapy with two drugs is much more likely to result in long-term disease control than sequential therapy with the same drugs. To improve our understanding of the underlying subclonal evolution we reconstruct the evolutionary history of a patient's cancer from next-generation sequencing data of spatially-distinct DNA samples. Using a quantitative measure of genetic relatedness, we found that pancreatic cancers and their metastases demonstrated a higher level of relatedness than that expected for any two cells randomly taken from a normal tissue. This minimal amount of genetic divergence among advanced lesions indicates that genetic heterogeneity, when quantitatively defined, is not a fundamental feature of the natural history of untreated pancreatic cancers. Our newly developed, phylogenomic tool Treeomics finds evidence for seeding patterns of metastases and can directly be used to discover rules governing the evolution of solid malignancies to transform cancer into a more predictable disease. AU - Reiter, Johannes ID - 1400 SN - 2663-337X TI - The subclonal evolution of cancer ER - TY - JOUR AB - Motivated by recent ideas of Harman (Unif. Distrib. Theory, 2010) we develop a new concept of variation of multivariate functions on a compact Hausdorff space with respect to a collection D of subsets. We prove a general version of the Koksma-Hlawka theorem that holds for this notion of variation and discrepancy with respect to D. As special cases, we obtain Koksma-Hlawka inequalities for classical notions, such as extreme or isotropic discrepancy. For extreme discrepancy, our result coincides with the usual Koksma-Hlawka theorem. We show that the space of functions of bounded D-variation contains important discontinuous functions and is closed under natural algebraic operations. Finally, we illustrate the results on concrete integration problems from integral geometry and stereology. AU - Pausinger, Florian AU - Svane, Anne ID - 1792 IS - 6 JF - Journal of Complexity TI - A Koksma-Hlawka inequality for general discrepancy systems VL - 31 ER - TY - THES AB - This thesis is concerned with the computation and approximation of intrinsic volumes. Given a smooth body M and a certain digital approximation of it, we develop algorithms to approximate various intrinsic volumes of M using only measurements taken from its digital approximations. The crucial idea behind our novel algorithms is to link the recent theory of persistent homology to the theory of intrinsic volumes via the Crofton formula from integral geometry and, in particular, via Euler characteristic computations. Our main contributions are a multigrid convergent digital algorithm to compute the first intrinsic volume of a solid body in R^n as well as an appropriate integration pipeline to approximate integral-geometric integrals defined over the Grassmannian manifold. AU - Pausinger, Florian ID - 1399 SN - 2663-337X TI - On the approximation of intrinsic volumes ER - TY - JOUR AB - Evolution of gene regulation is crucial for our understanding of the phenotypic differences between species, populations and individuals. Sequence-specific binding of transcription factors to the regulatory regions on the DNA is a key regulatory mechanism that determines gene expression and hence heritable phenotypic variation. We use a biophysical model for directional selection on gene expression to estimate the rates of gain and loss of transcription factor binding sites (TFBS) in finite populations under both point and insertion/deletion mutations. Our results show that these rates are typically slow for a single TFBS in an isolated DNA region, unless the selection is extremely strong. These rates decrease drastically with increasing TFBS length or increasingly specific protein-DNA interactions, making the evolution of sites longer than ∼ 10 bp unlikely on typical eukaryotic speciation timescales. Similarly, evolution converges to the stationary distribution of binding sequences very slowly, making the equilibrium assumption questionable. The availability of longer regulatory sequences in which multiple binding sites can evolve simultaneously, the presence of “pre-sites” or partially decayed old sites in the initial sequence, and biophysical cooperativity between transcription factors, can all facilitate gain of TFBS and reconcile theoretical calculations with timescales inferred from comparative genomics. AU - Tugrul, Murat AU - Paixao, Tiago AU - Barton, Nicholas H AU - Tkacik, Gasper ID - 1666 IS - 11 JF - PLoS Genetics TI - Dynamics of transcription factor binding site evolution VL - 11 ER - TY - CONF AB - We extend the theory of input-output conformance with operators for merge and quotient. The former is useful when testing against multiple requirements or views. The latter can be used to generate tests for patches of an already tested system. Both operators can combine systems with different action alphabets, which is usually the case when constructing complex systems and specifications from parts, for instance different views as well as newly defined functionality of a~previous version of the system. AU - Beneš, Nikola AU - Daca, Przemyslaw AU - Henzinger, Thomas A AU - Kretinsky, Jan AU - Nickovic, Dejan ID - 1502 SN - 978-1-4503-3471-6 TI - Complete composition operators for IOCO-testing theory ER - TY - JOUR AB - We consider Markov decision processes (MDPs) which are a standard model for probabilistic systems. We focus on qualitative properties for MDPs that can express that desired behaviors of the system arise almost-surely (with probability 1) or with positive probability. We introduce a new simulation relation to capture the refinement relation of MDPs with respect to qualitative properties, and present discrete graph algorithms with quadratic complexity to compute the simulation relation. We present an automated technique for assume-guarantee style reasoning for compositional analysis of two-player games by giving a counterexample guided abstraction-refinement approach to compute our new simulation relation. We show a tight link between two-player games and MDPs, and as a consequence the results for games are lifted to MDPs with qualitative properties. We have implemented our algorithms and show that the compositional analysis leads to significant improvements. AU - Chatterjee, Krishnendu AU - Chmelik, Martin AU - Daca, Przemyslaw ID - 1501 IS - 2 JF - Formal Methods in System Design TI - CEGAR for compositional analysis of qualitative properties in Markov decision processes VL - 47 ER - TY - JOUR AB - Interprocedural analysis is at the heart of numerous applications in programming languages, such as alias analysis, constant propagation, etc. Recursive state machines (RSMs) are standard models for interprocedural analysis. We consider a general framework with RSMs where the transitions are labeled from a semiring, and path properties are algebraic with semiring operations. RSMs with algebraic path properties can model interprocedural dataflow analysis problems, the shortest path problem, the most probable path problem, etc. The traditional algorithms for interprocedural analysis focus on path properties where the starting point is fixed as the entry point of a specific method. In this work, we consider possible multiple queries as required in many applications such as in alias analysis. The study of multiple queries allows us to bring in a very important algorithmic distinction between the resource usage of the one-time preprocessing vs for each individual query. The second aspect that we consider is that the control flow graphs for most programs have constant treewidth. Our main contributions are simple and implementable algorithms that supportmultiple queries for algebraic path properties for RSMs that have constant treewidth. Our theoretical results show that our algorithms have small additional one-time preprocessing, but can answer subsequent queries significantly faster as compared to the current best-known solutions for several important problems, such as interprocedural reachability and shortest path. We provide a prototype implementation for interprocedural reachability and intraprocedural shortest path that gives a significant speed-up on several benchmarks. AU - Chatterjee, Krishnendu AU - Ibsen-Jensen, Rasmus AU - Pavlogiannis, Andreas AU - Goyal, Prateesh ID - 1602 IS - 1 JF - ACM SIGPLAN Notices TI - Faster algorithms for algebraic path properties in recursive state machines with constant treewidth VL - 50 ER - TY - JOUR AB - We consider the quantitative analysis problem for interprocedural control-flow graphs (ICFGs). The input consists of an ICFG, a positive weight function that assigns every transition a positive integer-valued number, and a labelling of the transitions (events) as good, bad, and neutral events. The weight function assigns to each transition a numerical value that represents ameasure of how good or bad an event is. The quantitative analysis problem asks whether there is a run of the ICFG where the ratio of the sum of the numerical weights of good events versus the sum of weights of bad events in the long-run is at least a given threshold (or equivalently, to compute the maximal ratio among all valid paths in the ICFG). The quantitative analysis problem for ICFGs can be solved in polynomial time, and we present an efficient and practical algorithm for the problem. We show that several problems relevant for static program analysis, such as estimating the worst-case execution time of a program or the average energy consumption of a mobile application, can be modeled in our framework. We have implemented our algorithm as a tool in the Java Soot framework. We demonstrate the effectiveness of our approach with two case studies. First, we show that our framework provides a sound approach (no false positives) for the analysis of inefficiently-used containers. Second, we show that our approach can also be used for static profiling of programs which reasons about methods that are frequently invoked. Our experimental results show that our tool scales to relatively large benchmarks, and discovers relevant and useful information that can be used to optimize performance of the programs. AU - Chatterjee, Krishnendu AU - Pavlogiannis, Andreas AU - Velner, Yaron ID - 1604 IS - 1 JF - Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT SN - 978-1-4503-3300-9 TI - Quantitative interprocedural analysis VL - 50 ER - TY - CONF AB - We consider the core algorithmic problems related to verification of systems with respect to three classical quantitative properties, namely, the mean-payoff property, the ratio property, and the minimum initial credit for energy property. The algorithmic problem given a graph and a quantitative property asks to compute the optimal value (the infimum value over all traces) from every node of the graph. We consider graphs with constant treewidth, and it is well-known that the control-flow graphs of most programs have constant treewidth. Let n denote the number of nodes of a graph, m the number of edges (for constant treewidth graphs m=O(n)) and W the largest absolute value of the weights. Our main theoretical results are as follows. First, for constant treewidth graphs we present an algorithm that approximates the mean-payoff value within a multiplicative factor of ϵ in time O(n⋅log(n/ϵ)) and linear space, as compared to the classical algorithms that require quadratic time. Second, for the ratio property we present an algorithm that for constant treewidth graphs works in time O(n⋅log(|a⋅b|))=O(n⋅log(n⋅W)), when the output is ab, as compared to the previously best known algorithm with running time O(n2⋅log(n⋅W)). Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O(n2⋅m) time and the associated decision problem can be solved in O(n⋅m) time, improving the previous known O(n3⋅m⋅log(n⋅W)) and O(n2⋅m) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O(n⋅logn) time, improving the previous known O(n4⋅log(n⋅W)) bound. We have implemented some of our algorithms and show that they present a significant speedup on standard benchmarks. AU - Chatterjee, Krishnendu AU - Ibsen-Jensen, Rasmus AU - Pavlogiannis, Andreas ID - 1607 TI - Faster algorithms for quantitative verification in constant treewidth graphs VL - 9206 ER - TY - CONF AB - We present a flexible framework for the automated competitive analysis of on-line scheduling algorithms for firm-deadline real-time tasks based on multi-objective graphs: Given a task set and an on-line scheduling algorithm specified as a labeled transition system, along with some optional safety, liveness, and/or limit-average constraints for the adversary, we automatically compute the competitive ratio of the algorithm w.r.t. A clairvoyant scheduler. We demonstrate the flexibility and power of our approach by comparing the competitive ratio of several on-line algorithms, including Dover, that have been proposed in the past, for various task sets. Our experimental results reveal that none of these algorithms is universally optimal, in the sense that there are task sets where other schedulers provide better performance. Our framework is hence a very useful design tool for selecting optimal algorithms for a given application. AU - Chatterjee, Krishnendu AU - Pavlogiannis, Andreas AU - Kößler, Alexander AU - Schmid, Ulrich ID - 1714 IS - January T2 - Real-Time Systems Symposium TI - A framework for automated competitive analysis of on-line scheduling of firm-deadline tasks VL - 2015 ER - TY - CONF AB - We present a method for simulating brittle fracture under the assumptions of quasi-static linear elastic fracture mechanics (LEFM). Using the boundary element method (BEM) and Lagrangian crack-fronts, we produce highly detailed fracture surfaces. The computational cost of the BEM is alleviated by using a low-resolution mesh and interpolating the resulting stress intensity factors when propagating the high-resolution crack-front. Our system produces physics-based fracture surfaces with high spatial and temporal resolution, taking spatial variation of material toughness and/or strength into account. It also allows for crack initiation to be handled separately from crack propagation, which is not only more reasonable from a physics perspective, but can also be used to control the simulation. Separating the resolution of the crack-front from the resolution of the computational mesh increases the efficiency and therefore the amount of visual detail on the resulting fracture surfaces. The BEM also allows us to re-use previously computed blocks of the system matrix. AU - Hahn, David AU - Wojtan, Christopher J ID - 1633 IS - 4 TI - High-resolution brittle fracture simulation with boundary elements VL - 34 ER - TY - JOUR AB - 3D amoeboid cell migration is central to many developmental and disease-related processes such as cancer metastasis. Here, we identify a unique prototypic amoeboid cell migration mode in early zebrafish embryos, termed stable-bleb migration. Stable-bleb cells display an invariant polarized balloon-like shape with exceptional migration speed and persistence. Progenitor cells can be reversibly transformed into stable-bleb cells irrespective of their primary fate and motile characteristics by increasing myosin II activity through biochemical or mechanical stimuli. Using a combination of theory and experiments, we show that, in stable-bleb cells, cortical contractility fluctuations trigger a stochastic switch into amoeboid motility, and a positive feedback between cortical flows and gradients in contractility maintains stable-bleb cell polarization. We further show that rearward cortical flows drive stable-bleb cell migration in various adhesive and non-adhesive environments, unraveling a highly versatile amoeboid migration phenotype. AU - Ruprecht, Verena AU - Wieser, Stefan AU - Callan Jones, Andrew AU - Smutny, Michael AU - Morita, Hitoshi AU - Sako, Keisuke AU - Barone, Vanessa AU - Ritsch Marte, Monika AU - Sixt, Michael K AU - Voituriez, Raphaël AU - Heisenberg, Carl-Philipp J ID - 1537 IS - 4 JF - Cell TI - Cortical contractility triggers a stochastic switch to fast amoeboid cell motility VL - 160 ER - TY - JOUR AB - Auxin participates in a multitude of developmental processes, as well as responses to environmental cues. Compared with other plant hormones, auxin exhibits a unique property, as it undergoes directional, cell-to-cell transport facilitated by plasma membrane-localized transport proteins. Among them, a prominent role has been ascribed to the PIN family of auxin efflux facilitators. PIN proteins direct polar auxin transport on account of their asymmetric subcellular localizations. In this review, we provide an overview of the multiple developmental roles of PIN proteins, including the atypical endoplasmic reticulum-localized members of the family, and look at the family from an evolutionary perspective. Next, we cover the cell biological and molecular aspects of PIN function, in particular the establishment of their polar subcellular localization. Hormonal and environmental inputs into the regulation of PIN action are summarized as well. AU - Adamowski, Maciek AU - Friml, Jirí ID - 1591 IS - 1 JF - Plant Cell TI - PIN-dependent auxin transport: Action, regulation, and evolution VL - 27 ER - TY - JOUR AB - We consider real symmetric and complex Hermitian random matrices with the additional symmetry hxy = hN-y,N-x. The matrix elements are independent (up to the fourfold symmetry) and not necessarily identically distributed. This ensemble naturally arises as the Fourier transform of a Gaussian orthogonal ensemble. Italso occurs as the flip matrix model - an approximation of the two-dimensional Anderson model at small disorder. We show that the density of states converges to the Wigner semicircle law despite the new symmetry type. We also prove the local version of the semicircle law on the optimal scale. AU - Alt, Johannes ID - 1677 IS - 10 JF - Journal of Mathematical Physics TI - The local semicircle law for random matrices with a fourfold symmetry VL - 56 ER - TY - JOUR AB - High-throughput live-cell screens are intricate elements of systems biology studies and drug discovery pipelines. Here, we demonstrate an optogenetics-assisted method that avoids the need for chemical activators and reporters, reduces the number of operational steps and increases information content in a cell-based small-molecule screen against human protein kinases, including an orphan receptor tyrosine kinase. This blueprint for all-optical screening can be adapted to many drug targets and cellular processes. AU - Inglés Prieto, Álvaro AU - Gschaider-Reichhart, Eva AU - Muellner, Markus AU - Nowak, Matthias AU - Nijman, Sebastian AU - Grusch, Michael AU - Janovjak, Harald L ID - 1678 IS - 12 JF - Nature Chemical Biology TI - Light-assisted small-molecule screening against protein kinases VL - 11 ER - TY - JOUR AB - Gene expression is controlled primarily by interactions between transcription factor proteins (TFs) and the regulatory DNA sequence, a process that can be captured well by thermodynamic models of regulation. These models, however, neglect regulatory crosstalk: the possibility that noncognate TFs could initiate transcription, with potentially disastrous effects for the cell. Here, we estimate the importance of crosstalk, suggest that its avoidance strongly constrains equilibrium models of TF binding, and propose an alternative nonequilibrium scheme that implements kinetic proofreading to suppress erroneous initiation. This proposal is consistent with the observed covalent modifications of the transcriptional apparatus and predicts increased noise in gene expression as a trade-off for improved specificity. Using information theory, we quantify this trade-off to find when optimal proofreading architectures are favored over their equilibrium counterparts. Such architectures exhibit significant super-Poisson noise at low expression in steady state. AU - Cepeda Humerez, Sarah A AU - Rieckh, Georg AU - Tkacik, Gasper ID - 1576 IS - 24 JF - Physical Review Letters TI - Stochastic proofreading mechanism alleviates crosstalk in transcriptional regulation VL - 115 ER - TY - GEN AB - We study conditions under which a finite simplicial complex $K$ can be mapped to $\mathbb R^d$ without higher-multiplicity intersections. An almost $r$-embedding is a map $f: K\to \mathbb R^d$ such that the images of any $r$ pairwise disjoint simplices of $K$ do not have a common point. We show that if $r$ is not a prime power and $d\geq 2r+1$, then there is a counterexample to the topological Tverberg conjecture, i.e., there is an almost $r$-embedding of the $(d+1)(r-1)$-simplex in $\mathbb R^d$. This improves on previous constructions of counterexamples (for $d\geq 3r$) based on a series of papers by M. \"Ozaydin, M. Gromov, P. Blagojevi\'c, F. Frick, G. Ziegler, and the second and fourth present authors. The counterexamples are obtained by proving the following algebraic criterion in codimension 2: If $r\ge3$ and if $K$ is a finite $2(r-1)$-complex then there exists an almost $r$-embedding $K\to \mathbb R^{2r}$ if and only if there exists a general position PL map $f:K\to \mathbb R^{2r}$ such that the algebraic intersection number of the $f$-images of any $r$ pairwise disjoint simplices of $K$ is zero. This result can be restated in terms of cohomological obstructions or equivariant maps, and extends an analogous codimension 3 criterion by the second and fourth authors. As another application we classify ornaments $f:S^3 \sqcup S^3\sqcup S^3\to \mathbb R^5$ up to ornament concordance. It follows from work of M. Freedman, V. Krushkal and P. Teichner that the analogous criterion for $r=2$ is false. We prove a lemma on singular higher-dimensional Borromean rings, yielding an elementary proof of the counterexample. AU - Avvakumov, Sergey AU - Mabillard, Isaac AU - Skopenkov, A. AU - Wagner, Uli ID - 8183 T2 - arXiv TI - Eliminating higher-multiplicity intersections, III. Codimension 2 ER - TY - GEN AB - We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural problems that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, a property satisfied by the controlflow graphs of most programs. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis. The study of multiple queries allows us to consider the tradeoff between the resource usage of the one-time preprocessing and for each individual query. The traditional approach constructs the product graph of all components and applies the best-known graph algorithm on the product. In this approach, even the answer to a single query requires the transitive closure (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results showing that the worst-case running time of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (i.e., improving the worst-case bound for the shortest path problem in general graphs). Preliminary experimental results show that our algorithms perform favorably on several benchmarks. AU - Chatterjee, Krishnendu AU - Ibsen-Jensen, Rasmus AU - Goharshady, Amir AU - Pavlogiannis, Andreas ID - 5441 SN - 2664-1690 TI - Algorithms for algebraic path properties in concurrent systems of constant treewidth components ER - TY - GEN AB - We study algorithmic questions for concurrent systems where the transitions are labeled from a complete, closed semiring, and path properties are algebraic with semiring operations. The algebraic path properties can model dataflow analysis problems, the shortest path problem, and many other natural properties that arise in program analysis. We consider that each component of the concurrent system is a graph with constant treewidth, and it is known that the controlflow graphs of most programs have constant treewidth. We allow for multiple possible queries, which arise naturally in demand driven dataflow analysis problems (e.g., alias analysis). The study of multiple queries allows us to consider the tradeoff between the resource usage of the \emph{one-time} preprocessing and for \emph{each individual} query. The traditional approaches construct the product graph of all components and apply the best-known graph algorithm on the product. In the traditional approach, even the answer to a single query requires the transitive closure computation (i.e., the results of all possible queries), which provides no room for tradeoff between preprocessing and query time. Our main contributions are algorithms that significantly improve the worst-case running time of the traditional approach, and provide various tradeoffs depending on the number of queries. For example, in a concurrent system of two components, the traditional approach requires hexic time in the worst case for answering one query as well as computing the transitive closure, whereas we show that with one-time preprocessing in almost cubic time, each subsequent query can be answered in at most linear time, and even the transitive closure can be computed in almost quartic time. Furthermore, we establish conditional optimality results that show that the worst-case running times of our algorithms cannot be improved without achieving major breakthroughs in graph algorithms (such as improving the worst-case bounds for the shortest path problem in general graphs whose current best-known bound has not been improved in five decades). Finally, we provide a prototype implementation of our algorithms which significantly outperforms the existing algorithmic methods on several benchmarks. AU - Anonymous, 1 AU - Anonymous, 2 AU - Anonymous, 3 AU - Anonymous, 4 ID - 5442 SN - 2664-1690 TI - Algorithms for algebraic path properties in concurrent systems of constant treewidth components ER - TY - CONF AB - We consider the problem of computing the set of initial states of a dynamical system such that there exists a control strategy to ensure that the trajectories satisfy a temporal logic specification with probability 1 (almost-surely). We focus on discrete-time, stochastic linear dynamics and specifications given as formulas of the Generalized Reactivity(1) fragment of Linear Temporal Logic over linear predicates in the states of the system. We propose a solution based on iterative abstraction-refinement, and turn-based 2-player probabilistic games. While the theoretical guarantee of our algorithm after any finite number of iterations is only a partial solution, we show that if our algorithm terminates, then the result is the set of satisfying initial states. Moreover, for any (partial) solution our algorithm synthesizes witness control strategies to ensure almost-sure satisfaction of the temporal logic specification. We demonstrate our approach on an illustrative case study. AU - Svoreňová, Mária AU - Kretinsky, Jan AU - Chmelik, Martin AU - Chatterjee, Krishnendu AU - Cěrná, Ivana AU - Belta, Cǎlin ID - 1689 T2 - Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control TI - Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games ER - TY - CONF AB - We present a computer-aided programming approach to concurrency. The approach allows programmers to program assuming a friendly, non-preemptive scheduler, and our synthesis procedure inserts synchronization to ensure that the final program works even with a preemptive scheduler. The correctness specification is implicit, inferred from the non-preemptive behavior. Let us consider sequences of calls that the program makes to an external interface. The specification requires that any such sequence produced under a preemptive scheduler should be included in the set of such sequences produced under a non-preemptive scheduler. The solution is based on a finitary abstraction, an algorithm for bounded language inclusion modulo an independence relation, and rules for inserting synchronization. We apply the approach to device-driver programming, where the driver threads call the software interface of the device and the API provided by the operating system. Our experiments demonstrate that our synthesis method is precise and efficient, and, since it does not require explicit specifications, is more practical than the conventional approach based on user-provided assertions. AU - Cerny, Pavol AU - Clarke, Edmund AU - Henzinger, Thomas A AU - Radhakrishna, Arjun AU - Ryzhyk, Leonid AU - Samanta, Roopsha AU - Tarrach, Thorsten ID - 1729 TI - From non-preemptive to preemptive scheduling using synchronization synthesis VL - 9207 ER - TY - CONF AB - The behaviour of gene regulatory networks (GRNs) is typically analysed using simulation-based statistical testing-like methods. In this paper, we demonstrate that we can replace this approach by a formal verification-like method that gives higher assurance and scalability. We focus on Wagner’s weighted GRN model with varying weights, which is used in evolutionary biology. In the model, weight parameters represent the gene interaction strength that may change due to genetic mutations. For a property of interest, we synthesise the constraints over the parameter space that represent the set of GRNs satisfying the property. We experimentally show that our parameter synthesis procedure computes the mutational robustness of GRNs –an important problem of interest in evolutionary biology– more efficiently than the classical simulation method. We specify the property in linear temporal logics. We employ symbolic bounded model checking and SMT solving to compute the space of GRNs that satisfy the property, which amounts to synthesizing a set of linear constraints on the weights. AU - Giacobbe, Mirco AU - Guet, Calin C AU - Gupta, Ashutosh AU - Henzinger, Thomas A AU - Paixao, Tiago AU - Petrov, Tatjana ID - 1835 TI - Model checking gene regulatory networks VL - 9035 ER - TY - JOUR AB - The Auxin Binding Protein1 (ABP1) has been identified based on its ability to bind auxin with high affinity and studied for a long time as a prime candidate for the extracellular auxin receptor responsible for mediating in particular the fast non-transcriptional auxin responses. However, the contradiction between the embryo-lethal phenotypes of the originally described Arabidopsis T-DNA insertional knock-out alleles (abp1-1 and abp1-1s) and the wild type-like phenotypes of other recently described loss-of-function alleles (abp1-c1 and abp1-TD1) questions the biological importance of ABP1 and relevance of the previous genetic studies. Here we show that there is no hidden copy of the ABP1 gene in the Arabidopsis genome but the embryo-lethal phenotypes of abp1-1 and abp1-1s alleles are very similar to the knock-out phenotypes of the neighboring gene, BELAYA SMERT (BSM). Furthermore, the allelic complementation test between bsm and abp1 alleles shows that the embryo-lethality in the abp1-1 and abp1-1s alleles is caused by the off-target disruption of the BSM locus by the T-DNA insertions. This clarifies the controversy of different phenotypes among published abp1 knock-out alleles and asks for reflections on the developmental role of ABP1. AU - Michalko, Jaroslav AU - Dravecka, Marta AU - Bollenbach, Tobias AU - Friml, Jirí ID - 1509 JF - F1000 Research TI - Embryo-lethal phenotypes in early abp1 mutants are due to disruption of the neighboring BSM gene VL - 4 ER - TY - JOUR AB - In many social situations, individuals endeavor to find the single best possible partner, but are constrained to evaluate the candidates in sequence. Examples include the search for mates, economic partnerships, or any other long-term ties where the choice to interact involves two parties. Surprisingly, however, previous theoretical work on mutual choice problems focuses on finding equilibrium solutions, while ignoring the evolutionary dynamics of decisions. Empirically, this may be of high importance, as some equilibrium solutions can never be reached unless the population undergoes radical changes and a sufficient number of individuals change their decisions simultaneously. To address this question, we apply a mutual choice sequential search problem in an evolutionary game-theoretical model that allows one to find solutions that are favored by evolution. As an example, we study the influence of sequential search on the evolutionary dynamics of cooperation. For this, we focus on the classic snowdrift game and the prisoner’s dilemma game. AU - Priklopil, Tadeas AU - Chatterjee, Krishnendu ID - 1681 IS - 4 JF - Games TI - Evolution of decisions in population games with sequentially searching individuals VL - 6 ER - TY - JOUR AB - Quantifying behaviors of robots which were generated autonomously from task-independent objective functions is an important prerequisite for objective comparisons of algorithms and movements of animals. The temporal sequence of such a behavior can be considered as a time series and hence complexity measures developed for time series are natural candidates for its quantification. The predictive information and the excess entropy are such complexity measures. They measure the amount of information the past contains about the future and thus quantify the nonrandom structure in the temporal sequence. However, when using these measures for systems with continuous states one has to deal with the fact that their values will depend on the resolution with which the systems states are observed. For deterministic systems both measures will diverge with increasing resolution. We therefore propose a new decomposition of the excess entropy in resolution dependent and resolution independent parts and discuss how they depend on the dimensionality of the dynamics, correlations and the noise level. For the practical estimation we propose to use estimates based on the correlation integral instead of the direct estimation of the mutual information based on next neighbor statistics because the latter allows less control of the scale dependencies. Using our algorithm we are able to show how autonomous learning generates behavior of increasing complexity with increasing learning duration. AU - Martius, Georg S AU - Olbrich, Eckehard ID - 1655 IS - 10 JF - Entropy TI - Quantifying emergent behavior of autonomous robots VL - 17 ER - TY - JOUR AB - Huge body of evidences demonstrated that volatile anesthetics affect the hippocampal neurogenesis and neurocognitive functions, and most of them showed impairment at anesthetic dose. Here, we investigated the effect of low dose (1.8%) sevoflurane on hippocampal neurogenesis and dentate gyrus-dependent learning. Neonatal rats at postnatal day 4 to 6 (P4-6) were treated with 1.8% sevoflurane for 6 hours. Neurogenesis was quantified by bromodeoxyuridine labeling and electrophysiology recording. Four and seven weeks after treatment, the Morris water maze and contextual-fear discrimination learning tests were performed to determine the influence on spatial learning and pattern separation. A 6-hour treatment with 1.8% sevoflurane promoted hippocampal neurogenesis and increased the survival of newborn cells and the proportion of immature granular cells in the dentate gyrus of neonatal rats. Sevoflurane-treated rats performed better during the training days of the Morris water maze test and in contextual-fear discrimination learning test. These results suggest that a subanesthetic dose of sevoflurane promotes hippocampal neurogenesis in neonatal rats and facilitates their performance in dentate gyrus-dependent learning tasks. AU - Chen, Chong AU - Wang, Chao AU - Zhao, Xuan AU - Zhou, Tao AU - Xu, Dao AU - Wang, Zhi AU - Wang, Ying ID - 1834 IS - 2 JF - ASN Neuro TI - Low-dose sevoflurane promoteshippocampal neurogenesis and facilitates the development of dentate gyrus-dependent learning in neonatal rats VL - 7 ER - TY - JOUR AB - We calculate a Ricci curvature lower bound for some classical examples of random walks, namely, a chain on a slice of the n-dimensional discrete cube (the so-called Bernoulli-Laplace model) and the random transposition shuffle of the symmetric group of permutations on n letters. AU - Erbar, Matthias AU - Maas, Jan AU - Tetali, Prasad ID - 1635 IS - 4 JF - Annales de la faculté des sciences de Toulouse TI - Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models VL - 24 ER - TY - JOUR AB - Scaffolded DNA origami enables the fabrication of a variety of complex nanostructures that promise utility in diverse fields of application, ranging from biosensing over advanced therapeutics to metamaterials. The broad applicability of DNA origami as a material beyond the level of proof-of-concept studies critically depends, among other factors, on the availability of large amounts of pure single-stranded scaffold DNA. Here, we present a method for the efficient production of M13 bacteriophage-derived genomic DNA using high-cell-density fermentation of Escherichia coli in stirred-tank bioreactors. We achieve phage titers of up to 1.6 × 1014 plaque-forming units per mL. Downstream processing yields up to 410 mg of high-quality single-stranded DNA per one liter reaction volume, thus upgrading DNA origami-based nanotechnology from the milligram to the gram scale. AU - Kick, B AU - Praetorius, Florian M AU - Dietz, H AU - Weuster-Botz, D ID - 14303 IS - 7 JF - Nano Letters SN - 1530-6984 TI - Efficient production of single-stranded phage DNA as scaffolds for DNA origami VL - 15 ER - TY - CONF AB - For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinism, the situation is even more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism) is a straightforward choice, we take a different approach. Instead, we focus on the strategy itself, and extract the most important decisions it makes, and present its succinct representation. The key tools we employ to achieve this are (1) introducing a concept of importance of a state w.r.t. the strategy, and (2) learning using decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representation uses a self-explanatory data structure. In summary, our approach produces more succinct and more explainable strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental results show that we can extract several rules describing the strategy even for very large systems that do not fit in memory, and based on the rules explain the erroneous behaviour. AU - Brázdil, Tomáš AU - Chatterjee, Krishnendu AU - Chmelik, Martin AU - Fellner, Andreas AU - Kretinsky, Jan ID - 1603 TI - Counterexample explanation by learning small strategies in Markov decision processes VL - 9206 ER - TY - DATA AB - This repository contains the experimental part of the CAV 2015 publication Counterexample Explanation by Learning Small Strategies in Markov Decision Processes. We extended the probabilistic model checker PRISM to represent strategies of Markov Decision Processes as Decision Trees. The archive contains a java executable version of the extended tool (prism_dectree.jar) together with a few examples of the PRISM benchmark library. To execute the program, please have a look at the README.txt, which provides instructions and further information on the archive. The archive contains scripts that (if run often enough) reproduces the data presented in the publication. AU - Fellner, Andreas ID - 5549 KW - Markov Decision Process KW - Decision Tree KW - Probabilistic Verification KW - Counterexample Explanation TI - Experimental part of CAV 2015 publication: Counterexample Explanation by Learning Small Strategies in Markov Decision Processes ER - TY - CONF AB - We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers b and d there exists an integer h(b,d) such that the following holds. If F is a finite family of subsets of R^d such that the ith reduced Betti number (with Z_2 coefficients in singular homology) of the intersection of any proper subfamily G of F is at most b for every non-negative integer i less or equal to (d-1)/2, then F has Helly number at most h(b,d). These topological conditions are sharp: not controlling any of these first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex K, some well-behaved chain map from C_*(K) to C_*(R^d). Both techniques are of independent interest. AU - Goaoc, Xavier AU - Paták, Pavel AU - Patakova, Zuzana AU - Tancer, Martin AU - Wagner, Uli ID - 1512 TI - Bounding Helly numbers via Betti numbers VL - 34 ER - TY - JOUR AB - We show that a non-singular integral form of degree d is soluble non-trivially over the integers if and only if it is soluble non-trivially over the reals and the p-adic numbers, provided that the form has at least (d-\sqrt{d}/2)2^d variables. This improves on a longstanding result of Birch. AU - Browning, Timothy D AU - Prendiville, Sean ID - 271 IS - 731 JF - Journal fur die Reine und Angewandte Mathematik SN - 0075-4102 TI - Improvements in Birch's theorem on forms in many variables VL - 2017 ER - TY - CONF AB - Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto’92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system. In this work, we put forward an alternative concept for PoWs - so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model (with one additional mild assumption required for the proof to go through), using graphs with high “pebbling complexity” and Merkle hash-trees. We discuss some applications, including follow-up work where a decentralized digital currency scheme called Spacecoin is constructed that uses PoS (instead of wasteful PoW like in Bitcoin) to prevent double spending. The main technical contribution of this work is the construction of (directed, loop-free) graphs on N vertices with in-degree O(log logN) such that even if one places Θ(N) pebbles on the nodes of the graph, there’s a constant fraction of nodes that needs Θ(N) steps to be pebbled (where in every step one can put a pebble on a node if all its parents have a pebble). AU - Dziembowski, Stefan AU - Faust, Sebastian AU - Kolmogorov, Vladimir AU - Pietrzak, Krzysztof Z ID - 1675 SN - 0302-9743 T2 - 35th Annual Cryptology Conference TI - Proofs of space VL - 9216 ER - TY - JOUR AB - The circadian clock orchestrates global changes in transcriptional regulation on a daily basis via the bHLH-PAS transcription factor CLOCK:BMAL1. Pathways driven by other bHLH-PAS transcription factors have a homologous repressor that modulates activity on a tissue-specific basis, but none have been identified for CLOCK:BMAL1. We show here that the cancer/testis antigen PASD1 fulfills this role to suppress circadian rhythms. PASD1 is evolutionarily related to CLOCK and interacts with the CLOCK:BMAL1 complex to repress transcriptional activation. Expression of PASD1 is restricted to germline tissues in healthy individuals but can be induced in cells of somatic origin upon oncogenic transformation. Reducing PASD1 in human cancer cells significantly increases the amplitude of transcriptional oscillations to generate more robust circadian rhythms. Our results describe a function for a germline-specific protein in regulation of the circadian clock and provide a molecular link from oncogenic transformation to suppression of circadian rhythms. AU - Michael, Alicia Kathleen AU - Harvey, Stacy L. AU - Sammons, Patrick J. AU - Anderson, Amanda P. AU - Kopalle, Hema M. AU - Banham, Alison H. AU - Partch, Carrie L. ID - 15160 IS - 5 JF - Molecular Cell KW - Cell Biology KW - Molecular Biology SN - 1097-2765 TI - Cancer/Testis antigen PASD1 silences the circadian clock VL - 58 ER -