@article{7182, abstract = {During infection pathogens secrete small molecules, termed effectors, to manipulate and control the interaction with their specific hosts. Both the pathogen and the plant are under high selective pressure to rapidly adapt and co-evolve in what is usually referred to as molecular arms race. Components of the host’s immune system form a network that processes information about molecules with a foreign origin and damage-associated signals, integrating them with developmental and abiotic cues to adapt the plant’s responses. Both in the case of nucleotide-binding leucine-rich repeat receptors and leucine-rich repeat receptor kinases interaction networks have been extensively characterized. However, little is known on whether pathogenic effectors form complexes to overcome plant immunity and promote disease. Ustilago maydis, a biotrophic fungal pathogen that infects maize plants, produces effectors that target hubs in the immune network of the host cell. Here we assess the capability of U. maydis effector candidates to interact with each other, which may play a crucial role during the infection process. Using a systematic yeast-two-hybrid approach and based on a preliminary pooled screen, we selected 63 putative effectors for one-on-one matings with a library of nearly 300 effector candidates. We found that 126 of these effector candidates interacted either with themselves or other predicted effectors. Although the functional relevance of the observed interactions remains elusive, we propose that the observed abundance in complex formation between effectors adds an additional level of complexity to effector research and should be taken into consideration when studying effector evolution and function. Based on this fundamental finding, we suggest various scenarios which could evolutionarily drive the formation and stabilization of an effector interactome.}, author = {Alcântara, André and Bosch, Jason and Nazari, Fahimeh and Hoffmann, Gesa and Gallei, Michelle C and Uhse, Simon and Darino, Martin A. and Olukayode, Toluwase and Reumann, Daniel and Baggaley, Laura and Djamei, Armin}, issn = {1664-462X}, journal = {Frontiers in Plant Science}, number = {11}, publisher = {Frontiers}, title = {{Systematic Y2H screening reveals extensive effector-complex formation}}, doi = {10.3389/fpls.2019.01437}, volume = {10}, year = {2019}, } @article{6466, abstract = {One of the most striking and consistent results in speciation genomics is the heterogeneous divergence observed across the genomes of closely related species. This pattern was initially attributed to different levels of gene exchange—with divergence preserved at loci generating a barrier to gene flow but homogenized at unlinked neutral loci. Although there is evidence to support this model, it is now recognized that interpreting patterns of divergence across genomes is not so straightforward. One problem is that heterogenous divergence between populations can also be generated by other processes (e.g. recurrent selective sweeps or background selection) without any involvement of differential gene flow. Thus, integrated studies that identify which loci are likely subject to divergent selection are required to shed light on the interplay between selection and gene flow during the early phases of speciation. In this issue of Molecular Ecology, Rifkin et al. (2019) confront this challenge using a pair of sister morning glory species. They wisely design their sampling to take the geographic context of individuals into account, including geographically isolated (allopatric) and co‐occurring (sympatric) populations. This enabled them to show that individuals are phenotypically less differentiated in sympatry. They also found that the loci that resist introgression are enriched for those most differentiated in allopatry and loci that exhibit signals of divergent selection. One great strength of the study is the combination of methods from population genetics and molecular evolution, including the development of a model to simultaneously infer admixture proportions and selfing rates.}, author = {Field, David and Fraisse, Christelle}, issn = {1365-294X}, journal = {Molecular ecology}, number = {7}, pages = {1579--1581}, publisher = {Wiley}, title = {{Breaking down barriers in morning glories}}, doi = {10.1111/mec.15048}, volume = {28}, year = {2019}, } @article{6575, abstract = {Motivated by recent experimental observations of coherent many-body revivals in a constrained Rydbergatom chain, we construct a weak quasilocal deformation of the Rydberg-blockaded Hamiltonian, whichmakes the revivals virtually perfect. Our analysis suggests the existence of an underlying nonintegrableHamiltonian which supports an emergent SU(2)-spin dynamics within a small subspace of the many-bodyHilbert space. We show that such perfect dynamics necessitates the existence of atypical, nonergodicenergy eigenstates—quantum many-body scars. Furthermore, using these insights, we construct a toymodel that hosts exact quantum many-body scars, providing an intuitive explanation of their origin. Ourresults offer specific routes to enhancing coherent many-body revivals and provide a step towardestablishing the stability of quantum many-body scars in the thermodynamic limit.}, author = {Choi, Soonwon and Turner, Christopher J. and Pichler, Hannes and Ho, Wen Wei and Michailidis, Alexios and Papić, Zlatko and Serbyn, Maksym and Lukin, Mikhail D. and Abanin, Dmitry A.}, issn = {1079-7114}, journal = {Physical Review Letters}, number = {22}, publisher = {American Physical Society}, title = {{Emergent SU(2) dynamics and perfect quantum many-body scars}}, doi = {10.1103/PhysRevLett.122.220603}, volume = {122}, year = {2019}, } @phdthesis{6473, abstract = {Single cells are constantly interacting with their environment and each other, more importantly, the accurate perception of environmental cues is crucial for growth, survival, and reproduction. This communication between cells and their environment can be formalized in mathematical terms and be quantified as the information flow between them, as prescribed by information theory. The recent availability of real–time dynamical patterns of signaling molecules in single cells has allowed us to identify encoding about the identity of the environment in the time–series. However, efficient estimation of the information transmitted by these signals has been a data–analysis challenge due to the high dimensionality of the trajectories and the limited number of samples. In the first part of this thesis, we develop and evaluate decoding–based estimation methods to lower bound the mutual information and derive model–based precise information estimates for biological reaction networks governed by the chemical master equation. This is followed by applying the decoding-based methods to study the intracellular representation of extracellular changes in budding yeast, by observing the transient dynamics of nuclear translocation of 10 transcription factors in response to 3 stress conditions. Additionally, we apply these estimators to previously published data on ERK and Ca2+ signaling and yeast stress response. We argue that this single cell decoding-based measure of information provides an unbiased, quantitative and interpretable measure for the fidelity of biological signaling processes. Finally, in the last section, we deal with gene regulation which is primarily controlled by transcription factors (TFs) that bind to the DNA to activate gene expression. The possibility that non-cognate TFs activate transcription diminishes the accuracy of regulation with potentially disastrous effects for the cell. This ’crosstalk’ acts as a previously unexplored source of noise in biochemical networks and puts a strong constraint on their performance. To mitigate erroneous initiation we propose an out of equilibrium scheme that implements kinetic proofreading. We show that such architectures are favored over their equilibrium counterparts for complex organisms despite introducing noise in gene expression. }, author = {Cepeda Humerez, Sarah A}, issn = {2663-337X}, keywords = {Information estimation, Time-series, data analysis}, pages = {135}, publisher = {Institute of Science and Technology Austria}, title = {{Estimating information flow in single cells}}, doi = {10.15479/AT:ISTA:6473}, year = {2019}, } @article{6900, abstract = {Across diverse biological systems—ranging from neural networks to intracellular signaling and genetic regulatory networks—the information about changes in the environment is frequently encoded in the full temporal dynamics of the network nodes. A pressing data-analysis challenge has thus been to efficiently estimate the amount of information that these dynamics convey from experimental data. Here we develop and evaluate decoding-based estimation methods to lower bound the mutual information about a finite set of inputs, encoded in single-cell high-dimensional time series data. For biological reaction networks governed by the chemical Master equation, we derive model-based information approximations and analytical upper bounds, against which we benchmark our proposed model-free decoding estimators. In contrast to the frequently-used k-nearest-neighbor estimator, decoding-based estimators robustly extract a large fraction of the available information from high-dimensional trajectories with a realistic number of data samples. We apply these estimators to previously published data on Erk and Ca2+ signaling in mammalian cells and to yeast stress-response, and find that substantial amount of information about environmental state can be encoded by non-trivial response statistics even in stationary signals. We argue that these single-cell, decoding-based information estimates, rather than the commonly-used tests for significant differences between selected population response statistics, provide a proper and unbiased measure for the performance of biological signaling networks.}, author = {Cepeda Humerez, Sarah A and Ruess, Jakob and Tkačik, Gašper}, issn = {1553-7358}, journal = {PLoS computational biology}, number = {9}, pages = {e1007290}, publisher = {Public Library of Science}, title = {{Estimating information in time-varying signals}}, doi = {10.1371/journal.pcbi.1007290}, volume = {15}, year = {2019}, } @article{7214, abstract = {Background: Many cancer genomes are extensively rearranged with highly aberrant chromosomal karyotypes. Structural and copy number variations in cancer genomes can be determined via abnormal mapping of sequenced reads to the reference genome. Recently it became possible to reconcile both of these types of large-scale variations into a karyotype graph representation of the rearranged cancer genomes. Such a representation, however, does not directly describe the linear and/or circular structure of the underlying rearranged cancer chromosomes, thus limiting possible analysis of cancer genomes somatic evolutionary process as well as functional genomic changes brought by the large-scale genome rearrangements. Results: Here we address the aforementioned limitation by introducing a novel methodological framework for recovering rearranged cancer chromosomes from karyotype graphs. For a cancer karyotype graph we formulate an Eulerian Decomposition Problem (EDP) of finding a collection of linear and/or circular rearranged cancer chromosomes that are determined by the graph. We derive and prove computational complexities for several variations of the EDP. We then demonstrate that Eulerian decomposition of the cancer karyotype graphs is not always unique and present the Consistent Contig Covering Problem (CCCP) of recovering unambiguous cancer contigs from the cancer karyotype graph, and describe a novel algorithm CCR capable of solving CCCP in polynomial time. We apply CCR on a prostate cancer dataset and demonstrate that it is capable of consistently recovering large cancer contigs even when underlying cancer genomes are highly rearranged. Conclusions: CCR can recover rearranged cancer contigs from karyotype graphs thereby addressing existing limitation in inferring chromosomal structures of rearranged cancer genomes and advancing our understanding of both patient/cancer-specific as well as the overall genetic instability in cancer.}, author = {Aganezov, Sergey and Zban, Ilya and Aksenov, Vitalii and Alexeev, Nikita and Schatz, Michael C.}, issn = {1471-2105}, journal = {BMC Bioinformatics}, publisher = {BMC}, title = {{Recovering rearranged cancer chromosomes from karyotype graphs}}, doi = {10.1186/s12859-019-3208-4}, volume = {20}, year = {2019}, } @inproceedings{6989, abstract = {When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with hole(s) to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special simple holes guarantee foldability. }, author = {Aichholzer, Oswin and Akitaya, Hugo A and Cheung, Kenneth C and Demaine, Erik D and Demaine, Martin L and Fekete, Sandor P and Kleist, Linda and Kostitsyna, Irina and Löffler, Maarten and Masárová, Zuzana and Mundilova, Klara and Schmidt, Christiane}, booktitle = {Proceedings of the 31st Canadian Conference on Computational Geometry}, location = {Edmonton, Canada}, pages = {164--170}, publisher = {Canadian Conference on Computational Geometry}, title = {{Folding polyominoes with holes into a cube}}, year = {2019}, } @article{6352, abstract = {Chronic overuse of common pharmaceuticals, e.g. acetaminophen (paracetamol), often leads to the development of acute liver failure (ALF). This study aimed to elucidate the effect of cultured mesenchymal stem cells (MSCs) proteome on the onset of liver damage and regeneration dynamics in animals with ALF induced by acetaminophen, to test the liver protective efficacy of MSCs proteome depending on the oxygen tension in cell culture, and to blueprint protein components responsible for the effect. Protein compositions prepared from MSCs cultured in mild hypoxic (5% and 10% O2) and normal (21% O2) conditions were used to treat ALF induced in mice by injection of acetaminophen. To test the effect of reduced oxygen tension in cell culture on resulting MSCs proteome content we applied a combination of high performance liquid chromatography and mass-spectrometry (LC–MS/MS) for the identification of proteins in lysates of MSCs cultured at different O2 levels. The treatment of acetaminophen-administered animals with proteins released from cultured MSCs resulted in the inhibition of inflammatory reactions in damaged liver; the area of hepatocyte necrosis being reduced in the first 24 h. Compositions obtained from MSCs cultured at lower O2 level were shown to be more potent than a composition prepared from normoxic cells. A comparative characterization of protein pattern and identification of individual components done by a cytokine assay and proteomics analysis of protein compositions revealed that even moderate hypoxia produces discrete changes in the expression of various subsets of proteins responsible for intracellular respiration and cell signaling. The application of proteins prepared from MSCs grown in vitro at reduced oxygen tension significantly accelerates healing process in damaged liver tissue. The proteomics data obtained for different preparations offer new information about the potential candidates in the MSCs protein repertoire sensitive to oxygen tension in culture medium, which can be involved in the generalized mechanisms the cells use to respond to acute liver failure.}, author = {Temnov, Andrey Alexandrovich and Rogov, Konstantin Arkadevich and Sklifas, Alla Nikolaevna and Klychnikova, Elena Valerievna and Hartl, Markus and Djinovic-Carugo, Kristina and Charnagalov, Alexej}, issn = {1573-4978}, journal = {Molecular Biology Reports}, publisher = {Springer}, title = {{Protective properties of the cultured stem cell proteome studied in an animal model of acetaminophen-induced acute liver failure}}, doi = {10.1007/s11033-019-04765-z}, year = {2019}, } @inproceedings{7183, abstract = {A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented during each state transition, blocking any behaviour that would cause a counter to decrease below zero. The pVASS can be used as abstractions of probabilistic programs with many decidable properties. The use of pVASS as abstractions requires the presence of nondeterminism in the model. In this paper, we develop techniques for checking fast termination of pVASS with nondeterminism. That is, for every initial configuration of size n, we consider the worst expected number of transitions needed to reach a configuration with some counter negative (the expected termination time). We show that the problem whether the asymptotic expected termination time is linear is decidable in polynomial time for a certain natural class of pVASS with nondeterminism. Furthermore, we show the following dichotomy: if the asymptotic expected termination time is not linear, then it is at least quadratic, i.e., in Ω(n2).}, author = {Brázdil, Tomás and Chatterjee, Krishnendu and Kucera, Antonín and Novotný, Petr and Velan, Dominik}, booktitle = {International Symposium on Automated Technology for Verification and Analysis}, isbn = {9783030317836}, issn = {1611-3349}, location = {Taipei, Taiwan}, pages = {462--478}, publisher = {Springer Nature}, title = {{Deciding fast termination for probabilistic VASS with nondeterminism}}, doi = {10.1007/978-3-030-31784-3_27}, volume = {11781}, year = {2019}, } @article{5830, abstract = {CLE peptides have been implicated in various developmental processes of plants and mediate their responses to environmental stimuli. However, the biological relevance of most CLE genes remains to be functionally characterized. Here, we report that CLE9, which is expressed in stomata, acts as an essential regulator in the induction of stomatal closure. Exogenous application of CLE9 peptides or overexpression of CLE9 effectively led to stomatal closure and enhanced drought tolerance, whereas CLE9 loss-of-function mutants were sensitivity to drought stress. CLE9-induced stomatal closure was impaired in abscisic acid (ABA)-deficient mutants, indicating that ABA is required for CLE9-medaited guard cell signalling. We further deciphered that two guard cell ABA-signalling components, OST1 and SLAC1, were responsible for CLE9-induced stomatal closure. MPK3 and MPK6 were activated by the CLE9 peptide, and CLE9 peptides failed to close stomata in mpk3 and mpk6 mutants. In addition, CLE9 peptides stimulated the induction of hydrogen peroxide (H2O2) and nitric oxide (NO) synthesis associated with stomatal closure, which was abolished in the NADPH oxidase-deficient mutants or nitric reductase mutants, respectively. Collectively, our results reveal a novel ABA-dependent function of CLE9 in the regulation of stomatal apertures, thereby suggesting a potential role of CLE9 in the stress acclimatization of plants.}, author = {Zhang, Luosha and Shi, Xiong and Zhang, Yutao and Wang, Jiajing and Yang, Jingwei and Ishida, Takashi and Jiang, Wenqian and Han, Xiangyu and Kang, Jingke and Wang, Xuening and Pan, Lixia and Lv, Shuo and Cao, Bing and Zhang, Yonghong and Wu, Jinbin and Han, Huibin and Hu, Zhubing and Cui, Langjun and Sawa, Shinichiro and He, Junmin and Wang, Guodong}, issn = {0140-7791}, journal = {Plant Cell and Environment}, number = {3}, pages = {1033--1044}, publisher = {Wiley}, title = {{CLE9 peptide-induced stomatal closure is mediated by abscisic acid, hydrogen peroxide, and nitric oxide in arabidopsis thaliana}}, doi = {10.1111/pce.13475}, volume = {42}, year = {2019}, } @article{5911, abstract = {Empirical data suggest that inversions in many species contain genes important for intraspecific divergence and speciation, yet mechanisms of evolution remain unclear. While genes inside an inversion are tightly linked, inversions are not static but evolve separately from the rest of the genome by new mutations, recombination within arrangements, and gene flux between arrangements. Inversion polymorphisms are maintained by different processes, for example, divergent or balancing selection, or a mix of multiple processes. Moreover, the relative roles of selection, drift, mutation, and recombination will change over the lifetime of an inversion and within its area of distribution. We believe inversions are central to the evolution of many species, but we need many more data and new models to understand the complex mechanisms involved.}, author = {Faria, Rui and Johannesson, Kerstin and Butlin, Roger K. and Westram, Anja M}, issn = {0169-5347}, journal = {Trends in Ecology and Evolution}, number = {3}, pages = {239--248}, publisher = {Elsevier}, title = {{Evolving inversions}}, doi = {10.1016/j.tree.2018.12.005}, volume = {34}, year = {2019}, } @article{5887, abstract = {Cryptographic security is usually defined as a guarantee that holds except when a bad event with negligible probability occurs, and nothing is guaranteed in that bad case. However, in settings where such failure can happen with substantial probability, one needs to provide guarantees even for the bad case. A typical example is where a (possibly weak) password is used instead of a secure cryptographic key to protect a session, the bad event being that the adversary correctly guesses the password. In a situation with multiple such sessions, a per-session guarantee is desired: any session for which the password has not been guessed remains secure, independently of whether other sessions have been compromised. A new formalism for stating such gracefully degrading security guarantees is introduced and applied to analyze the examples of password-based message authentication and password-based encryption. While a natural per-message guarantee is achieved for authentication, the situation of password-based encryption is more delicate: a per-session confidentiality guarantee only holds against attackers for which the distribution of password-guessing effort over the sessions is known in advance. In contrast, for more general attackers without such a restriction, a strong, composable notion of security cannot be achieved.}, author = {Demay, Gregory and Gazi, Peter and Maurer, Ueli and Tackmann, Bjorn}, issn = {0926-227X}, journal = {Journal of Computer Security}, number = {1}, pages = {75--111}, publisher = {IOS Press}, title = {{Per-session security: Password-based cryptography revisited}}, doi = {10.3233/JCS-181131}, volume = {27}, year = {2019}, } @article{6413, abstract = {Phase-field methods have long been used to model the flow of immiscible fluids. Their ability to naturally capture interface topological changes is widely recognized, but their accuracy in simulating flows of real fluids in practical geometries is not established. We here quantitatively investigate the convergence of the phase-field method to the sharp-interface limit with simulations of two-phase pipe flow. We focus on core-annular flows, in which a highly viscous fluid is lubricated by a less viscous fluid, and validate our simulations with an analytic laminar solution, a formal linear stability analysis and also in the fully nonlinear regime. We demonstrate the ability of the phase-field method to accurately deal with non-rectangular geometry, strong advection, unsteady fluctuations and large viscosity contrast. We argue that phase-field methods are very promising for quantitatively studying moderately turbulent flows, especially at high concentrations of the disperse phase.}, author = {Song, Baofang and Plana, Carlos and Lopez Alonso, Jose M and Avila, Marc}, issn = {0301-9322}, journal = {International Journal of Multiphase Flow}, pages = {14--24}, publisher = {Elsevier}, title = {{Phase-field simulation of core-annular pipe flow}}, doi = {10.1016/j.ijmultiphaseflow.2019.04.027}, volume = {117}, year = {2019}, } @article{5790, abstract = {The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some predrawn chords that represent an induced subgraph of G. The question is whether one can extend R′ to a representation R of the entire graph G, that is, whether one can draw the remaining chords into a partially predrawn representation to obtain a representation of G. Our main result is an O(n3) time algorithm for partial representation extension of circle graphs, where n is the number of vertices. To show this, we describe the structure of all representations of a circle graph using split decomposition. This can be of independent interest.}, author = {Chaplick, Steven and Fulek, Radoslav and Klavík, Pavel}, issn = {0364-9024}, journal = {Journal of Graph Theory}, number = {4}, pages = {365--394}, publisher = {Wiley}, title = {{Extending partial representations of circle graphs}}, doi = {10.1002/jgt.22436}, volume = {91}, year = {2019}, } @article{5857, abstract = {A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is [Formula presented](n−1), and that this bound is best possible for infinitely many values of n.}, author = {Fulek, Radoslav and Pach, János}, issn = {0166-218X}, journal = {Discrete Applied Mathematics}, number = {4}, pages = {266--231}, publisher = {Elsevier}, title = {{Thrackles: An improved upper bound}}, doi = {10.1016/j.dam.2018.12.025}, volume = {259}, year = {2019}, } @inproceedings{6430, abstract = {A proxy re-encryption (PRE) scheme is a public-key encryption scheme that allows the holder of a key pk to derive a re-encryption key for any other key 𝑝𝑘′. This re-encryption key lets anyone transform ciphertexts under pk into ciphertexts under 𝑝𝑘′ without having to know the underlying message, while transformations from 𝑝𝑘′ to pk should not be possible (unidirectional). Security is defined in a multi-user setting against an adversary that gets the users’ public keys and can ask for re-encryption keys and can corrupt users by requesting their secret keys. Any ciphertext that the adversary cannot trivially decrypt given the obtained secret and re-encryption keys should be secure. All existing security proofs for PRE only show selective security, where the adversary must first declare the users it wants to corrupt. This can be lifted to more meaningful adaptive security by guessing the set of corrupted users among the n users, which loses a factor exponential in Open image in new window , rendering the result meaningless already for moderate Open image in new window . Jafargholi et al. (CRYPTO’17) proposed a framework that in some cases allows to give adaptive security proofs for schemes which were previously only known to be selectively secure, while avoiding the exponential loss that results from guessing the adaptive choices made by an adversary. We apply their framework to PREs that satisfy some natural additional properties. Concretely, we give a more fine-grained reduction for several unidirectional PREs, proving adaptive security at a much smaller loss. The loss depends on the graph of users whose edges represent the re-encryption keys queried by the adversary. For trees and chains the loss is quasi-polynomial in the size and for general graphs it is exponential in their depth and indegree (instead of their size as for previous reductions). Fortunately, trees and low-depth graphs cover many, if not most, interesting applications. Our results apply e.g. to the bilinear-map based PRE schemes by Ateniese et al. (NDSS’05 and CT-RSA’09), Gentry’s FHE-based scheme (STOC’09) and the LWE-based scheme by Chandran et al. (PKC’14).}, author = {Fuchsbauer, Georg and Kamath Hosdurg, Chethan and Klein, Karen and Pietrzak, Krzysztof Z}, isbn = {9783030172589}, issn = {1611-3349}, location = {Beijing, China}, pages = {317--346}, publisher = {Springer Nature}, title = {{Adaptively secure proxy re-encryption}}, doi = {10.1007/978-3-030-17259-6_11}, volume = {11443}, year = {2019}, } @article{73, abstract = {We consider the space of probability measures on a discrete set X, endowed with a dynamical optimal transport metric. Given two probability measures supported in a subset Y⊆X, it is natural to ask whether they can be connected by a constant speed geodesic with support in Y at all times. Our main result answers this question affirmatively, under a suitable geometric condition on Y introduced in this paper. The proof relies on an extension result for subsolutions to discrete Hamilton-Jacobi equations, which is of independent interest.}, author = {Erbar, Matthias and Maas, Jan and Wirth, Melchior}, issn = {0944-2669}, journal = {Calculus of Variations and Partial Differential Equations}, number = {1}, publisher = {Springer}, title = {{On the geometry of geodesics in discrete optimal transport}}, doi = {10.1007/s00526-018-1456-1}, volume = {58}, year = {2019}, } @phdthesis{6894, abstract = {Hybrid automata combine finite automata and dynamical systems, and model the interaction of digital with physical systems. Formal analysis that can guarantee the safety of all behaviors or rigorously witness failures, while unsolvable in general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking, assisted theorem proving. Nevertheless, very few methods have addressed the time-unbounded reachability analysis of hybrid automata and, for current sound and automatic tools, scalability remains critical. We develop methods for the polyhedral abstraction of hybrid automata, which construct coarse overapproximations and tightens them incrementally, in a CEGAR fashion. We use template polyhedra, i.e., polyhedra whose facets are normal to a given set of directions. While, previously, directions were given by the user, we introduce (1) the first method for computing template directions from spurious counterexamples, so as to generalize and eliminate them. The method applies naturally to convex hybrid automata, i.e., hybrid automata with (possibly non-linear) convex constraints on derivatives only, while for linear ODE requires further abstraction. Specifically, we introduce (2) the conic abstractions, which, partitioning the state space into appropriate (possibly non-uniform) cones, divide curvy trajectories into relatively straight sections, suitable for polyhedral abstractions. Finally, we introduce (3) space-time interpolation, which, combining interval arithmetic and template refinement, computes appropriate (possibly non-uniform) time partitioning and template directions along spurious trajectories, so as to eliminate them. We obtain sound and automatic methods for the reachability analysis over dense and unbounded time of convex hybrid automata and hybrid automata with linear ODE. We build prototype tools and compare—favorably—our methods against the respective state-of-the-art tools, on several benchmarks.}, author = {Giacobbe, Mirco}, issn = {2663-337X}, pages = {132}, publisher = {Institute of Science and Technology Austria}, title = {{Automatic time-unbounded reachability analysis of hybrid systems}}, doi = {10.15479/AT:ISTA:6894}, year = {2019}, } @inproceedings{7147, abstract = {The expression of a gene is characterised by its transcription factors and the function processing them. If the transcription factors are not affected by gene products, the regulating function is often represented as a combinational logic circuit, where the outputs (product) are determined by current input values (transcription factors) only, and are hence independent on their relative arrival times. However, the simultaneous arrival of transcription factors (TFs) in genetic circuits is a strong assumption, given that the processes of transcription and translation of a gene into a protein introduce intrinsic time delays and that there is no global synchronisation among the arrival times of different molecular species at molecular targets. In this paper, we construct an experimentally implementable genetic circuit with two inputs and a single output, such that, in presence of small delays in input arrival, the circuit exhibits qualitatively distinct observable phenotypes. In particular, these phenotypes are long lived transients: they all converge to a single value, but so slowly, that they seem stable for an extended time period, longer than typical experiment duration. We used rule-based language to prototype our circuit, and we implemented a search for finding the parameter combinations raising the phenotypes of interest. The behaviour of our prototype circuit has wide implications. First, it suggests that GRNs can exploit event timing to create phenotypes. Second, it opens the possibility that GRNs are using event timing to react to stimuli and memorise events, without explicit feedback in regulation. From the modelling perspective, our prototype circuit demonstrates the critical importance of analysing the transient dynamics at the promoter binding sites of the DNA, before applying rapid equilibrium assumptions.}, author = {Guet, Calin C and Henzinger, Thomas A and Igler, Claudia and Petrov, Tatjana and Sezgin, Ali}, booktitle = {17th International Conference on Computational Methods in Systems Biology}, isbn = {9783030313036}, issn = {1611-3349}, location = {Trieste, Italy}, pages = {155--187}, publisher = {Springer Nature}, title = {{Transient memory in gene regulation}}, doi = {10.1007/978-3-030-31304-3_9}, volume = {11773}, year = {2019}, } @inbook{6987, abstract = {Cells are arranged into species-specific patterns during early embryogenesis. Such cell division patterns are important since they often reflect the distribution of localized cortical factors from eggs/fertilized eggs to specific cells as well as the emergence of organismal form. However, it has proven difficult to reveal the mechanisms that underlie the emergence of cell positioning patterns that underlie embryonic shape, likely because a systems-level approach is required that integrates cell biological, genetic, developmental, and mechanical parameters. The choice of organism to address such questions is also important. Because ascidians display the most extreme form of invariant cleavage pattern among the metazoans, we have been analyzing the cell biological mechanisms that underpin three aspects of cell division (unequal cell division (UCD), oriented cell division (OCD), and asynchronous cell cycles) which affect the overall shape of the blastula-stage ascidian embryo composed of 64 cells. In ascidians, UCD creates two small cells at the 16-cell stage that in turn undergo two further successive rounds of UCD. Starting at the 16-cell stage, the cell cycle becomes asynchronous, whereby the vegetal half divides before the animal half, thus creating 24-, 32-, 44-, and then 64-cell stages. Perturbing either UCD or the alternate cell division rhythm perturbs cell position. We propose that dynamic cell shape changes propagate throughout the embryo via cell-cell contacts to create the ascidian-specific invariant cleavage pattern.}, author = {McDougall, Alex and Chenevert, Janet and Godard, Benoit G and Dumollard, Remi}, booktitle = {Evo-Devo: Non-model species in cell and developmental biology}, editor = {Tworzydlo, Waclaw and Bilinski, Szczepan M.}, isbn = {9783030234584}, issn = {1861-0412}, pages = {127--154}, publisher = {Springer Nature}, title = {{Emergence of embryo shape during cleavage divisions}}, doi = {10.1007/978-3-030-23459-1_6}, volume = {68}, year = {2019}, }