TY - JOUR
AB - Solitons are localized waves formed by a balance of focusing and defocusing effects. These nonlinear waves exist in diverse forms of matter yet exhibit similar properties including stability, periodic recurrence and particle-like trajectories. One important property is soliton fission, a process by which an energetic higher-order soliton breaks apart due to dispersive or nonlinear perturbations. Here we demonstrate through both experiment and theory that nonlinear photocarrier generation can induce soliton fission. Using near-field measurements, we directly observe the nonlinear spatial and temporal evolution of optical pulses in situ in a nanophotonic semiconductor waveguide. We develop an analytic formalism describing the free-carrier dispersion (FCD) perturbation and show the experiment exceeds the minimum threshold by an order of magnitude. We confirm these observations with a numerical nonlinear Schrödinger equation model. These results provide a fundamental explanation and physical scaling of optical pulse evolution in free-carrier media and could enable improved supercontinuum sources in gas based and integrated semiconductor waveguides.
AU - Husko, Chad
AU - Wulf, Matthias
AU - Lefrançois, Simon
AU - Combrié, Sylvain
AU - Lehoucq, Gaëlle
AU - De Rossi, Alfredo
AU - Eggleton, Benjamin
AU - Kuipers, Laurens
ID - 1429
JF - Nature Communications
TI - Free-carrier-induced soliton fission unveiled by in situ measurements in nanophotonic waveguides
VL - 7
ER -
TY - JOUR
AB - The rare socially parasitic butterfly Maculinea alcon occurs in two forms, which are characteristic of hygric or xeric habitats and which exploit different host plants and host ants. The status of these two forms has been the subject of considerable controversy. Populations of the two forms are usually spatially distinct, but at Răscruci in Romania both forms occur on the same site (syntopically). We examined the genetic differentiation between the two forms using eight microsatellite markers, and compared with a nearby hygric site, Şardu. Our results showed that while the two forms are strongly differentiated at Răscruci, it is the xeric form there that is most similar to the hygric form at Şardu, and Bayesian clustering algorithms suggest that these two populations have exchanged genes relatively recently. We found strong evidence for population substructuring, caused by high within host ant nest relatedness, indicating very limited dispersal of most ovipositing females, but not association with particular host ant species. Our results are consistent with the results of larger scale phylogeographic studies that suggest that the two forms represent local ecotypes specialising on different host plants, each with a distinct flowering phenology, providing a temporal rather than spatial barrier to gene flow.
AU - Tartally, András
AU - Kelager, Andreas
AU - Fürst, Matthias
AU - Nash, David
ID - 1431
IS - 3
JF - PeerJ
TI - Host plant use drives genetic differentiation in syntopic populations of Maculinea alcon
VL - 2016
ER -
TY - JOUR
AB - CA3–CA3 recurrent excitatory synapses are thought to play a key role in memory storage and pattern completion. Whether the plasticity properties of these synapses are consistent with their proposed network functions remains unclear. Here, we examine the properties of spike timing-dependent plasticity (STDP) at CA3–CA3 synapses. Low-frequency pairing of excitatory postsynaptic potentials (EPSPs) and action potentials (APs) induces long-term potentiation (LTP), independent of temporal order. The STDP curve is symmetric and broad (half-width ~150 ms). Consistent with these STDP induction properties, AP–EPSP sequences lead to supralinear summation of spine [Ca2+] transients. Furthermore, afterdepolarizations (ADPs) following APs efficiently propagate into dendrites of CA3 pyramidal neurons, and EPSPs summate with dendritic ADPs. In autoassociative network models, storage and recall are more robust with symmetric than with asymmetric STDP rules. Thus, a specialized STDP induction rule allows reliable storage and recall of information in the hippocampal CA3 network.
AU - Mishra, Rajiv Kumar
AU - Kim, Sooyun
AU - Guzmán, José
AU - Jonas, Peter M
ID - 1432
JF - Nature Communications
TI - Symmetric spike timing-dependent plasticity at CA3–CA3 synapses optimizes storage and recall in autoassociative networks
VL - 7
ER -
TY - JOUR
AB - We prove that the system of subordination equations, defining the free additive convolution of two probability measures, is stable away from the edges of the support and blow-up singularities by showing that the recent smoothness condition of Kargin is always satisfied. As an application, we consider the local spectral statistics of the random matrix ensemble A+UBU⁎A+UBU⁎, where U is a Haar distributed random unitary or orthogonal matrix, and A and B are deterministic matrices. In the bulk regime, we prove that the empirical spectral distribution of A+UBU⁎A+UBU⁎ concentrates around the free additive convolution of the spectral distributions of A and B on scales down to N−2/3N−2/3.
AU - Bao, Zhigang
AU - Erdös, László
AU - Schnelli, Kevin
ID - 1434
IS - 3
JF - Journal of Functional Analysis
TI - Local stability of the free additive convolution
VL - 271
ER -
TY - JOUR
AB - ATP released from neurons and astrocytes during neuronal activity or under pathophysiological circumstances is able to influence information flow in neuronal circuits by activation of ionotropic P2X and metabotropic P2Y receptors and subsequent modulation of cellular excitability, synaptic strength, and plasticity. In the present paper we review cellular and network effects of P2Y receptors in the brain. We show that P2Y receptors inhibit the release of neurotransmitters, modulate voltage- and ligand-gated ion channels, and differentially influence the induction of synaptic plasticity in the prefrontal cortex, hippocampus, and cerebellum. The findings discussed here may explain how P2Y1 receptor activation during brain injury, hypoxia, inflammation, schizophrenia, or Alzheimer's disease leads to an impairment of cognitive processes. Hence, it is suggested that the blockade of P2Y1 receptors may have therapeutic potential against cognitive disturbances in these states.
AU - Guzmán, José
AU - Gerevich, Zoltan
ID - 1435
JF - Neural Plasticity
TI - P2Y receptors in synaptic transmission and plasticity: Therapeutic potential in cognitive dysfunction
VL - 2016
ER -
TY - JOUR
AB - We study the time evolution of a system of N spinless fermions in R3 which interact through a pair potential, e.g., the Coulomb potential. We compare the dynamics given by the solution to Schrödinger's equation with the time-dependent Hartree-Fock approximation, and we give an estimate for the accuracy of this approximation in terms of the kinetic energy of the system. This leads, in turn, to bounds in terms of the initial total energy of the system.
AU - Bach, Volker
AU - Breteaux, Sébastien
AU - Petrat, Sören P
AU - Pickl, Peter
AU - Tzaneteas, Tim
ID - 1436
IS - 1
JF - Journal de Mathématiques Pures et Appliquées
TI - Kinetic energy estimates for the accuracy of the time-dependent Hartree-Fock approximation with Coulomb interaction
VL - 105
ER -
TY - CONF
AB - In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: (a) qualitative ones that ask (i) whether the program terminates with probability 1 (almost-sure termination) and (ii) whether the expected termination time is finite (finite termination); (b) quantitative ones that ask (i) to approximate the expected termination time (expectation problem) and (ii) to compute a bound B such that the probability to terminate after B steps decreases exponentially (concentration problem). To solve these questions, we utilize the notion of ranking supermartingales which is a powerful approach for proving termination of probabilistic programs. In detail, we focus on algorithmic synthesis of linear ranking-supermartingales over affine probabilistic programs (APP's) with both angelic and demonic non-determinism. An important subclass of APP's is LRAPP which is defined as the class of all APP's over which a linear ranking-supermartingale exists. Our main contributions are as follows. Firstly, we show that the membership problem of LRAPP (i) can be decided in polynomial time for APP's with at most demonic non-determinism, and (ii) is NP-hard and in PSPACE for APP's with angelic non-determinism; moreover, the NP-hardness result holds already for APP's without probability and demonic non-determinism. Secondly, we show that the concentration problem over LRAPP can be solved in the same complexity as for the membership problem of LRAPP. Finally, we show that the expectation problem over LRAPP can be solved in 2EXPTIME and is PSPACE-hard even for APP's without probability and non-determinism (i.e., deterministic programs). Our experimental results demonstrate the effectiveness of our approach to answer the qualitative and quantitative questions over APP's with at most demonic non-determinism.
AU - Chatterjee, Krishnendu
AU - Fu, Hongfei
AU - Novotny, Petr
AU - Hasheminezhad, Rouzbeh
ID - 1438
TI - Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
VL - 20-22
ER -
TY - CONF
AB - Fault-tolerant distributed algorithms play an important role in many critical/high-availability applications. These algorithms are notoriously difficult to implement correctly, due to asynchronous communication and the occurrence of faults, such as the network dropping messages or computers crashing. We introduce PSYNC, a domain specific language based on the Heard-Of model, which views asynchronous faulty systems as synchronous ones with an adversarial environment that simulates asynchrony and faults by dropping messages. We define a runtime system for PSYNC that efficiently executes on asynchronous networks. We formalize the relation between the runtime system and PSYNC in terms of observational refinement. The high-level lockstep abstraction introduced by PSYNC simplifies the design and implementation of fault-tolerant distributed algorithms and enables automated formal verification. We have implemented an embedding of PSYNC in the SCALA programming language with a runtime system for asynchronous networks. We show the applicability of PSYNC by implementing several important fault-tolerant distributed algorithms and we compare the implementation of consensus algorithms in PSYNC against implementations in other languages in terms of code size, runtime efficiency, and verification.
AU - Dragoi, Cezara
AU - Henzinger, Thomas A
AU - Zufferey, Damien
ID - 1439
TI - PSYNC: A partially synchronous language for fault-tolerant distributed algorithms
VL - 20-22
ER -
TY - JOUR
AU - Janovjak, Harald L
ID - 1440
IS - 2
JF - Structure
TI - Light at the end of the protein: Crystal structure of a C-terminal light-sensing domain
VL - 24
ER -
TY - JOUR
AB - Optogenetics and photopharmacology enable the spatio-temporal control of cell and animal behavior by light. Although red light offers deep-tissue penetration and minimal phototoxicity, very few red-light-sensitive optogenetic methods are currently available. We have now developed a red-light-induced homodimerization domain. We first showed that an optimized sensory domain of the cyanobacterial phytochrome 1 can be expressed robustly and without cytotoxicity in human cells. We then applied this domain to induce the dimerization of two receptor tyrosine kinases—the fibroblast growth factor receptor 1 and the neurotrophin receptor trkB. This new optogenetic method was then used to activate the MAPK/ERK pathway non-invasively in mammalian tissue and in multicolor cell-signaling experiments. The light-controlled dimerizer and red-light-activated receptor tyrosine kinases will prove useful to regulate a variety of cellular processes with light. Go deep with red: The sensory domain (S) of the cyanobacterial phytochrome 1 (CPH1) was repurposed to induce the homodimerization of proteins in living cells by red light. By using this domain, light-activated protein kinases were engineered that can be activated orthogonally from many fluorescent proteins and through mammalian tissue. Pr/Pfr=red-/far-red-absorbing state of CPH1.
AU - Gschaider-Reichhart, Eva
AU - Inglés Prieto, Álvaro
AU - Tichy, Alexandra-Madelaine
AU - Mckenzie, Catherine
AU - Janovjak, Harald L
ID - 1441
IS - 21
JF - Angewandte Chemie - International Edition
TI - A phytochrome sensory domain permits receptor activation by red light
VL - 55
ER -
TY - JOUR
AB - The accuracy of interdisciplinarity measurements is directly related to the quality of the underlying bibliographic data. Existing indicators of interdisciplinarity are not capable of reflecting the inaccuracies introduced by incorrect and incomplete records because correct and complete bibliographic data can rarely be obtained. This is the case for the Rao–Stirling index, which cannot handle references that are not categorized into disciplinary fields. We introduce a method that addresses this problem. It extends the Rao–Stirling index to acknowledge missing data by calculating its interval of uncertainty using computational optimization. The evaluation of our method indicates that the uncertainty interval is not only useful for estimating the inaccuracy of interdisciplinarity measurements, but it also delivers slightly more accurate aggregated interdisciplinarity measurements than the Rao–Stirling index.
AU - Calatrava Moreno, Maria
AU - Auzinger, Thomas
AU - Werthner, Hannes
ID - 1446
IS - 1
JF - Scientometrics
TI - On the uncertainty of interdisciplinarity measurements due to incomplete bibliographic data
VL - 107
ER -
TY - JOUR
AB - We develop a new and systematic method for proving entropic Ricci curvature lower bounds for Markov chains on discrete sets. Using different methods, such bounds have recently been obtained in several examples (e.g., 1-dimensional birth and death chains, product chains, Bernoulli–Laplace models, and random transposition models). However, a general method to obtain discrete Ricci bounds had been lacking. Our method covers all of the examples above. In addition we obtain new Ricci curvature bounds for zero-range processes on the complete graph. The method is inspired by recent work of Caputo, Dai Pra and Posta on discrete functional inequalities.
AU - Fathi, Max
AU - Maas, Jan
ID - 1448
IS - 3
JF - The Annals of Applied Probability
TI - Entropic Ricci curvature bounds for discrete interacting systems
VL - 26
ER -
TY - JOUR
AB - The actin cytoskeleton plays important roles in the formation and internalization of endocytic vesicles. In yeast, endocytic vesicles move towards early endosomes along actin cables, however, the molecular machinery regulating interaction between endocytic vesicles and actin cables is poorly understood. The Eps15-like protein Pan1p plays a key role in actin-mediated endocytosis and is negatively regulated by Ark1 and Prk1 kinases. Here we show that pan1 mutated to prevent phosphorylation at all 18 threonines, pan1-18TA, displayed almost the same endocytic defect as ark1Δ prk1Δ cells, and contained abnormal actin concentrations including several endocytic compartments. Early endosomes were highly localized in the actin concentrations and displayed movement along actin cables. The dephosphorylated form of Pan1p also caused stable associations between endocytic vesicles and actin cables, and between endocytic vesicles and endosomes. Thus Pan1 phosphorylation is part of a novel mechanism that regulates endocytic compartment interactions with each other and with actin cables.
AU - Toshima, Junko
AU - Furuya, Eri
AU - Nagano, Makoto
AU - Kanno, Chisa
AU - Sakamoto, Yuta
AU - Ebihara, Masashi
AU - Siekhaus, Daria E
AU - Toshima, Jiro
ID - 1475
IS - February 2016
JF - eLife
TI - Yeast Eps15-like endocytic protein Pan1p regulates the interaction between endocytic vesicles, endosomes and the actin cytoskeleton
VL - 5
ER -
TY - JOUR
AB - The dynamic assembly and disassembly of actin filaments is essential for the formation and transport of vesicles during endocytosis. In yeast, two types of actin structures, namely cortical patches and cytoplasmic cables, play a direct role in endocytosis, but how their interaction is regulated remains unclear. Here, we show that Srv2/CAP, an evolutionarily conserved actin regulator, is required for efficient endocytosis owing to its role in the formation of the actin patches that aid initial vesicle invagination and of the actin cables that these move along. Deletion of the SRV2 gene resulted in the appearance of aberrant fragmented actin cables that frequently moved past actin patches, the sites of endocytosis. We find that the C-terminal CARP domain of Srv2p is vitally important for the proper assembly of actin patches and cables; we also demonstrate that the N-terminal helical folded domain of Srv2 is required for its localization to actin patches, specifically to the ADP-actin rich region through an interaction with cofilin. These results demonstrate the in vivo roles of Srv2p in the regulation of the actin cytoskeleton during clathrin-mediated endocytosis
AU - Toshima, Junko
AU - Horikomi, Chika
AU - Okada, Asuka
AU - Hatori, Makiko
AU - Nagano, Makoto
AU - Masuda, Atsushi
AU - Yamamoto, Wataru
AU - Siekhaus, Daria E
AU - Toshima, Jiro
ID - 1476
IS - 2
JF - Journal of Cell Science
TI - Srv2/CAP is required for polarized actin cable assembly and patch internalization during clathrin-mediated endocytosis
VL - 129
ER -
TY - JOUR
AB - We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages provides a robust specification language to express properties in verification, and parity objectives are canonical forms to express them. The qualitative analysis problem given a POMDP and a parity objective asks whether there is a strategy to ensure that the objective is satisfied with probability 1 (resp. positive probability). While the qualitative analysis problems are undecidable even for special cases of parity objectives, we establish decidability (with optimal complexity) for POMDPs with all parity objectives under finite-memory strategies. We establish optimal (exponential) memory bounds and EXPTIME-completeness of the qualitative analysis problems under finite-memory strategies for POMDPs with parity objectives. We also present a practical approach, where we design heuristics to deal with the exponential complexity, and have applied our implementation on a number of POMDP examples.
AU - Chatterjee, Krishnendu
AU - Chmelik, Martin
AU - Tracol, Mathieu
ID - 1477
IS - 5
JF - Journal of Computer and System Sciences
TI - What is decidable about partially observable Markov decision processes with ω-regular objectives
VL - 82
ER -
TY - JOUR
AB - We consider the Tonks-Girardeau gas subject to a random external potential. If the disorder is such that the underlying one-particle Hamiltonian displays localization (which is known to be generically the case), we show that there is exponential decay of correlations in the many-body eigenstates. Moreover, there is no Bose-Einstein condensation and no superfluidity, even at zero temperature.
AU - Seiringer, Robert
AU - Warzel, Simone
ID - 1478
IS - 3
JF - New Journal of Physics
TI - Decay of correlations and absence of superfluidity in the disordered Tonks-Girardeau gas
VL - 18
ER -
TY - JOUR
AB - Most entropy notions H(.) like Shannon or min-entropy satisfy a chain rule stating that for random variables X,Z, and A we have H(X|Z,A)≥H(X|Z)−|A|. That is, by conditioning on A the entropy of X can decrease by at most the bitlength |A| of A. Such chain rules are known to hold for some computational entropy notions like Yao’s and unpredictability-entropy. For HILL entropy, the computational analogue of min-entropy, the chain rule is of special interest and has found many applications, including leakage-resilient cryptography, deterministic encryption, and memory delegation. These applications rely on restricted special cases of the chain rule. Whether the chain rule for conditional HILL entropy holds in general was an open problem for which we give a strong negative answer: we construct joint distributions (X,Z,A), where A is a distribution over a single bit, such that the HILL entropy H HILL (X|Z) is large but H HILL (X|Z,A) is basically zero.
Our counterexample just makes the minimal assumption that NP⊈P/poly. Under the stronger assumption that injective one-way function exist, we can make all the distributions efficiently samplable.
Finally, we show that some more sophisticated cryptographic objects like lossy functions can be used to sample a distribution constituting a counterexample to the chain rule making only a single invocation to the underlying object.
AU - Krenn, Stephan
AU - Pietrzak, Krzysztof Z
AU - Wadia, Akshay
AU - Wichs, Daniel
ID - 1479
IS - 3
JF - Computational Complexity
TI - A counterexample to the chain rule for conditional HILL entropy
VL - 25
ER -
TY - JOUR
AB - Exponential varieties arise from exponential families in statistics. These real algebraic varieties have strong positivity and convexity properties, familiar from toric varieties and their moment maps. Among them are varieties of inverses of symmetric matrices satisfying linear constraints. This class includes Gaussian graphical models. We develop a general theory of exponential varieties. These are derived from hyperbolic polynomials and their integral representations. We compare the multidegrees and ML degrees of the gradient map for hyperbolic polynomials.
AU - Michałek, Mateusz
AU - Sturmfels, Bernd
AU - Uhler, Caroline
AU - Zwiernik, Piotr
ID - 1480
IS - 1
JF - Proceedings of the London Mathematical Society
TI - Exponential varieties
VL - 112
ER -
TY - JOUR
AB - Plants have the ability to continously generate new organs by maintaining populations of stem cells throught their lives. The shoot apical meristem (SAM) provides a stable environment for the maintenance of stem cells. All cells inside the SAM divide, yet boundaries and patterns are maintained. Experimental evidence indicates that patterning is independent of cell lineage, thus a dynamic self-regulatory mechanism is required. A pivotal role in the organization of the SAM is played by the WUSCHEL gene (WUS). An important question in this regard is that how WUS expression is positioned in the SAM via a cell-lineage independent signaling mechanism. In this study we demonstrate via mathematical modeling that a combination of an inhibitor of the Cytokinin (CK) receptor, Arabidopsis histidine kinase 4 (AHK4) and two morphogens originating from the top cell layer, can plausibly account for the cell lineage-independent centering of WUS expression within SAM. Furthermore, our laser ablation and microsurgical experiments support the hypothesis that patterning in SAM occurs at the level of CK reception and signaling. The model suggests that the interplay between CK signaling, WUS/CLV feedback loop and boundary signals can account for positioning of the WUS expression, and provides directions for further experimental investigation.
AU - Adibi, Milad
AU - Yoshida, Saiko
AU - Weijers, Dolf
AU - Fleck, Christian
ID - 1482
IS - 2
JF - PLoS One
TI - Centering the organizing center in the Arabidopsis thaliana shoot apical meristem by a combination of cytokinin signaling and self-organization
VL - 11
ER -
TY - JOUR
AU - Chen, Xu
AU - Wu, Shuang
AU - Liu, Zengyu
AU - Friml, Jiřĺ
ID - 1484
IS - 6
JF - Trends in Cell Biology
TI - Environmental and endogenous control of cortical microtubule orientation
VL - 26
ER -
TY - JOUR
AB - In this article the notion of metabolic turnover is revisited in the light of recent results of out-of-equilibrium thermodynamics. By means of Monte Carlo methods we perform an exact sampling of the enzymatic fluxes in a genome scale metabolic network of E. Coli in stationary growth conditions from which we infer the metabolites turnover times. However the latter are inferred from net fluxes, and we argue that this approximation is not valid for enzymes working nearby thermodynamic equilibrium. We recalculate turnover times from total fluxes by performing an energy balance analysis of the network and recurring to the fluctuation theorem. We find in many cases values one of order of magnitude lower, implying a faster picture of intermediate metabolism.
AU - De Martino, Daniele
ID - 1485
IS - 1
JF - Physical Biology
TI - Genome-scale estimate of the metabolic turnover of E. Coli from the energy balance analysis
VL - 13
ER -
TY - JOUR
AB - We review recent results concerning the mathematical properties of the Bardeen-Cooper-Schrieffer (BCS) functional of superconductivity, which were obtained in a series of papers, partly in collaboration with R. Frank, E. Hamza, S. Naboko, and J. P. Solovej. Our discussion includes, in particular, an investigation of the critical temperature for a general class of interaction potentials, as well as a study of its dependence on external fields. We shall explain how the Ginzburg-Landau model can be derived from the BCS theory in a suitable parameter regime.
AU - Hainzl, Christian
AU - Seiringer, Robert
ID - 1486
IS - 2
JF - Journal of Mathematical Physics
TI - The Bardeen–Cooper–Schrieffer functional of superconductivity and its mathematical properties
VL - 57
ER -
TY - JOUR
AB - Rhythms with time scales of multiple cycles per second permeate the mammalian brain, yet neuroscientists are not certain of their functional roles. One leading idea is that coherent oscillation between two brain regions facilitates the exchange of information between them. In rats, the hippocampus and the vibrissal sensorimotor system both are characterized by rhythmic oscillation in the theta range, 5–12 Hz. Previous work has been divided as to whether the two rhythms are independent or coherent. To resolve this question, we acquired three measures from rats—whisker motion, hippocampal local field potential (LFP), and barrel cortex unit firing—during a whisker-mediated texture discrimination task and during control conditions (not engaged in a whisker-mediated memory task). Compared to control conditions, the theta band of hippocampal LFP showed a marked increase in power as the rats approached and then palpated the texture. Phase synchronization between whisking and hippocampal LFP increased by almost 50% during approach and texture palpation. In addition, a greater proportion of barrel cortex neurons showed firing that was phase-locked to hippocampal theta while rats were engaged in the discrimination task. Consistent with a behavioral consequence of phase synchronization, the rats identified the texture more rapidly and with lower error likelihood on trials in which there was an increase in theta-whisking coherence at the moment of texture palpation. These results suggest that coherence between the whisking rhythm, barrel cortex firing, and hippocampal LFP is augmented selectively during epochs in which the rat collects sensory information and that such coherence enhances the efficiency of integration of stimulus information into memory and decision-making centers.
AU - Grion, Natalia
AU - Akrami, Athena
AU - Zuo, Yangfang
AU - Stella, Federico
AU - Diamond, Mathew
ID - 1487
IS - 2
JF - PLoS Biology
TI - Coherence between rat sensorimotor system and hippocampus is enhanced during tactile discrimination
VL - 14
ER -
TY - JOUR
AB - Branching morphogenesis of the epithelial ureteric bud forms the renal collecting duct system and is critical for normal nephron number, while low nephron number is implicated in hypertension and renal disease. Ureteric bud growth and branching requires GDNF signaling from the surrounding mesenchyme to cells at the ureteric bud tips, via the Ret receptor tyrosine kinase and coreceptor Gfrα1; Ret signaling up-regulates transcription factors Etv4 and Etv5, which are also critical for branching. Despite extensive knowledge of the genetic control of these events, it is not understood, at the cellular level, how renal branching morphogenesis is achieved or how Ret signaling influences epithelial cell behaviors to promote this process. Analysis of chimeric embryos previously suggested a role for Ret signaling in promoting cell rearrangements in the nephric duct, but this method was unsuited to study individual cell behaviors during ureteric bud branching. Here, we use Mosaic Analysis with Double Markers (MADM), combined with organ culture and time-lapse imaging, to trace the movements and divisions of individual ureteric bud tip cells. We first examine wild-type clones and then Ret or Etv4 mutant/wild-type clones in which the mutant and wild-type sister cells are differentially and heritably marked by green and red fluorescent proteins. We find that, in normal kidneys, most individual tip cells behave as self-renewing progenitors, some of whose progeny remain at the tips while others populate the growing UB trunks. In Ret or Etv4 MADM clones, the wild-type cells generated at a UB tip are much more likely to remain at, or move to, the new tips during branching and elongation, while their Ret−/− or Etv4−/− sister cells tend to lag behind and contribute only to the trunks. By tracking successive mitoses in a cell lineage, we find that Ret signaling has little effect on proliferation, in contrast to its effects on cell movement. Our results show that Ret/Etv4 signaling promotes directed cell movements in the ureteric bud tips, and suggest a model in which these cell movements mediate branching morphogenesis.
AU - Riccio, Paul
AU - Cebrián, Cristina
AU - Zong, Hui
AU - Hippenmeyer, Simon
AU - Costantini, Frank
ID - 1488
IS - 2
JF - PLoS Biology
TI - Ret and Etv4 promote directed movements of progenitor cells during renal branching morphogenesis
VL - 14
ER -
TY - JOUR
AB - We prove optimal local law, bulk universality and non-trivial decay for the off-diagonal elements of the resolvent for a class of translation invariant Gaussian random matrix ensembles with correlated entries.
AU - Ajanki, Oskari H
AU - Erdös, László
AU - Krüger, Torben H
ID - 1489
IS - 2
JF - Journal of Statistical Physics
TI - Local spectral statistics of Gaussian matrices with correlated entries
VL - 163
ER -
TY - JOUR
AB - To induce adaptive immunity, dendritic cells (DCs) migrate through afferent lymphatic vessels (LVs) to draining lymph nodes (dLNs). This process occurs in several consecutive steps. Upon entry into lymphatic capillaries, DCs first actively crawl into downstream collecting vessels. From there, they are next passively and rapidly transported to the dLN by lymph flow. Here, we describe a role for the chemokine CCL21 in intralymphatic DC crawling. Performing time-lapse imaging in murine skin, we found that blockade of CCL21-but not the absence of lymph flow-completely abolished DC migration from capillaries toward collecting vessels and reduced the ability of intralymphatic DCs to emigrate from skin. Moreover, we found that in vitro low laminar flow established a CCL21 gradient along lymphatic endothelial monolayers, thereby inducing downstream-directed DC migration. These findings reveal a role for intralymphatic CCL21 in promoting DC trafficking to dLNs, through the formation of a flow-induced gradient.
AU - Russo, Erica
AU - Teijeira, Alvaro
AU - Vaahtomeri, Kari
AU - Willrodt, Ann
AU - Bloch, Joël
AU - Nitschké, Maximilian
AU - Santambrogio, Laura
AU - Kerjaschki, Dontscho
AU - Sixt, Michael K
AU - Halin, Cornelia
ID - 1490
IS - 7
JF - Cell Reports
TI - Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels
VL - 14
ER -
TY - JOUR
AB - We study the ground state of a trapped Bose gas, starting from the full many-body Schrödinger Hamiltonian, and derive the non-linear Schrödinger energy functional in the limit of a large particle number, when the interaction potential converges slowly to a Dirac delta function. Our method is based on quantitative estimates on the discrepancy between the full many-body energy and its mean-field approximation using Hartree states. These are proved using finite dimensional localization and a quantitative version of the quantum de Finetti theorem. Our approach covers the case of attractive interactions in the regime of stability. In particular, our main new result is a derivation of the 2D attractive non-linear Schrödinger ground state.
AU - Lewin, Mathieu
AU - Nam, Phan
AU - Rougerie, Nicolas
ID - 1491
IS - 9
JF - Transactions of the American Mathematical Society
TI - The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases
VL - 368
ER -
TY - JOUR
AB - To sustain a lifelong ability to initiate organs, plants retain pools of undifferentiated cells with a preserved prolif eration capacity. The root pericycle represents a unique tissue with conditional meristematic activity, and its tight control determines initiation of lateral organs. Here we show that the meristematic activity of the pericycle is constrained by the interaction with the adjacent endodermis. Release of these restraints by elimination of endo dermal cells by single-cell ablation triggers the pericycle to re-enter the cell cycle. We found that endodermis removal substitutes for the phytohormone auxin-dependent initiation of the pericycle meristematic activity. However, auxin is indispensable to steer the cell division plane orientation of new organ-defining divisions. We propose a dual, spatiotemporally distinct role for auxin during lateral root initiation. In the endodermis, auxin releases constraints arising from cell-to-cell interactions that compromise the pericycle meristematic activity, whereas, in the pericycle, auxin defines the orientation of the cell division plane to initiate lateral roots.
AU - Marhavy, Peter
AU - Montesinos López, Juan C
AU - Abuzeineh, Anas
AU - Van Damme, Daniël
AU - Vermeer, Joop
AU - Duclercq, Jérôme
AU - Rakusova, Hana
AU - Marhavá, Petra
AU - Friml, Jirí
AU - Geldner, Niko
AU - Benková, Eva
ID - 1492
IS - 4
JF - Genes and Development
TI - Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation
VL - 30
ER -
TY - JOUR
AB - We introduce a new method for deriving the time-dependent Hartree or Hartree-Fock equations as an effective mean-field dynamics from the microscopic Schrödinger equation for fermionic many-particle systems in quantum mechanics. The method is an adaption of the method used in Pickl (Lett. Math. Phys. 97 (2) 151–164 2011) for bosonic systems to fermionic systems. It is based on a Gronwall type estimate for a suitable measure of distance between the microscopic solution and an antisymmetrized product state. We use this method to treat a new mean-field limit for fermions with long-range interactions in a large volume. Some of our results hold for singular attractive or repulsive interactions. We can also treat Coulomb interaction assuming either a mild singularity cutoff or certain regularity conditions on the solutions to the Hartree(-Fock) equations. In the considered limit, the kinetic and interaction energy are of the same order, while the average force is subleading. For some interactions, we prove that the Hartree(-Fock) dynamics is a more accurate approximation than a simpler dynamics that one would expect from the subleading force. With our method we also treat the mean-field limit coupled to a semiclassical limit, which was discussed in the literature before, and we recover some of the previous results. All results hold for initial data close (but not necessarily equal) to antisymmetrized product states and we always provide explicit rates of convergence.
AU - Petrat, Sören P
AU - Pickl, Peter
ID - 1493
IS - 1
JF - Mathematical Physics, Analysis and Geometry
TI - A new method and a new scaling for deriving fermionic mean-field dynamics
VL - 19
ER -
TY - JOUR
AB - Turbulence is one of the most frequently encountered non-equilibrium phenomena in nature, yet characterizing the transition that gives rise to turbulence in basic shear flows has remained an elusive task. Although, in recent studies, critical points marking the onset of sustained turbulence have been determined for several such flows, the physical nature of the transition could not be fully explained. In extensive experimental and computational studies we show for the example of Couette flow that the onset of turbulence is a second-order phase transition and falls into the directed percolation universality class. Consequently, the complex laminar–turbulent patterns distinctive for the onset of turbulence in shear flows result from short-range interactions of turbulent domains and are characterized by universal critical exponents. More generally, our study demonstrates that even high-dimensional systems far from equilibrium such as turbulence exhibit universality at onset and that here the collective dynamics obeys simple rules.
AU - Lemoult, Grégoire M
AU - Shi, Liang
AU - Avila, Kerstin
AU - Jalikop, Shreyas V
AU - Avila, Marc
AU - Hof, Björn
ID - 1494
IS - 3
JF - Nature Physics
TI - Directed percolation phase transition to sustained turbulence in Couette flow
VL - 12
ER -
TY - JOUR
AB - The two-photon 1s2 2s 2p 3P0 1s22s2 1S0 transition in berylliumlike ions is theoretically investigated within a fully relativistic framework and a second-order perturbation theory. We focus our analysis on how electron correlation, as well as the negative-energy spectrum, can affect the forbidden E1M1 decay rate. For this purpose, we include the electronic correlation via an effective local potential and within a single configuration-state model. Due to its experimental interest, evaluations of decay rates are performed for berylliumlike xenon and uranium. We find that the negative-energy contribution can be neglected at the present level of accuracy in the evaluation of the decay rate. On the other hand, if contributions of electronic correlation are not carefully taken into account, it may change the lifetime of the metastable state by up to 20%. By performing a full-relativistic jj-coupling calculation, we found a decrease of the decay rate by two orders of magnitude compared to non-relativistic LS-coupling calculations, for the selected heavy ions.
AU - Amaro, Pedro
AU - Fratini, Filippo
AU - Safari, Laleh
AU - Machado, Jorge
AU - Guerra, Mauro
AU - Indelicato, Paul
AU - Santos, José
ID - 1496
IS - 3
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model
VL - 93
ER -
TY - JOUR
AB - Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy production, coupling electron transfer between NADH and quinone to proton translocation. It is the largest protein assembly of respiratory chains and one of the most elaborate redox membrane proteins known. Bacterial enzyme is about half the size of mitochondrial and thus provides its important "minimal" model. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The L-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. We have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus, the membrane domain from Escherichia coli and recently of the intact, entire complex I from T. thermophilus (536. kDa, 16 subunits, 9 iron-sulphur clusters, 64 transmembrane helices). The 95. Å long electron transfer pathway through the enzyme proceeds from the primary electron acceptor flavin mononucleotide through seven conserved Fe-S clusters to the unusual elongated quinone-binding site at the interface with the membrane domain. Four putative proton translocation channels are found in the membrane domain, all linked by the central flexible axis containing charged residues. The redox energy of electron transfer is coupled to proton translocation by the as yet undefined mechanism proposed to involve long-range conformational changes. This article is part of a Special Issue entitled Respiratory complex I, edited by Volker Zickermann and Ulrich Brandt.
AU - Berrisford, John
AU - Baradaran, Rozbeh
AU - Sazanov, Leonid A
ID - 1521
IS - 7
JF - Biochimica et Biophysica Acta - Bioenergetics
TI - Structure of bacterial respiratory complex I
VL - 1857
ER -
TY - JOUR
AB - We classify smooth Brunnian (i.e., unknotted on both components) embeddings (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to an explicitly constructed embedding fk,m,n for some integers k, m, n such that m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2 × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such that the componentwise embedded connected sum f # g is isotopic to f # g′ but g is not isotopic to g′.
AU - Avvakumov, Serhii
ID - 1522
IS - 1
JF - Moscow Mathematical Journal
TI - The classification of certain linked 3-manifolds in 6-space
VL - 16
ER -
TY - JOUR
AB - For random graphs, the containment problem considers the probability that a binomial random graph G(n, p) contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well known that the (sharp) threshold is at p = 1/n. We consider a natural analogue of this question for higher-dimensional random complexes Xk(n, p), first studied by Cohen, Costa, Farber and Kappeler for k = 2. Improving previous results, we show that p = Θ(1/ √n) is the (coarse) threshold for containing a subdivision of any fixed complete 2-complex. For higher dimensions k > 2, we get that p = O(n−1/k) is an upper bound for the threshold probability of containing a subdivision of a fixed k-dimensional complex.
AU - Gundert, Anna
AU - Wagner, Uli
ID - 1523
IS - 4
JF - Proceedings of the American Mathematical Society
TI - On topological minors in random simplicial complexes
VL - 144
ER -
TY - CONF
AB - When designing genetic circuits, the typical primitives used in major existing modelling formalisms are gene interaction graphs, where edges between genes denote either an activation or inhibition relation. However, when designing experiments, it is important to be precise about the low-level mechanistic details as to how each such relation is implemented. The rule-based modelling language Kappa allows to unambiguously specify mechanistic details such as DNA binding sites, dimerisation of transcription factors, or co-operative interactions. Such a detailed description comes with complexity and computationally costly executions. We propose a general method for automatically transforming a rule-based program, by eliminating intermediate species and adjusting the rate constants accordingly. To the best of our knowledge, we show the first automated reduction of rule-based models based on equilibrium approximations.
Our algorithm is an adaptation of an existing algorithm, which was designed for reducing reaction-based programs; our version of the algorithm scans the rule-based Kappa model in search for those interaction patterns known to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional checks are then performed in order to verify if the reduction is meaningful in the context of the full model. The reduced model is efficiently obtained by static inspection over the rule-set. The tool is tested on a detailed rule-based model of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has 11 rules and 5 agents, and provides a dramatic reduction in simulation time of several orders of magnitude.
AU - Beica, Andreea
AU - Guet, Calin C
AU - Petrov, Tatjana
ID - 1524
TI - Efficient reduction of kappa models by static inspection of the rule-set
VL - 9271
ER -
TY - CONF
AB - We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems — timed transducers and asynchronous sequential circuits. We show that K-robustness of timed transducers can be decided in polynomial space under certain conditions. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete letter-to-letter transducers and show PSpace-completeness of the problem.
AU - Henzinger, Thomas A
AU - Otop, Jan
AU - Samanta, Roopsha
ID - 1526
TI - Lipschitz robustness of timed I/O systems
VL - 9583
ER -
TY - JOUR
AB - We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest.
AU - Chatterjee, Krishnendu
AU - Chmelik, Martin
AU - Gupta, Raghav
AU - Kanodia, Ayush
ID - 1529
JF - Artificial Intelligence
TI - Optimal cost almost-sure reachability in POMDPs
VL - 234
ER -
TY - JOUR
AB - Feedback loops in biological networks, among others, enable differentiation and cell cycle progression, and increase robustness in signal transduction. In natural networks, feedback loops are often complex and intertwined, making it challenging to identify which loops are mainly responsible for an observed behavior. However, minimal synthetic replicas could allow for such identification. Here, we engineered a synthetic permease-inducer-repressor system in Saccharomyces cerevisiae to analyze if a transport-mediated positive feedback loop could be a core mechanism for the switch-like behavior in the regulation of metabolic gene networks such as the S. cerevisiae GAL system or the Escherichia coli lac operon. We characterized the synthetic circuit using deterministic and stochastic mathematical models. Similar to its natural counterparts, our synthetic system shows bistable and hysteretic behavior, and the inducer concentration range for bistability as well as the switching rates between the two stable states depend on the repressor concentration. Our results indicate that a generic permease–inducer–repressor circuit with a single feedback loop is sufficient to explain the experimentally observed bistable behavior of the natural systems. We anticipate that the approach of reimplementing natural systems with orthogonal parts to identify crucial network components is applicable to other natural systems such as signaling pathways.
AU - Gnügge, Robert
AU - Dharmarajan, Lekshmi
AU - Lang, Moritz
AU - Stelling, Jörg
ID - 1008
IS - 10
JF - ACS Synthetic Biology
TI - An orthogonal permease–inducer–repressor feedback loop shows bistability
VL - 5
ER -
TY - JOUR
AB - The discovery of introns four decades ago was one of the most unexpected findings in molecular biology. Introns are sequences interrupting genes that must be removed as part of messenger RNA production. Genome sequencing projects have shown that most eukaryotic genes contain at least one intron, and frequently many. Comparison of these genomes reveals a history of long evolutionary periods during which few introns were gained, punctuated by episodes of rapid, extensive gain. However, although several detailed mechanisms for such episodic intron generation have been proposed, none has been empirically supported on a genomic scale. Here we show how short, non-autonomous DNA transposons independently generated hundreds to thousands of introns in the prasinophyte Micromonas pusilla and the pelagophyte Aureococcus anophagefferens. Each transposon carries one splice site. The other splice site is co-opted from the gene sequence that is duplicated upon transposon insertion, allowing perfect splicing out of the RNA. The distributions of sequences that can be co-opted are biased with respect to codons, and phasing of transposon-generated introns is similarly biased. These transposons insert between pre-existing nucleosomes, so that multiple nearby insertions generate nucleosome-sized intervening segments. Thus, transposon insertion and sequence co-option may explain the intron phase biases and prevalence of nucleosome-sized exons observed in eukaryotes. Overall, the two independent examples of proliferating elements illustrate a general DNA transposon mechanism that can plausibly account for episodes of rapid, extensive intron gain during eukaryotic evolution.
AU - Huff, Jason T.
AU - Zilberman, Daniel
AU - Roy, Scott W.
ID - 9456
IS - 7626
JF - Nature
SN - 0028-0836
TI - Mechanism for DNA transposons to generate introns on genomic scales
VL - 538
ER -
TY - JOUR
AB - Cytosine DNA methylation regulates the expression of eukaryotic genes and transposons. Methylation is copied by methyltransferases after DNA replication, which results in faithful transmission of methylation patterns during cell division and, at least in flowering plants, across generations. Transgenerational inheritance is mediated by a small group of cells that includes gametes and their progenitors. However, methylation is usually analyzed in somatic tissues that do not contribute to the next generation, and the mechanisms of transgenerational inheritance are inferred from such studies. To gain a better understanding of how DNA methylation is inherited, we analyzed purified Arabidopsis thaliana sperm and vegetative cells-the cell types that comprise pollen-with mutations in the DRM, CMT2, and CMT3 methyltransferases. We find that DNA methylation dependency on these enzymes is similar in sperm, vegetative cells, and somatic tissues, although DRM activity extends into heterochromatin in vegetative cells, likely reflecting transcription of heterochromatic transposons in this cell type. We also show that lack of histone H1, which elevates heterochromatic DNA methylation in somatic tissues, does not have this effect in pollen. Instead, levels of CG methylation in wild-type sperm and vegetative cells, as well as in wild-type microspores from which both pollen cell types originate, are substantially higher than in wild-type somatic tissues and similar to those of H1-depleted roots. Our results demonstrate that the mechanisms of methylation maintenance are similar between pollen and somatic cells, but the efficiency of CG methylation is higher in pollen, allowing methylation patterns to be accurately inherited across generations.
AU - Hsieh, Ping-Hung
AU - He, Shengbo
AU - Buttress, Toby
AU - Gao, Hongbo
AU - Couchman, Matthew
AU - Fischer, Robert L.
AU - Zilberman, Daniel
AU - Feng, Xiaoqi
ID - 9473
IS - 52
JF - Proceedings of the National Academy of Sciences
SN - 0027-8424
TI - Arabidopsis male sexual lineage exhibits more robust maintenance of CG methylation than somatic tissues
VL - 113
ER -
TY - JOUR
AB - Cytosine methylation is a DNA modification with important regulatory functions in eukaryotes. In flowering plants, sexual reproduction is accompanied by extensive DNA demethylation, which is required for proper gene expression in the endosperm, a nutritive extraembryonic seed tissue. Endosperm arises from a fusion of a sperm cell carried in the pollen and a female central cell. Endosperm DNA demethylation is observed specifically on the chromosomes inherited from the central cell in Arabidopsis thaliana, rice, and maize, and requires the DEMETER DNA demethylase in Arabidopsis. DEMETER is expressed in the central cell before fertilization, suggesting that endosperm demethylation patterns are inherited from the central cell. Down-regulation of the MET1 DNA methyltransferase has also been proposed to contribute to central cell demethylation. However, with the exception of three maize genes, central cell DNA methylation has not been directly measured, leaving the origin and mechanism of endosperm demethylation uncertain. Here, we report genome-wide analysis of DNA methylation in the central cells of Arabidopsis and rice—species that diverged 150 million years ago—as well as in rice egg cells. We find that DNA demethylation in both species is initiated in central cells, which requires DEMETER in Arabidopsis. However, we do not observe a global reduction of CG methylation that would be indicative of lowered MET1 activity; on the contrary, CG methylation efficiency is elevated in female gametes compared with nonsexual tissues. Our results demonstrate that locus-specific, active DNA demethylation in the central cell is the origin of maternal chromosome hypomethylation in the endosperm.
AU - Park, Kyunghyuk
AU - Kim, M. Yvonne
AU - Vickers, Martin
AU - Park, Jin-Sup
AU - Hyun, Youbong
AU - Okamoto, Takashi
AU - Zilberman, Daniel
AU - Fischer, Robert L.
AU - Feng, Xiaoqi
AU - Choi, Yeonhee
AU - Scholten, Stefan
ID - 9477
IS - 52
JF - Proceedings of the National Academy of Sciences
KW - Multidisciplinary
SN - 0027-8424
TI - DNA demethylation is initiated in the central cells of Arabidopsis and rice
VL - 113
ER -
TY - CONF
AB - Experience constantly shapes neural circuits through a variety of plasticity mechanisms. While the functional roles of some plasticity mechanisms are well-understood, it remains unclear how changes in neural excitability contribute to learning. Here, we develop a normative interpretation of intrinsic plasticity (IP) as a key component of unsupervised learning. We introduce a novel generative mixture model that accounts for the class-specific statistics of stimulus intensities, and we derive a neural circuit that learns the input classes and their intensities. We will analytically show that inference and learning for our generative model can be achieved by a neural circuit with intensity-sensitive neurons equipped with a specific form of IP. Numerical experiments verify our analytical derivations and show robust behavior for artificial and natural stimuli. Our results link IP to non-trivial input statistics, in particular the statistics of stimulus intensities for classes to which a neuron is sensitive. More generally, our work paves the way toward new classification algorithms that are robust to intensity variations.
AU - Monk, Travis
AU - Savin, Cristina
AU - Lücke, Jörg
ID - 948
TI - Neurons equipped with intrinsic plasticity learn stimulus intensity statistics
VL - 29
ER -
TY - GEN
AB - Emerging infectious diseases (EIDs) have contributed significantly to the current biodiversity crisis, leading to widespread epidemics and population loss. Owing to genetic variation in pathogen virulence, a complete understanding of species decline requires the accurate identification and characterization of EIDs. We explore this issue in the Western honeybee, where increasing mortality of populations in the Northern Hemisphere has caused major concern. Specifically, we investigate the importance of genetic identity of the main suspect in mortality, deformed wing virus (DWV), in driving honeybee loss. Using laboratory experiments and a systematic field survey, we demonstrate that an emerging DWV genotype (DWV-B) is more virulent than the established DWV genotype (DWV-A) and is widespread in the landscape. Furthermore, we show in a simple model that colonies infected with DWV-B collapse sooner than colonies infected with DWV-A. We also identify potential for rapid DWV evolution by revealing extensive genome-wide recombination in vivo. The emergence of DWV-B in naive honeybee populations, including via recombination with DWV-A, could be of significant ecological and economic importance. Our findings emphasize that knowledge of pathogen genetic identity and diversity is critical to understanding drivers of species decline.
AU - Mcmahon, Dino
AU - Natsopoulou, Myrsini
AU - Doublet, Vincent
AU - Fürst, Matthias
AU - Weging, Silvio
AU - Brown, Mark
AU - Gogol Döring, Andreas
AU - Paxton, Robert
ID - 9704
TI - Data from: Elevated virulence of an emerging viral genotype as a driver of honeybee loss
ER -
TY - GEN
AB - Much of quantitative genetics is based on the ‘infinitesimal model’, under which selection has a negligible effect on the genetic variance. This is typically justified by assuming a very large number of loci with additive effects. However, it applies even when genes interact, provided that the number of loci is large enough that selection on each of them is weak relative to random drift. In the long term, directional selection will change allele frequencies, but even then, the effects of epistasis on the ultimate change in trait mean due to selection may be modest. Stabilising selection can maintain many traits close to their optima, even when the underlying alleles are weakly selected. However, the number of traits that can be optimised is apparently limited to ~4Ne by the ‘drift load’, and this is hard to reconcile with the apparent complexity of many organisms. Just as for the mutation load, this limit can be evaded by a particular form of negative epistasis. A more robust limit is set by the variance in reproductive success. This suggests that selection accumulates information most efficiently in the infinitesimal regime, when selection on individual alleles is weak, and comparable with random drift. A review of evidence on selection strength suggests that although most variance in fitness may be because of alleles with large Nes, substantial amounts of adaptation may be because of alleles in the infinitesimal regime, in which epistasis has modest effects.
AU - Barton, Nicholas H
ID - 9710
TI - Data from: How does epistasis influence the response to selection?
ER -
TY - GEN
AB - Summary: Declining populations of bee pollinators are a cause of concern, with major repercussions for biodiversity loss and food security. RNA viruses associated with honeybees represent a potential threat to other insect pollinators, but the extent of this threat is poorly understood. This study aims to attain a detailed understanding of the current and ongoing risk of emerging infectious disease (EID) transmission between managed and wild pollinator species across a wide range of RNA viruses. Within a structured large-scale national survey across 26 independent sites, we quantify the prevalence and pathogen loads of multiple RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee (Bombus spp.) populations. We then construct models that compare virus prevalence between wild and managed pollinators. Multiple RNA viruses associated with honeybees are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees is a significant predictor of virus prevalence in bumblebees, but we remain cautious in speculating over the principle direction of pathogen transmission. We demonstrate species-specific differences in prevalence, indicating significant variation in disease susceptibility or tolerance. Pathogen loads within individual bumblebees may be high and in the case of at least one RNA virus, prevalence is higher in wild bumblebees than in managed honeybee populations. Our findings indicate widespread transmission of RNA viruses between managed and wild bee pollinators, pointing to an interconnected network of potential disease pressures within and among pollinator species. In the context of the biodiversity crisis, our study emphasizes the importance of targeting a wide range of pathogens and defining host associations when considering potential drivers of population decline.
AU - Mcmahon, Dino
AU - Fürst, Matthias
AU - Caspar, Jesicca
AU - Theodorou, Panagiotis
AU - Brown, Mark
AU - Paxton, Robert
ID - 9720
TI - Data from: A sting in the spit: widespread cross-infection of multiple RNA viruses across wild and managed bees
ER -
TY - GEN
AU - Roux, Camille
AU - Fraisse, Christelle
AU - Romiguier, Jonathan
AU - Anciaux, Youann
AU - Galtier, Nicolas
AU - Bierne, Nicolas
ID - 9862
TI - Simulation study to test the robustness of ABC in face of recent times of divergence
ER -
TY - GEN
AU - Roux, Camille
AU - Fraisse, Christelle
AU - Romiguier, Jonathan
AU - Anciaux, Youann
AU - Galtier, Nicolas
AU - Bierne, Nicolas
ID - 9863
TI - Accessions of surveyed individuals, geographic locations and summary statistics
ER -
TY - GEN
AB - Viral capsids are structurally constrained by interactions among the amino acids (AAs) of their constituent proteins. Therefore, epistasis is expected to evolve among physically interacting sites and to influence the rates of substitution. To study the evolution of epistasis, we focused on the major structural protein of the ϕX174 phage family by, first, reconstructing the ancestral protein sequences of 18 species using a Bayesian statistical framework. The inferred ancestral reconstruction differed at eight AAs, for a total of 256 possible ancestral haplotypes. For each ancestral haplotype and the extant species, we estimated, in silico, the distribution of free energies and epistasis of the capsid structure. We found that free energy has not significantly increased but epistasis has. We decomposed epistasis up to fifth order and found that higher-order epistasis sometimes compensates pairwise interactions making the free energy seem additive. The dN/dS ratio is low, suggesting strong purifying selection, and that structure is under stabilizing selection. We synthesized phages carrying ancestral haplotypes of the coat protein gene and measured their fitness experimentally. Our findings indicate that stabilizing mutations can have higher fitness, and that fitness optima do not necessarily coincide with energy minima.
AU - Fernandes Redondo, Rodrigo A
AU - de Vladar, Harold
AU - Włodarski, Tomasz
AU - Bollback, Jonathan P
ID - 9864
TI - Data from evolutionary interplay between structure, energy and epistasis in the coat protein of the ϕX174 phage family
ER -
TY - GEN
AU - Zagórski, Marcin P
AU - Burda, Zdzisław
AU - Wacław, Bartłomiej
ID - 9866
TI - ZIP-archived directory containing all data and computer programs
ER -
TY - GEN
AB - In the beginning of our experiment, subjects were asked to read a few pages on their computer screens that would explain the rules of the subsequent game. Here, we provide these instructions, translated from German.
AU - Hilbe, Christian
AU - Hagel, Kristin
AU - Milinski, Manfred
ID - 9867
TI - Experimental game instructions
ER -
TY - GEN
AB - The raw data file containing the experimental decisions of all our study subjects.
AU - Hilbe, Christian
AU - Hagel, Kristin
AU - Milinski, Manfred
ID - 9868
TI - Experimental data
ER -
TY - GEN
AB - A lower bound on the error of a positional estimator with limited positional information is derived.
AU - Hillenbrand, Patrick
AU - Gerland, Ulrich
AU - Tkačik, Gašper
ID - 9869
TI - Error bound on an estimator of position
ER -
TY - GEN
AB - The effect of noise in the input field on an Ising model is approximated. Furthermore, methods to compute positional information in an Ising model by transfer matrices and Monte Carlo sampling are outlined.
AU - Hillenbrand, Patrick
AU - Gerland, Ulrich
AU - Tkačik, Gašper
ID - 9870
TI - Computation of positional information in an Ising model
ER -
TY - GEN
AB - The positional information in a discrete morphogen field with Gaussian noise is computed.
AU - Hillenbrand, Patrick
AU - Gerland, Ulrich
AU - Tkačik, Gašper
ID - 9871
TI - Computation of positional information in a discrete morphogen field
ER -
TY - GEN
AU - Boehm, Alex
AU - Arnoldini, Markus
AU - Bergmiller, Tobias
AU - Röösli, Thomas
AU - Bigosch, Colette
AU - Ackermann, Martin
ID - 9873
TI - Quantification of the growth rate reduction as a consequence of age-specific mortality
ER -
TY - JOUR
AB - The inference of demographic history from genome data is hindered by a lack of efficient computational approaches. In particular, it has proved difficult to exploit the information contained in the distribution of genealogies across the genome. We have previously shown that the generating function (GF) of genealogies can be used to analytically compute likelihoods of demographic models from configurations of mutations in short sequence blocks (Lohse et al. 2011). Although the GF has a simple, recursive form, the size of such likelihood calculations explodes quickly with the number of individuals and applications of this framework have so far been mainly limited to small samples (pairs and triplets) for which the GF can be written by hand. Here we investigate several strategies for exploiting the inherent symmetries of the coalescent. In particular, we show that the GF of genealogies can be decomposed into a set of equivalence classes that allows likelihood calculations from nontrivial samples. Using this strategy, we automated blockwise likelihood calculations for a general set of demographic scenarios in Mathematica. These histories may involve population size changes, continuous migration, discrete divergence, and admixture between multiple populations. To give a concrete example, we calculate the likelihood for a model of isolation with migration (IM), assuming two diploid samples without phase and outgroup information. We demonstrate the new inference scheme with an analysis of two individual butterfly genomes from the sister species Heliconius melpomene rosina and H. cydno.
AU - Lohse, Konrad
AU - Chmelik, Martin
AU - Martin, Simon
AU - Barton, Nicholas H
ID - 1518
IS - 2
JF - Genetics
TI - Efficient strategies for calculating blockwise likelihoods under the coalescent
VL - 202
ER -
TY - JOUR
AB - Cytokinin is a phytohormone that is well known for its roles in numerous plant growth and developmental processes, yet it has also been linked to abiotic stress response in a less defined manner. Arabidopsis (Arabidopsis thaliana) Cytokinin Response Factor 6 (CRF6) is a cytokinin-responsive AP2/ERF-family transcription factor that, through the cytokinin signaling pathway, plays a key role in the inhibition of dark-induced senescence. CRF6 expression is also induced by oxidative stress, and here we show a novel function for CRF6 in relation to oxidative stress and identify downstream transcriptional targets of CRF6 that are repressed in response to oxidative stress. Analysis of transcriptomic changes in wild-type and crf6 mutant plants treated with H2O2 identified CRF6-dependent differentially expressed transcripts, many of which were repressed rather than induced. Moreover, many repressed genes also show decreased expression in 35S:CRF6 overexpressing plants. Together, these findings suggest that CRF6 functions largely as a transcriptional repressor. Interestingly, among the H2O2 repressed CRF6-dependent transcripts was a set of five genes associated with cytokinin processes: (signaling) ARR6, ARR9, ARR11, (biosynthesis) LOG7, and (transport) ABCG14. We have examined mutants of these cytokinin-associated target genes to reveal novel connections to oxidative stress. Further examination of CRF6-DNA interactions indicated that CRF6 may regulate its targets both directly and indirectly. Together, this shows that CRF6 functions during oxidative stress as a negative regulator to control this cytokinin-associated module of CRF6- dependent genes and establishes a novel connection between cytokinin and oxidative stress response.
AU - Zwack, Paul
AU - De Clercq, Inge
AU - Howton, Timothy
AU - Hallmark, H Tucker
AU - Hurny, Andrej
AU - Keshishian, Erika
AU - Parish, Alyssa
AU - Benková, Eva
AU - Mukhtar, M Shahid
AU - Van Breusegem, Frank
AU - Rashotte, Aaron
ID - 1331
IS - 2
JF - Plant Physiology
SN - 0032-0889
TI - Cytokinin response factor 6 represses cytokinin-associated genes during oxidative stress
VL - 172
ER -
TY - JOUR
AB - We study the homomorphism induced in homology by a closed correspondence between topological spaces, using projections from the graph of the correspondence to its domain and codomain. We provide assumptions under which the homomorphism induced by an outer approximation of a continuous map coincides with the homomorphism induced in homology by the map. In contrast to more classical results we do not require that the projection to the domain have acyclic preimages. Moreover, we show that it is possible to retrieve correct homological information from a correspondence even if some data is missing or perturbed. Finally, we describe an application to combinatorial maps that are either outer approximations of continuous maps or reconstructions of such maps from a finite set of data points.
AU - Harker, Shaun
AU - Kokubu, Hiroshi
AU - Mischaikow, Konstantin
AU - Pilarczyk, Pawel
ID - 1252
IS - 4
JF - Proceedings of the American Mathematical Society
SN - 1088-6826
TI - Inducing a map on homology from a correspondence
VL - 144
ER -
TY - JOUR
AB - Most migrating cells extrude their front by the force of actin polymerization. Polymerization requires an initial nucleation step, which is mediated by factors establishing either parallel filaments in the case of filopodia or branched filaments that form the branched lamellipodial network. Branches are considered essential for regular cell motility and are initiated by the Arp2/3 complex, which in turn is activated by nucleation-promoting factors of the WASP and WAVE families. Here we employed rapid amoeboid crawling leukocytes and found that deletion of the WAVE complex eliminated actin branching and thus lamellipodia formation. The cells were left with parallel filaments at the leading edge, which translated, depending on the differentiation status of the cell, into a unipolar pointed cell shape or cells with multiple filopodia. Remarkably, unipolar cells migrated with increased speed and enormous directional persistence, while they were unable to turn towards chemotactic gradients. Cells with multiple filopodia retained chemotactic activity but their migration was progressively impaired with increasing geometrical complexity of the extracellular environment. These findings establish that diversified leading edge protrusions serve as explorative structures while they slow down actual locomotion.
AU - Leithner, Alexander F
AU - Eichner, Alexander
AU - Müller, Jan
AU - Reversat, Anne
AU - Brown, Markus
AU - Schwarz, Jan
AU - Merrin, Jack
AU - De Gorter, David
AU - Schur, Florian
AU - Bayerl, Jonathan
AU - De Vries, Ingrid
AU - Wieser, Stefan
AU - Hauschild, Robert
AU - Lai, Frank
AU - Moser, Markus
AU - Kerjaschki, Dontscho
AU - Rottner, Klemens
AU - Small, Victor
AU - Stradal, Theresia
AU - Sixt, Michael K
ID - 1321
JF - Nature Cell Biology
TI - Diversified actin protrusions promote environmental exploration but are dispensable for locomotion of leukocytes
VL - 18
ER -
TY - JOUR
AB - During metazoan development, the temporal pattern of morphogen signaling is critical for organizing cell fates in space and time. Yet, tools for temporally controlling morphogen signaling within the embryo are still scarce. Here, we developed a photoactivatable Nodal receptor to determine how the temporal pattern of Nodal signaling affects cell fate specification during zebrafish gastrulation. By using this receptor to manipulate the duration of Nodal signaling in vivo by light, we show that extended Nodal signaling within the organizer promotes prechordal plate specification and suppresses endoderm differentiation. Endoderm differentiation is suppressed by extended Nodal signaling inducing expression of the transcriptional repressor goosecoid (gsc) in prechordal plate progenitors, which in turn restrains Nodal signaling from upregulating the endoderm differentiation gene sox17 within these cells. Thus, optogenetic manipulation of Nodal signaling identifies a critical role of Nodal signaling duration for organizer cell fate specification during gastrulation.
AU - Sako, Keisuke
AU - Pradhan, Saurabh
AU - Barone, Vanessa
AU - Inglés Prieto, Álvaro
AU - Mueller, Patrick
AU - Ruprecht, Verena
AU - Capek, Daniel
AU - Galande, Sanjeev
AU - Janovjak, Harald L
AU - Heisenberg, Carl-Philipp J
ID - 1100
IS - 3
JF - Cell Reports
TI - Optogenetic control of nodal signaling reveals a temporal pattern of nodal signaling regulating cell fate specification during gastrulation
VL - 16
ER -
TY - JOUR
AB - Autism spectrum disorders (ASD) are a group of genetic disorders often overlapping with other neurological conditions. We previously described abnormalities in the branched-chain amino acid (BCAA) catabolic pathway as a cause of ASD. Here, we show that the solute carrier transporter 7a5 (SLC7A5), a large neutral amino acid transporter localized at the blood brain barrier (BBB), has an essential role in maintaining normal levels of brain BCAAs. In mice, deletion of Slc7a5 from the endothelial cells of the BBB leads to atypical brain amino acid profile, abnormal mRNA translation, and severe neurological abnormalities. Furthermore, we identified several patients with autistic traits and motor delay carrying deleterious homozygous mutations in the SLC7A5 gene. Finally, we demonstrate that BCAA intracerebroventricular administration ameliorates abnormal behaviors in adult mutant mice. Our data elucidate a neurological syndrome defined by SLC7A5 mutations and support an essential role for the BCAA in human brain function.
AU - Tarlungeanu, Dora-Clara
AU - Deliu, Elena
AU - Dotter, Christoph
AU - Kara, Majdi
AU - Janiesch, Philipp
AU - Scalise, Mariafrancesca
AU - Galluccio, Michele
AU - Tesulov, Mateja
AU - Morelli, Emanuela
AU - Sönmez, Fatma
AU - Bilgüvar, Kaya
AU - Ohgaki, Ryuichi
AU - Kanai, Yoshikatsu
AU - Johansen, Anide
AU - Esharif, Seham
AU - Ben Omran, Tawfeg
AU - Topcu, Meral
AU - Schlessinger, Avner
AU - Indiveri, Cesare
AU - Duncan, Kent
AU - Caglayan, Ahmet
AU - Günel, Murat
AU - Gleeson, Joseph
AU - Novarino, Gaia
ID - 1183
IS - 6
JF - Cell
TI - Impaired amino acid transport at the blood brain barrier is a cause of autism spectrum disorder
VL - 167
ER -
TY - CONF
AB - We consider nondeterministic probabilistic programs with the most basic liveness property of termination. We present efficient methods for termination analysis of nondeterministic probabilistic programs with polynomial guards and assignments. Our approach is through synthesis of polynomial ranking supermartingales, that on one hand significantly generalizes linear ranking supermartingales and on the other hand is a counterpart of polynomial ranking-functions for proving termination of nonprobabilistic programs. The approach synthesizes polynomial ranking-supermartingales through Positivstellensatz's, yielding an efficient method which is not only sound, but also semi-complete over a large subclass of programs. We show experimental results to demonstrate that our approach can handle several classical programs with complex polynomial guards and assignments, and can synthesize efficient quadratic ranking-supermartingales when a linear one does not exist even for simple affine programs.
AU - Chatterjee, Krishnendu
AU - Fu, Hongfei
AU - Goharshady, Amir
ID - 1386
TI - Termination analysis of probabilistic programs through Positivstellensatz's
VL - 9779
ER -
TY - CONF
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 - Goharshady, Amir
AU - Ibsen-Jensen, Rasmus
AU - Pavlogiannis, Andreas
ID - 1437
TI - Algorithms for algebraic path properties in concurrent systems of constant treewidth components
VL - 20-22
ER -
TY - JOUR
AB - Glycoinositolphosphoceramides (GIPCs) are complex sphingolipids present at the plasma membrane of various eukaryotes with the important exception of mammals. In fungi, these glycosphingolipids commonly contain an alpha-mannose residue (Man) linked at position 2 of the inositol. However, several pathogenic fungi additionally synthesize zwitterionic GIPCs carrying an alpha-glucosamine residue (GlcN) at this position. In the human pathogen Aspergillus fumigatus, the GlcNalpha1,2IPC core (where IPC is inositolphosphoceramide) is elongated to Manalpha1,3Manalpha1,6GlcNalpha1,2IPC, which is the most abundant GIPC synthesized by this fungus. In this study, we identified an A. fumigatus N-acetylglucosaminyltransferase, named GntA, and demonstrate its involvement in the initiation of zwitterionic GIPC biosynthesis. Targeted deletion of the gene encoding GntA in A. fumigatus resulted in complete absence of zwitterionic GIPC; a phenotype that could be reverted by episomal expression of GntA in the mutant. The N-acetylhexosaminyltransferase activity of GntA was substantiated by production of N-acetylhexosamine-IPC in the yeast Saccharomyces cerevisiae upon GntA expression. Using an in vitro assay, GntA was furthermore shown to use UDP-N-acetylglucosamine as donor substrate to generate a glycolipid product resistant to saponification and to digestion by phosphatidylinositol-phospholipase C as expected for GlcNAcalpha1,2IPC. Finally, as the enzymes involved in mannosylation of IPC, GntA was localized to the Golgi apparatus, the site of IPC synthesis.
AU - Engel, Jakob
AU - Schmalhorst, Philipp S
AU - Kruger, Anke
AU - Muller, Christina
AU - Buettner, Falk
AU - Routier, Françoise
ID - 802
IS - 12
JF - Glycobiology
TI - Characterization of an N-acetylglucosaminyltransferase involved in Aspergillus fumigatus zwitterionic glycoinositolphosphoceramide biosynthesis
VL - 25
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 - JOUR
AB - We prove that nonlinear Gibbs measures can be obtained from the corresponding many-body, grand-canonical, quantum Gibbs states, in a mean-field limit where the temperature T diverges and the interaction strength behaves as 1/T. We proceed by characterizing the interacting Gibbs state as minimizing a functional counting the free-energy relatively to the non-interacting case. We then perform an infinite-dimensional analogue of phase-space semiclassical analysis, using fine properties of the quantum relative entropy, the link between quantum de Finetti measures and upper/lower symbols in a coherent state basis, as well as Berezin-Lieb type inequalities. Our results cover the measure built on the defocusing nonlinear Schrödinger functional on a finite interval, as well as smoother interactions in dimensions d 2.
AU - Lewin, Mathieu
AU - Phan Thanh, Nam
AU - Rougerie, Nicolas
ID - 473
JF - Journal de l'Ecole Polytechnique - Mathematiques
TI - Derivation of nonlinear gibbs measures from many-body quantum mechanics
VL - 2
ER -
TY - JOUR
AB - Dendritic cells are potent antigen-presenting cells endowed with the unique ability to initiate adaptive immune responses upon inflammation. Inflammatory processes are often associated with an increased production of serotonin, which operates by activating specific receptors. However, the functional role of serotonin receptors in regulation of dendritic cell functions is poorly understood. Here, we demonstrate that expression of serotonin receptor 5-HT7 (5-HT7TR) as well as its downstream effector Cdc42 is upregulated in dendritic cells upon maturation. Although dendritic cell maturation was independent of 5-HT7TR, receptor stimulation affected dendritic cell morphology through Cdc42-mediated signaling. In addition, basal activity of 5-HT7TR was required for the proper expression of the chemokine receptor CCR7, which is a key factor that controls dendritic cell migration. Consistent with this, we observed that 5-HT7TR enhances chemotactic motility of dendritic cells in vitro by modulating their directionality and migration velocity. Accordingly, migration of dendritic cells in murine colon explants was abolished after pharmacological receptor inhibition. Our results indicate that there is a crucial role for 5-HT7TR-Cdc42-mediated signaling in the regulation of dendritic cell morphology and motility, suggesting that 5-HT7TR could be a new target for treatment of a variety of inflammatory and immune disorders.
AU - Holst, Katrin
AU - Guseva, Daria
AU - Schindler, Susann
AU - Sixt, Michael K
AU - Braun, Armin
AU - Chopra, Himpriya
AU - Pabst, Oliver
AU - Ponimaskin, Evgeni
ID - 477
IS - 15
JF - Journal of Cell Science
TI - The serotonin receptor 5-HT7R regulates the morphology and migratory properties of dendritic cells
VL - 128
ER -
TY - JOUR
AB - We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.
AU - Chatterjee, Krishnendu
AU - Doyen, Laurent
AU - Randour, Mickael
AU - Raskin, Jean
ID - 523
IS - 6
JF - Information and Computation
TI - Looking at mean-payoff and total-payoff through windows
VL - 242
ER -
TY - JOUR
AB - We consider concurrent games played by two players on a finite-state graph, where in every round the players simultaneously choose a move, and the current state along with the joint moves determine the successor state. We study the most fundamental objective for concurrent games, namely, mean-payoff or limit-average objective, where a reward is associated to each transition, and the goal of player 1 is to maximize the long-run average of the rewards, and the objective of player 2 is strictly the opposite (i.e., the games are zero-sum). The path constraint for player 1 could be qualitative, i.e., the mean-payoff is the maximal reward, or arbitrarily close to it; or quantitative, i.e., a given threshold between the minimal and maximal reward. We consider the computation of the almost-sure (resp. positive) winning sets, where player 1 can ensure that the path constraint is satisfied with probability 1 (resp. positive probability). Almost-sure winning with qualitative constraint exactly corresponds to the question of whether there exists a strategy to ensure that the payoff is the maximal reward of the game. Our main results for qualitative path constraints are as follows: (1) we establish qualitative determinacy results that show that for every state either player 1 has a strategy to ensure almost-sure (resp. positive) winning against all player-2 strategies, or player 2 has a spoiling strategy to falsify almost-sure (resp. positive) winning against all player-1 strategies; (2) we present optimal strategy complexity results that precisely characterize the classes of strategies required for almost-sure and positive winning for both players; and (3) we present quadratic time algorithms to compute the almost-sure and the positive winning sets, matching the best known bound of the algorithms for much simpler problems (such as reachability objectives). For quantitative constraints we show that a polynomial time solution for the almost-sure or the positive winning set would imply a solution to a long-standing open problem (of solving the value problem of turn-based deterministic mean-payoff games) that is not known to be solvable in polynomial time.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
ID - 524
IS - 6
JF - Information and Computation
TI - Qualitative analysis of concurrent mean payoff games
VL - 242
ER -
TY - JOUR
AB - Ethylene is a gaseous phytohormone that plays vital roles in plant growth and development. Previous studies uncovered EIN2 as an essential signal transducer linking ethylene perception on ER to transcriptional regulation in the nucleus through a “cleave and shuttle” model. In this study, we report another mechanism of EIN2-mediated ethylene signaling, whereby EIN2 imposes the translational repression of EBF1 and EBF2 mRNA. We find that the EBF1/2 3′ UTRs mediate EIN2-directed translational repression and identify multiple poly-uridylates (PolyU) motifs as functional cis elements of 3′ UTRs. Furthermore, we demonstrate that ethylene induces EIN2 to associate with 3′ UTRs and target EBF1/2 mRNA to cytoplasmic processing-body (P-body) through interacting with multiple P-body factors, including EIN5 and PABs. Our study illustrates translational regulation as a key step in ethylene signaling and presents mRNA 3′ UTR functioning as a “signal transducer” to sense and relay cellular signaling in plants.
AU - Li, Wenyang
AU - Ma, Mengdi
AU - Feng, Ying
AU - Li, Hongjiang
AU - Wang, Yichuan
AU - Ma, Yutong
AU - Li, Mingzhe
AU - An, Fengying
AU - Guo, Hongwei
ID - 532
IS - 3
JF - Cell
TI - EIN2-directed translational regulation of ethylene signaling in arabidopsis
VL - 163
ER -
TY - GEN
AB - We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives.
There have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.
We consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics.
Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).
Our main results are algorithms for the decision problem which are always polynomial in the size of the MDP. We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions.
Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.
AU - Chatterjee, Krishnendu
AU - Komarkova, Zuzana
AU - Kretinsky, Jan
ID - 5429
SN - 2664-1690
TI - Unifying two views on multiple mean-payoff objectives in Markov decision processes
ER -
TY - GEN
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 mul- tiplicative 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 · n | )) = O ( n · log( n · W )) , when the output is a b , as compared to the previously best known algorithm with running time O ( n 2 · log( n · W )) . Third, for the minimum initial credit problem we show that (i) for general graphs the problem can be solved in O ( n 2 · m ) time and the associated decision problem can be solved in O ( n · m ) time, improving the previous known O ( n 3 · m · log( n · W )) and O ( n 2 · m ) bounds, respectively; and (ii) for constant treewidth graphs we present an algorithm that requires O ( n · log n ) time, improving the previous known O ( n 4 · 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 - 5430
SN - 2664-1690
TI - Faster algorithms for quantitative verification in constant treewidth graphs
ER -
TY - GEN
AB - We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target set is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the complexity of stationary strategies measured by their patience, which is defined as the inverse of the smallest non-zero probability employed.
Our main results are as follows: We show that in two-player zero-sum concurrent stochastic games (with reachability objective for one player and the complementary safety objective for the other player): (i) the optimal bound on the patience of optimal and epsilon-optimal strategies, for both players is doubly exponential; and (ii) even in games with a single non-absorbing state exponential (in the number of actions) patience is necessary. In general we study the class of non-zero-sum games admitting epsilon-Nash equilibria. We show that if there is at least one player with reachability objective, then doubly-exponential patience is needed in general for epsilon-Nash equilibrium strategies, whereas in contrast if all players have safety objectives, then the optimal bound on patience for epsilon-Nash equilibrium strategies is only exponential.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
AU - Hansen, Kristoffer
ID - 5431
SN - 2664-1690
TI - The patience of concurrent stochastic games with safety and reachability objectives
ER -
TY - GEN
AB - Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom in the context of evolution.The replacement graph specifies who competes with whom for reproduction.
The vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability.
Our main results are:
(1) We show that the qualitative question is NP-complete and the quantitative approximation question is #P-hard in the special case when the interaction and the replacement graphs coincide and even with the restriction that the resident individuals do not reproduce (which corresponds to an invading population taking over an empty structure).
(2) We show that in general the qualitative question is PSPACE-complete and the quantitative approximation question is PSPACE-hard and can be solved in exponential time.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
AU - Nowak, Martin
ID - 5432
SN - 2664-1690
TI - The complexity of evolutionary games on graphs
ER -
TY - GEN
AB - We consider Markov decision processes (MDPs) with multiple limit-average (or mean-payoff) objectives.
There have been two different views: (i) the expectation semantics, where the goal is to optimize the expected mean-payoff objective, and (ii) the satisfaction semantics, where the goal is to maximize the probability of runs such that the mean-payoff value stays above a given vector.
We consider the problem where the goal is to optimize the expectation under the constraint that the satisfaction semantics is ensured, and thus consider a generalization that unifies the existing semantics. Our problem captures the notion of optimization with respect to strategies that are risk-averse (i.e., ensures certain probabilistic guarantee).
Our main results are algorithms for the decision problem which are always polynomial in the size of the MDP.
We also show that an approximation of the Pareto-curve can be computed in time polynomial in the size of the MDP, and the approximation factor, but exponential in the number of dimensions. Finally, we present a complete characterization of the strategy complexity (in terms of memory bounds and randomization) required to solve our problem.
AU - Chatterjee, Krishnendu
AU - Komarkova, Zuzana
AU - Kretinsky, Jan
ID - 5435
SN - 2664-1690
TI - Unifying two views on multiple mean-payoff objectives in Markov decision processes
ER -
TY - GEN
AB - Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative properties, perhaps surprisingly, some basic system properties such as average response time cannot be expressed using weighted automata, nor in any other know decidable formalism. In this work, we introduce nested weighted automata as a natural extension of weighted automata which makes it possible to express important quantitative properties such as average response time.
In nested weighted automata, a master automaton spins off and collects results from weighted slave automata, each of which computes a quantity along a finite portion of an infinite word. Nested weighted automata can be viewed as the quantitative analogue of monitor automata, which are used in run-time verification. We establish an almost complete decidability picture for the basic decision problems about nested weighted automata, and illustrate their applicability in several domains. In particular, nested weighted automata can be used to decide average response time properties.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Otop, Jan
ID - 5436
SN - 2664-1690
TI - Nested weighted automata
ER -
TY - GEN
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 $\epsilon$ in time $O(n \cdot \log (n/\epsilon))$ 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 \cdot \log (|a\cdot b|))=O(n\cdot\log (n\cdot W))$, when the output is $\frac{a}{b}$, as compared to the previously best known algorithm with running time $O(n^2 \cdot \log (n\cdot W))$. Third, for the minimum initial credit problem we show that (i)~for general graphs the problem can be solved in $O(n^2\cdot m)$ time and the associated decision problem can be solved in $O(n\cdot m)$ time, improving the previous known $O(n^3\cdot m\cdot \log (n\cdot W))$ and $O(n^2 \cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs we present an algorithm that requires $O(n\cdot \log n)$ time, improving the previous known $O(n^4 \cdot \log (n \cdot 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 - 5437
SN - 2664-1690
TI - Faster algorithms for quantitative verification in constant treewidth graphs
ER -
TY - GEN
AB - The edit distance between two words w1, w2 is the minimal number of word operations (letter insertions, deletions, and substitutions) necessary to transform w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance is the minimal number k such that for every word from L1 there exists a word in L2 with edit distance at most k. We study the edit distance computation problem between pushdown automata and their subclasses.
The problem of computing edit distance to a pushdown automaton is undecidable, and in practice, the interesting question is to compute the edit distance from a pushdown automaton (the implementation, a standard model for programs with recursion) to a regular language (the specification). In this work, we present a complete picture of decidability and complexity for deciding whether, for a given threshold k, the edit distance from a pushdown automaton to a finite automaton is at most k.
AU - Chatterjee, Krishnendu
AU - Henzinger, Thomas A
AU - Ibsen-Jensen, Rasmus
AU - Otop, Jan
ID - 5438
SN - 2664-1690
TI - Edit distance for pushdown automata
ER -
TY - GEN
AB - The target discounted-sum problem is the following: Given a rational discount factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals t? The problem turns out to relate to many fields of mathematics and computer science, and its decidability question is surprisingly hard to solve. We solve the finite version of the problem, and show the hardness of the infinite version, linking it to various areas and open problems in mathematics and computer science: β-expansions, discounted-sum automata, piecewise affine maps, and generalizations of the Cantor set. We provide some partial results to the infinite version, among which are solutions to its restriction to eventually-periodic sequences and to the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving some open problems on discounted-sum automata, among which are the exact-value problem for nondeterministic automata over finite words and the universality and inclusion problems for functional automata.
AU - Boker, Udi
AU - Henzinger, Thomas A
AU - Otop, Jan
ID - 5439
SN - 2664-1690
TI - The target discounted-sum problem
ER -
TY - GEN
AB - Evolution occurs in populations of reproducing individuals. The structure of the population affects the outcome of the evolutionary process. Evolutionary graph theory is a powerful approach to study this phenomenon. There are two graphs. The interaction graph specifies who interacts with whom for payoff in the context of evolution. The replacement graph specifies who competes with whom for reproduction. The vertices of the two graphs are the same, and each vertex corresponds to an individual of the population. The fitness (or the reproductive rate) is a non-negative number, and depends on the payoff. A key quantity is the fixation probability of a new mutant. It is defined as the probability that a newly introduced mutant (on a single vertex) generates a lineage of offspring which eventually takes over the entire population of resident individuals. The basic computational questions are as follows: (i) the qualitative question asks whether the fixation probability is positive; and (ii) the quantitative approximation question asks for an approximation of the fixation probability. Our main results are as follows: First, we consider a special case of the general problem, where the residents do not reproduce. We show that the qualitative question is NP-complete, and the quantitative approximation question is #P-complete, and the hardness results hold even in the special case where the interaction and the replacement graphs coincide. Second, we show that in general both the qualitative and the quantitative approximation questions are PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds even when the fitness is always positive.
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
AU - Nowak, Martin
ID - 5440
SN - 2664-1690
TI - The complexity of evolutionary games on graphs
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 - POMDPs are standard models for probabilistic planning problems, where an agent interacts with an uncertain environment. We study the problem of almost-sure reachability, where given a set of target states, the question is to decide whether there is a policy to ensure that the target set is reached with probability 1 (almost-surely). While in general the problem is EXPTIME-complete, in many practical cases policies with a small amount of memory suffice. Moreover, the existing solution to the problem is explicit, which first requires to construct explicitly an exponential reduction to a belief-support MDP. In this work, we first study the existence of observation-stationary strategies, which is NP-complete, and then small-memory strategies. We present a symbolic algorithm by an efficient encoding to SAT and using a SAT solver for the problem. We report experimental results demonstrating the scalability of our symbolic (SAT-based) approach.
AU - Chatterjee, Krishnendu
AU - Chmelik, Martin
AU - Davies, Jessica
ID - 5443
SN - 2664-1690
TI - A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
ER -
TY - GEN
AB - A comprehensive understanding of the clonal evolution of cancer is critical for understanding neoplasia. Genome-wide sequencing data enables evolutionary studies at unprecedented depth. However, classical phylogenetic methods often struggle with noisy sequencing data of impure DNA samples and fail to detect subclones that have different evolutionary trajectories. We have developed a tool, called Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly available sequencing technologies. Using Bayesian inference and Integer Linear Programming, robust phylogenies consistent with the biological processes underlying cancer evolution were obtained for pancreatic, ovarian, and prostate cancers. Furthermore, Treeomics correctly identified sequencing artifacts such as those resulting from low statistical power; nearly 7% of variants were misclassified by conventional statistical methods. These artifacts can skew phylogenies by creating illusory tumor heterogeneity among distinct samples. Importantly, we show that the evolutionary trees generated with Treeomics are mathematically optimal.
AU - Reiter, Johannes
AU - Makohon-Moore, Alvin
AU - Gerold, Jeffrey
AU - Bozic, Ivana
AU - Chatterjee, Krishnendu
AU - Iacobuzio-Donahue, Christine
AU - Vogelstein, Bert
AU - Nowak, Martin
ID - 5444
SN - 2664-1690
TI - Reconstructing robust phylogenies of metastatic cancers
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 - JOUR
AB - Mathematical models are of fundamental importance in the understanding of complex population dynamics. For instance, they can be used to predict the population evolution starting from different initial conditions or to test how a system responds to external perturbations. For this analysis to be meaningful in real applications, however, it is of paramount importance to choose an appropriate model structure and to infer the model parameters from measured data. While many parameter inference methods are available for models based on deterministic ordinary differential equations, the same does not hold for more detailed individual-based models. Here we consider, in particular, stochastic models in which the time evolution of the species abundances is described by a continuous-time Markov chain. These models are governed by a master equation that is typically difficult to solve. Consequently, traditional inference methods that rely on iterative evaluation of parameter likelihoods are computationally intractable. The aim of this paper is to present recent advances in parameter inference for continuous-time Markov chain models, based on a moment closure approximation of the parameter likelihood, and to investigate how these results can help in understanding, and ultimately controlling, complex systems in ecology. Specifically, we illustrate through an agricultural pest case study how parameters of a stochastic individual-based model can be identified from measured data and how the resulting model can be used to solve an optimal control problem in a stochastic setting. In particular, we show how the matter of determining the optimal combination of two different pest control methods can be formulated as a chance constrained optimization problem where the control action is modeled as a state reset, leading to a hybrid system formulation.
AU - Parise, Francesca
AU - Lygeros, John
AU - Ruess, Jakob
ID - 10794
JF - Frontiers in Environmental Science
KW - General Environmental Science
SN - 2296-665X
TI - Bayesian inference for stochastic individual-based models of ecological systems: a pest control simulation study
VL - 3
ER -
TY - CONF
AB - We consider concurrent mean-payoff games, a very well-studied class of two-player (player 1 vs player 2) zero-sum games on finite-state graphs where every transition is assigned a reward between 0 and 1, and the payoff function is the long-run average of the rewards. The value is the maximal expected payoff that player 1 can guarantee against all strategies of player 2. We consider the computation of the set of states with value 1 under finite-memory strategies for player 1, and our main results for the problem are as follows: (1) we present a polynomial-time algorithm; (2) we show that whenever there is a finite-memory strategy, there is a stationary strategy that does not need memory at all; and (3) we present an optimal bound (which is double exponential) on the patience of stationary strategies (where patience of a distribution is the inverse of the smallest positive probability and represents a complexity measure of a stationary strategy).
AU - Chatterjee, Krishnendu
AU - Ibsen-Jensen, Rasmus
ID - 10796
IS - 1
SN - 978-161197374-7
T2 - Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
TI - The value 1 problem under finite-memory strategies for concurrent mean-payoff games
VL - 2015
ER -
TY - JOUR
AB - This paper addresses the problem of semantic segmentation, where the possible class labels are from a predefined set. We exploit top-down guidance, i.e., the coarse localization of the objects and their class labels provided by object detectors. For each detected bounding box, figure-ground segmentation is performed and the final result is achieved by merging the figure-ground segmentations. The main idea of the proposed approach, which is presented in our preliminary work, is to reformulate the figure-ground segmentation problem as sparse reconstruction pursuing the object mask in a nonparametric manner. The latent segmentation mask should be coherent subject to sparse error caused by intra-category diversity; thus, the object mask is inferred by making use of sparse representations over the training set. To handle local spatial deformations, local patch-level masks are also considered and inferred by sparse representations over the spatially nearby patches. The sparse reconstruction coefficients and the latent mask are alternately optimized by applying the Lasso algorithm and the accelerated proximal gradient method. The proposed formulation results in a convex optimization problem; thus, the global optimal solution is achieved. In this paper, we provide theoretical analysis of the convergence and optimality. We also give an extended numerical analysis of the proposed algorithm and a comprehensive comparison with the related semantic segmentation methods on the challenging PASCAL visual object class object segmentation datasets and the Weizmann horse dataset. The experimental results demonstrate that the proposed algorithm achieves a competitive performance when compared with the state of the arts.
AU - Xia, Wei
AU - Domokos, Csaba
AU - Xiong, Junjun
AU - Cheong, Loongfah
AU - Yan, Shuicheng
ID - 1533
IS - 8
JF - IEEE Transactions on Circuits and Systems for Video Technology
TI - Segmentation over detection via optimal sparse reconstructions
VL - 25
ER -
TY - JOUR
AB - PIN proteins are auxin export carriers that direct intercellular auxin flow and in turn regulate many aspects of plant growth and development including responses to environmental changes. The Arabidopsis R2R3-MYB transcription factor FOUR LIPS (FLP) and its paralogue MYB88 regulate terminal divisions during stomatal development, as well as female reproductive development and stress responses. Here we show that FLP and MYB88 act redundantly but differentially in regulating the transcription of PIN3 and PIN7 in gravity-sensing cells of primary and lateral roots. On the one hand, FLP is involved in responses to gravity stimulation in primary roots, whereas on the other, FLP and MYB88 function complementarily in establishing the gravitropic set-point angles of lateral roots. Our results support a model in which FLP and MYB88 expression specifically determines the temporal-spatial patterns of PIN3 and PIN7 transcription that are closely associated with their preferential functions during root responses to gravity.
AU - Wang, Hongzhe
AU - Yang, Kezhen
AU - Zou, Junjie
AU - Zhu, Lingling
AU - Xie, Zidian
AU - Morita, Miyoterao
AU - Tasaka, Masao
AU - Friml, Jirí
AU - Grotewold, Erich
AU - Beeckman, Tom
AU - Vanneste, Steffen
AU - Sack, Fred
AU - Le, Jie
ID - 1534
JF - Nature Communications
TI - Transcriptional regulation of PIN genes by FOUR LIPS and MYB88 during Arabidopsis root gravitropism
VL - 6
ER -
TY - JOUR
AB - Neuronal and neuroendocrine L-type calcium channels (Cav1.2, Cav1.3) open readily at relatively low membrane potentials and allow Ca2+ to enter the cells near resting potentials. In this way, Cav1.2 and Cav1.3 shape the action potential waveform, contribute to gene expression, synaptic plasticity, neuronal differentiation, hormone secretion and pacemaker activity. In the chromaffin cells (CCs) of the adrenal medulla, Cav1.3 is highly expressed and is shown to support most of the pacemaking current that sustains action potential (AP) firings and part of the catecholamine secretion. Cav1.3 forms Ca2+-nanodomains with the fast inactivating BK channels and drives the resting SK currents. These latter set the inter-spike interval duration between consecutive spikes during spontaneous firing and the rate of spike adaptation during sustained depolarizations. Cav1.3 plays also a primary role in the switch from “tonic” to “burst” firing that occurs in mouse CCs when either the availability of voltage-gated Na channels (Nav) is reduced or the β2 subunit featuring the fast inactivating BK channels is deleted. Here, we discuss the functional role of these “neuronlike” firing modes in CCs and how Cav1.3 contributes to them. The open issue is to understand how these novel firing patterns are adapted to regulate the quantity of circulating catecholamines during resting condition or in response to acute and chronic stress.
AU - Vandael, David H
AU - Marcantoni, Andrea
AU - Carbone, Emilio
ID - 1535
IS - 2
JF - Current Molecular Pharmacology
TI - Cav1.3 channels as key regulators of neuron-like firings and catecholamine release in chromaffin cells
VL - 8
ER -
TY - JOUR
AB - Strigolactones, first discovered as germination stimulants for parasitic weeds [1], are carotenoid-derived phytohormones that play major roles in inhibiting lateral bud outgrowth and promoting plant-mycorrhizal symbiosis [2-4]. Furthermore, strigolactones are involved in the regulation of lateral and adventitious root development, root cell division [5, 6], secondary growth [7], and leaf senescence [8]. Recently, we discovered the strigolactone transporter Petunia axillaris PLEIOTROPIC DRUG RESISTANCE 1 (PaPDR1), which is required for efficient mycorrhizal colonization and inhibition of lateral bud outgrowth [9]. However, how strigolactones are transported through the plant remained unknown. Here we show that PaPDR1 exhibits a cell-type-specific asymmetric localization in different root tissues. In root tips, PaPDR1 is co-expressed with the strigolactone biosynthetic gene DAD1 (CCD8), and it is localized at the apical membrane of root hypodermal cells, presumably mediating the shootward transport of strigolactone. Above the root tip, in the hypodermal passage cells that form gates for the entry of mycorrhizal fungi, PaPDR1 is present in the outer-lateral membrane, compatible with its postulated function as strigolactone exporter from root to soil. Transport studies are in line with our localization studies since (1) a papdr1 mutant displays impaired transport of strigolactones out of the root tip to the shoot as well as into the rhizosphere and (2) DAD1 expression and PIN1/PIN2 levels change in plants deregulated for PDR1 expression, suggestive of variations in endogenous strigolactone contents. In conclusion, our results indicate that the polar localizations of PaPDR1 mediate directional shootward strigolactone transport as well as localized exudation into the soil.
AU - Sasse, Joëlle
AU - Simon, Sibu
AU - Gübeli, Christian
AU - Liu, Guowei
AU - Cheng, Xi
AU - Friml, Jirí
AU - Bouwmeester, Harro
AU - Martinoia, Enrico
AU - Borghi, Lorenzo
ID - 1536
IS - 5
JF - Current Biology
TI - Asymmetric localizations of the ABC transporter PaPDR1 trace paths of directional strigolactone transport
VL - 25
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 - Systems biology rests on the idea that biological complexity can be better unraveled through the interplay of modeling and experimentation. However, the success of this approach depends critically on the informativeness of the chosen experiments, which is usually unknown a priori. Here, we propose a systematic scheme based on iterations of optimal experiment design, flow cytometry experiments, and Bayesian parameter inference to guide the discovery process in the case of stochastic biochemical reaction networks. To illustrate the benefit of our methodology, we apply it to the characterization of an engineered light-inducible gene expression circuit in yeast and compare the performance of the resulting model with models identified from nonoptimal experiments. In particular, we compare the parameter posterior distributions and the precision to which the outcome of future experiments can be predicted. Moreover, we illustrate how the identified stochastic model can be used to determine light induction patterns that make either the average amount of protein or the variability in a population of cells follow a desired profile. Our results show that optimal experiment design allows one to derive models that are accurate enough to precisely predict and regulate the protein expression in heterogeneous cell populations over extended periods of time.
AU - Ruess, Jakob
AU - Parise, Francesca
AU - Milias Argeitis, Andreas
AU - Khammash, Mustafa
AU - Lygeros, John
ID - 1538
IS - 26
JF - PNAS
TI - Iterative experiment design guides the characterization of a light-inducible gene expression circuit
VL - 112
ER -
TY - JOUR
AB - Many stochastic models of biochemical reaction networks contain some chemical species for which the number of molecules that are present in the system can only be finite (for instance due to conservation laws), but also other species that can be present in arbitrarily large amounts. The prime example of such networks are models of gene expression, which typically contain a small and finite number of possible states for the promoter but an infinite number of possible states for the amount of mRNA and protein. One of the main approaches to analyze such models is through the use of equations for the time evolution of moments of the chemical species. Recently, a new approach based on conditional moments of the species with infinite state space given all the different possible states of the finite species has been proposed. It was argued that this approach allows one to capture more details about the full underlying probability distribution with a smaller number of equations. Here, I show that the result that less moments provide more information can only stem from an unnecessarily complicated description of the system in the classical formulation. The foundation of this argument will be the derivation of moment equations that describe the complete probability distribution over the finite state space but only low-order moments over the infinite state space. I will show that the number of equations that is needed is always less than what was previously claimed and always less than the number of conditional moment equations up to the same order. To support these arguments, a symbolic algorithm is provided that can be used to derive minimal systems of unconditional moment equations for models with partially finite state space.
AU - Ruess, Jakob
ID - 1539
IS - 24
JF - Journal of Chemical Physics
TI - Minimal moment equations for stochastic models of biochemical reaction networks with partially finite state space
VL - 143
ER -
TY - JOUR
AB - Plant sexual reproduction involves highly structured and specialized organs: stamens (male) and gynoecia (female, containing ovules). These organs synchronously develop within protective flower buds, until anthesis, via tightly coordinated mechanisms that are essential for effective fertilization and production of viable seeds. The phytohormone auxin is one of the key endogenous signalling molecules controlling initiation and development of these, and other, plant organs. In particular, its uneven distribution, resulting from tightly controlled production, metabolism and directional transport, is an important morphogenic factor. In this review we discuss how developmentally controlled and localized auxin biosynthesis and transport contribute to the coordinated development of plants' reproductive organs, and their fertilized derivatives (embryos) via the regulation of auxin levels and distribution within and around them. Current understanding of the links between de novo local auxin biosynthesis, auxin transport and/or signalling is presented to highlight the importance of the non-cell autonomous action of auxin production on development and morphogenesis of reproductive organs and embryos. An overview of transcription factor families, which spatiotemporally define local auxin production by controlling key auxin biosynthetic enzymes, is also presented.
AU - Robert, Hélène
AU - Crhák Khaitová, Lucie
AU - Mroue, Souad
AU - Benková, Eva
ID - 1540
IS - 16
JF - Journal of Experimental Botany
TI - The importance of localized auxin production for morphogenesis of reproductive organs and embryos in Arabidopsis
VL - 66
ER -
TY - CONF
AB - We present XSpeed a parallel state-space exploration algorithm for continuous systems with linear dynamics and nondeterministic inputs. The motivation of having parallel algorithms is to exploit the computational power of multi-core processors to speed-up performance. The parallelization is achieved on two fronts. First, we propose a parallel implementation of the support function algorithm by sampling functions in parallel. Second, we propose a parallel state-space exploration by slicing the time horizon and computing the reachable states in the time slices in parallel. The second method can be however applied only to a class of linear systems with invertible dynamics and fixed input. A GP-GPU implementation is also presented following a lazy evaluation strategy on support functions. The parallel algorithms are implemented in the tool XSpeed. We evaluated the performance on two benchmarks including an 28 dimension Helicopter model. Comparison with the sequential counterpart shows a maximum speed-up of almost 7× on a 6 core, 12 thread Intel Xeon CPU E5-2420 processor. Our GP-GPU implementation shows a maximum speed-up of 12× over the sequential implementation and 53× over SpaceEx (LGG scenario), the state of the art tool for reachability analysis of linear hybrid systems. Experiments illustrate that our parallel algorithm with time slicing not only speeds-up performance but also improves precision.
AU - Ray, Rajarshi
AU - Gurung, Amit
AU - Das, Binayak
AU - Bartocci, Ezio
AU - Bogomolov, Sergiy
AU - Grosu, Radu
ID - 1541
TI - XSpeed: Accelerating reachability analysis on multi-core processors
VL - 9434
ER -
TY - JOUR
AB - The theory of population genetics and evolutionary computation have been evolving separately for nearly 30 years. Many results have been independently obtained in both fields and many others are unique to its respective field. We aim to bridge this gap by developing a unifying framework for evolutionary processes that allows both evolutionary algorithms and population genetics models to be cast in the same formal framework. The framework we present here decomposes the evolutionary process into its several components in order to facilitate the identification of similarities between different models. In particular, we propose a classification of evolutionary operators based on the defining properties of the different components. We cast several commonly used operators from both fields into this common framework. Using this, we map different evolutionary and genetic algorithms to different evolutionary regimes and identify candidates with the most potential for the translation of results between the fields. This provides a unified description of evolutionary processes and represents a stepping stone towards new tools and results to both fields.
AU - Paixao, Tiago
AU - Badkobeh, Golnaz
AU - Barton, Nicholas H
AU - Çörüş, Doğan
AU - Dang, Duccuong
AU - Friedrich, Tobias
AU - Lehre, Per
AU - Sudholt, Dirk
AU - Sutton, Andrew
AU - Trubenova, Barbora
ID - 1542
JF - Journal of Theoretical Biology
TI - Toward a unifying framework for evolutionary processes
VL - 383
ER -
TY - JOUR
AB - A plethora of diverse programmed cell death (PCD) processes has been described in living organisms. In animals and plants, different forms of PCD play crucial roles in development, immunity, and responses to the environment. While the molecular control of some animal PCD forms such as apoptosis is known in great detail, we still know comparatively little about the regulation of the diverse types of plant PCD. In part, this deficiency in molecular understanding is caused by the lack of reliable reporters to detect PCD processes. Here, we addressed this issue by using a combination of bioinformatics approaches to identify commonly regulated genes during diverse plant PCD processes in Arabidopsis (Arabidopsis thaliana). Our results indicate that the transcriptional signatures of developmentally controlled cell death are largely distinct from the ones associated with environmentally induced cell death. Moreover, different cases of developmental PCD share a set of cell death-associated genes. Most of these genes are evolutionary conserved within the green plant lineage, arguing for an evolutionary conserved core machinery of developmental PCD. Based on this information, we established an array of specific promoter-reporter lines for developmental PCD in Arabidopsis. These PCD indicators represent a powerful resource that can be used in addition to established morphological and biochemical methods to detect and analyze PCD processes in vivo and in planta.
AU - Olvera Carrillo, Yadira
AU - Van Bel, Michiel
AU - Van Hautegem, Tom
AU - Fendrych, Matyas
AU - Huysmans, Marlies
AU - Šimášková, Mária
AU - Van Durme, Matthias
AU - Buscaill, Pierre
AU - Rivas, Susana
AU - Coll, Núria
AU - Coppens, Frederik
AU - Maere, Steven
AU - Nowack, Moritz
ID - 1543
IS - 4
JF - Plant Physiology
TI - A conserved core of programmed cell death indicator genes discriminates developmentally and environmentally induced programmed cell death in plants
VL - 169
ER -
TY - CHAP
AB - Cell division in prokaryotes and eukaryotes is commonly initiated by the well-controlled binding of proteins to the cytoplasmic side of the cell membrane. However, a precise characterization of the spatiotemporal dynamics of membrane-bound proteins is often difficult to achieve in vivo. Here, we present protocols for the use of supported lipid bilayers to rebuild the cytokinetic machineries of cells with greatly different dimensions: the bacterium Escherichia coli and eggs of the vertebrate Xenopus laevis. Combined with total internal reflection fluorescence microscopy, these experimental setups allow for precise quantitative analyses of membrane-bound proteins. The protocols described to obtain glass-supported membranes from bacterial and vertebrate lipids can be used as starting points for other reconstitution experiments. We believe that similar biochemical assays will be instrumental to study the biochemistry and biophysics underlying a variety of complex cellular tasks, such as signaling, vesicle trafficking, and cell motility.
AU - Nguyen, Phuong
AU - Field, Christine
AU - Groen, Aaron
AU - Mitchison, Timothy
AU - Loose, Martin
ID - 1544
T2 - Building a Cell from its Components Parts
TI - Using supported bilayers to study the spatiotemporal organization of membrane-bound proteins
VL - 128
ER -
TY - JOUR
AB - Synaptic efficacy and precision are influenced by the coupling of voltage-gated Ca2+ channels (VGCCs) to vesicles. But because the topography of VGCCs and their proximity to vesicles is unknown, a quantitative understanding of the determinants of vesicular release at nanometer scale is lacking. To investigate this, we combined freeze-fracture replica immunogold labeling of Cav2.1 channels, local [Ca2+] imaging, and patch pipette perfusion of EGTA at the calyx of Held. Between postnatal day 7 and 21, VGCCs formed variable sized clusters and vesicular release became less sensitive to EGTA, whereas fixed Ca2+ buffer properties remained constant. Experimentally constrained reaction-diffusion simulations suggest that Ca2+ sensors for vesicular release are located at the perimeter of VGCC clusters (<30nm) and predict that VGCC number per cluster determines vesicular release probability without altering release time course. This "perimeter release model" provides a unifying framework accounting for developmental changes in both synaptic efficacy and time course.
AU - Nakamura, Yukihiro
AU - Harada, Harumi
AU - Kamasawa, Naomi
AU - Matsui, Ko
AU - Rothman, Jason
AU - Shigemoto, Ryuichi
AU - Silver, R Angus
AU - Digregorio, David
AU - Takahashi, Tomoyuki
ID - 1546
IS - 1
JF - Neuron
TI - Nanoscale distribution of presynaptic Ca2+ channels and its impact on vesicular release during development
VL - 85
ER -
TY - JOUR
AB - Let G be a graph on the vertex set V(G) = {x1,…,xn} with the edge set E(G), and let R = K[x1,…, xn] be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials xixj with {xi,xj} ∈ E(G), and the vertex cover ideal IG generated by monomials ∏xi∈Cxi for all minimal vertex covers C of G. A minimal vertex cover of G is a subset C ⊂ V(G) such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers LG and we explicitly describe the minimal free resolution of the ideal associated to LG which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.
AU - Mohammadi, Fatemeh
AU - Moradi, Somayeh
ID - 1547
IS - 3
JF - Bulletin of the Korean Mathematical Society
TI - Resolution of unmixed bipartite graphs
VL - 52
ER -