Computational methods in systems biology 14th international conference, CMSB 2016

LNBI 9859 Ezio Bartocci · Pietro Lio Nicola Paoletti (Eds.) Computational Methods in Systems Biology 14th International Conference, CMSB 2016 Cambridge, UK, September 21–23, 2016 Proceedings 123 Lecture Notes in Bioinformatics 9859 Subseries of Lecture Notes in Computer Science LNBI Series Editors Sorin Istrail Brown University, Providence, RI, USA Pavel Pevzner University of California, San Diego, CA, USA Michael Waterman University of Southern California, Los Angeles, CA, USA LNBI Editorial Board Søren Brunak Technical University of Denmark, Kongens Lyngby, Denmark Mikhail S Gelfand IITP, Research and Training Center on Bioinformatics, Moscow, Russia Thomas Lengauer Max Planck Institute for Informatics, Saarbrücken, Germany Satoru Miyano University of Tokyo, Tokyo, Japan Eugene Myers Max Planck Institute of Molecular Cell Biology and Genetics, Dresden, Germany Marie-France Sagot Université Lyon 1, Villeurbanne, France David Sankoff University of Ottawa, Ottawa, Canada Ron Shamir Tel Aviv University, Ramat Aviv, Tel Aviv, Israel Terry Speed Walter and Eliza Hall Institute of Medical Research, Melbourne, VIC, Australia Martin Vingron Max Planck Institute for Molecular Genetics, Berlin, Germany W Eric Wong University of Texas at Dallas, Richardson, TX, USA More information about this series at http://www.springer.com/series/5381 Ezio Bartocci Pietro Lio Nicola Paoletti (Eds.) • Computational Methods in Systems Biology 14th International Conference, CMSB 2016 Cambridge, UK, September 21–23, 2016 Proceedings 123 Editors Ezio Bartocci TU Wien Vienna Austria Nicola Paoletti Department of Computer Science University of Oxford Oxford UK Pietro Lio Computer Laboratory University of Cambridge Cambridge UK ISSN 0302-9743 Lecture Notes in Bioinformatics ISBN 978-3-319-45176-3 DOI 10.1007/978-3-319-45177-0 ISSN 1611-3349 (electronic) ISBN 978-3-319-45177-0 (eBook) Library of Congress Control Number: 2016948626 LNCS Sublibrary: SL8 – Bioinformatics © Springer International Publishing AG 2016 This work is subject to copyright All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed The use of general descriptive names, registered names, trademarks, service marks, etc in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made Printed on acid-free paper This Springer imprint is published by Springer Nature The registered company is Springer International Publishing AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland Preface This volume contains the papers presented at CMSB 2016, the 14th Conference on Computational Methods in Systems Biology, held on September 21–23, 2016 at the Computer Laboratory, University of Cambridge (UK) The CMSB annual conference series, initiated in 2003, provides a unique forum of discussion for computer scientists, biologists, mathematicians, engineers, and physicists interested in a system-level understanding of biological processes Topics of interest include formalisms for modelling biological processes; models and their biological applications; frameworks for model verification, validation, analysis, and simulation of biological systems; high-performance computational systems biology and parallel implementations; model inference from experimental data; model integration from biological databases; multi-scale modelling and analysis methods; and computational approaches for synthetic biology Case studies in systems and synthetic biology are especially encouraged There were 37 regular submissions, tools papers, and poster submissions Each regular submission and tool paper submission was reviewed by at least Program Committee members The committee decided to accept 17 regular papers, tool papers, and all submitted posters On average, regular and tool papers received 4.2 reviews each, while each poster submissions received reviews To complement the contributed papers, we also included in the program four invited lectures: Luca Cardelli (Microsoft Research, UK), Joëlle Despeyroux (Inria Sophia Antipolis, France), Radu Grosu (TU Wien, Austria), and Jane Hillston (University of Edinburgh, UK) As program co-chairs, we have many people to thank We are extremely grateful to the members of the Program Committee and the external reviewers for their peer reviews and the valuable feedback they provided to the authors We thank also the authors of the accepted papers for revising the papers according to the suggestions of the program committee and for their responsiveness on providing the camera-ready copies within the deadline Our special thanks goes to Franỗois Fages and all the members of the CMSB Steering Committee for their advice on organizing and running the conference We acknowledge the support of the EasyChair conference system during the reviewing process and the production of these proceedings We thank Kaushik Chowdhury and the IEEE Computer Society Technical Committee on Simulation for supporting the best student paper award and the best poster award We thank NVIDIA for providing their equipment as the best paper award Our gratitude also goes to the tool track chair, Claudio Angione, and the local organization chair, Max Conway, for their help, support, and spirited participation before, during, and after the conference We are also really grateful to Paolo Zuliani for having organized a minisymposium on Automated Reasoning for Systems Biology, which was held a day before the conference It is our pleasant duty to acknowledge the financial support from our sponsor, Microsoft Research, and the support of the Computer Laboratory at the University of Cambridge, where this year’s event was hosted Finally, we would like to VI Preface thank all the participants of the conference It was the quality of their presentations and their contribution to the discussions that made the meeting a scientific success September 2016 Ezio Bartocci Pietro Lio Nicola Paoletti Organization Program Committee Co-chairs Ezio Bartocci Pietro Lio Nicola Paoletti TU Wien, Austria University of Cambridge, UK Oxford University, UK Tools Track Chair Claudio Angione Teesside University, UK Local Organization Chair Max Conway University of Cambridge, UK Program Committee Claudio Angione Gianluca Ascolani Julio Banga Ezio Bartocci Gregory Batt Luca Bortolussi Jérémie Bourdon Andrea Bracciali Luca Cardelli Milan Češka Vincent Danos Joởlle Despeyroux Diego Di Bernardo Franỗois Fages Flavio H Fenton Jérôme Feret Calin Guet Monika Heiner Lila Kari Heinz Köppl Hillel Kugler Marta Kwiatkowska Pietro Lio Teesside University, UK University of Cambridge, UK IIM-CSIC, Spain TU Wien, Austria Inria Paris-Rocquencourt, France University of Trieste, Italy Nantes University, France University of Stirling, UK Microsoft Research, UK Oxford University, UK University of Edinburgh, UK Inria Sophia Antipolis, France University of Naples Federico II, Italy Inria Paris-Rocquencourt, France Georgia Tech, USA Inria/Ecole Normale Supérieure, France IST Austria Brandenburg University of Technology, Germany University of Western Ontario, Canada TU Darmstadt, Germany Bar-Ilan University, Israel University of Oxford, UK University of Cambridge, UK VIII Organization Oded Maler Giancarlo Mauri Pedro Mendes Nicola Paoletti Tatjana Petrov Andrew Phillips Carla Piazza Ovidiu Radulescu Blanca Rodriguez Olivier Roux David Šafránek Guido Sanguinetti Scott A Smolka Oliver Stegle Jörg Stelling Carolyn Talcott P.S Thiagarajan Adelinde Uhrmacher Verena Wolf Boyan Yordanov Paolo Zuliani CNRS-VERIMAG, France University of Milano Bicocca, Italy University of Manchester, UK/University of Connecticut Health Center, USA University of Oxford, UK IST Austria Microsoft Research Cambridge, UK University of Udine, Italy University of Montpellier 2, France University of Oxford, UK École Centrale de Nantes, France Masaryk University, Czech Republic University of Edinburgh, UK Stony Brook University, USA EBI, UK ETH Zurich, Switzerland SRI International, USA National University of Singapore, Singapore University of Rostock, Germany Saarland University, Germany Microsoft Research Cambridge, UK Newcastle University, UK Tool Evaluation Committee Claudio Angione Liu Bing Pierre Boutillier Giulio Caravagna Tommaso Dreossi Maxime Folschette Fabian Fröhlich Attila Gabot Emanuel Goncalves Benjamin Gyori Ariful Islam Luca Laurenti Curtis Madsen Dimitrios Milios Niall Murphy Abhishek Murthy Aurélien Naldi Rasmus Petersen Ly Kim Quyen Giselle Reis Satya Swarup Samal Teesside University, UK Carnegie Mellon University, USA Harvard Medical School, USA University of Edinburgh, UK UC Berkeley, USA University of Nice Sophia-Antipolis, France Helmholtz Zentrum München, Germany Aachen University, Germany EBI, UK Harvard Medical School, USA Carnegie Mellon University, USA University of Oxford, UK Boston University, USA University of Edinburgh, UK Microsoft Research Cambridge, UK Philips Research, USA Université de Montpellier, France Queen Mary University of London, UK Ecole Normale Supérieure, France Inria-Saclay, France University of Bonn, Germany Organization Fedor Shmarov Elisabeth Yaneske IX Newcastle University, UK Teesside University, UK Steering Committee Jérémie Bourdon Finn Drablos Franỗois Fages David Harel Monika Heiner Tommaso Mazza Pedro Mendes Satoru Miyano Gordon Plotkin Corrado Priami Olivier Roux Carolyn Talcott Adelinde Uhrmacher Nantes University, France NTNU, Norway Inria Paris-Rocquencourt, France Weizmann Institute of Science, Israel Brandenburg University of Technology, Germany IRCCS Casa Sollievo della Sofferenza - Mendel, Italy University of Manchester, UK/University of Connecticut Health Center, USA University of Tokyo, Japan University of Edinburgh, UK CoSBi/Microsoft Research, University of Trento, Italy École Centrale de Nantes, France SRI International, USA University of Rostock, Germany Additional Reviewers Ahmad, Jamil Asarin, Eugene Barbot, Benoit Beica, Andreea Bueno-Orovio, Alfonso Casagrande, Alberto Ĉervený, Jan Cinquemani, Eugenio Daca, Przemyslaw Dannenberg, Frits Eyassu, Filmon Forets, Marcelo Fränzle, Martin Galpin, Vashti Gilbert, David Herajy, Mostafa Islam, Md Ariful Krivine, Jean Kyriakopoulos, Charalampos Lück, Alexander Magnin, Morgan Magron, Victor Niehren, Joachim Nobile, Marco Patanè, Andrea Paulevé, Loïc Ramanathan, S Rohr, Christian Ruet, Paul Schnoerr, David Soliman, Sylvain Srivastav, Abhinav Tschaikowski, Max 342 N Goncalves et al where ‘Pro’ is a promoter and ‘Rep’ a repressor (LacI tetramer) [2], kon and koff are the rates of binding and unbinding of the repressor, and kt is the rate at which an RNA polymerase (RNAp) finds the promoter and produces an RNA From (1) and (2): h À ÁÀ1 i kRNA ¼ kon Rep koff ỵ kon RNAp kt ð3Þ Next, by confocal microscopy, we measured relative RNAp concentrations of cells expressing fluorescently tagged RpoC [3] These concentrations are 1.19 times larger at 24 °C than 37 °C This difference is too small to explain the differences in leakiness Fig (Left) MS2-GFP tagged RNAs in a cell over time Unprocessed (top) and segmented cells and RNA spots (bottom) (Right) RNA numbers resulting from the transcription activity of lacO3O1 promoter as a function of IPTG concentration and temperature, 2.5 h after activation of the production of MS2-GFP reporter molecules Next, from the RNA production rates under full induction (Fig 1), we estimated kt We find it to be only 1.92 times faster at 37 °C, also not explaining the higher leakiness Rep at 24 °C Finally, from the rate of RNA production in À the absence of Áactivators, k , we calculated the change in repression strength, b ẳ Rep koff ỵ kon =kon We nd b to be 13.8 times higher at 37 °C, from which we conclude that the hampering of the repression mechanism at low temperatures is the main cause for the increased leakiness Given this, we also expect the temperature-dependence of leakiness to vary widely between promoters, as their repressions mechanisms also differ widely In the future, we aim to study the effects of low temperatures on the repression mechanisms of various promoters We expect greater robustness in those associated to E coli’s responses to low temperatures Also, we aim to explore how the temperaturedependence in leakiness affects gene circuits’ robustness to temperature changes References Penumetcha, P., Lau, K., Zhu, X., Davis, K., Eckdahl, T.T., Campbell, A.M.: Improving the lac system for synthetic biology BIOS 81, 7–15 (2010) Rutkauskas, D., Zhan, H., Matthews, K.S., Pavone, F.S., Vanzi, F.: Tetramer opening in laci-mediated DNA looping Proc Natl Acad Sci 106, 16627–16632 (2009) Bratton, B.P., Mooney, R.A., Weisshaar, J.C.: Spatial distribution and diffusive motion of RNA polymerase in live escherichia coli J Bacteriol 193, 5138–5146 (2011) GPU-Accelerated Steady-State Analysis of Probabilistic Boolean Networks Andrzej Mizera1(B) , Jun Pang1,2 , and Qixia Yuan1 Faculty of Science, Technology and Communication, University of Luxembourg, Luxembourg City, Luxembourg {andrzej.mizera,jun.pang,qixia.yuan}@uni.lu Interdisciplinary Centre for Security, Reliability and Trust, University of Luxembourg, Luxembourg City, Luxembourg Problem Statement Steady-state computation is important for analysing biological systems modelled as probabilistic Boolean networks (PBNs) Since the state-space is exponential in the number of nodes, the use of statistical methods and Monte Carlo methods remain the only feasible approach to address the problem for large PBNs (e.g., with more than 50 nodes) [2, 5] Such methods usually rely on long simulations of a PBN; hence the simulation speed becomes critical For large PBNs with high precision requirements, a slow simulation speed becomes an obstacle of computing the steady-state probabilities Intuitively, parallelising the simulation process can be an ideal way to accelerate the computation process Our Approach We propose to parallel the simulation of PBNs using multiple graphics processing unit (GPU) cores A GPU usually contains hundreds or thousands of cores It uses data parallelism, i.e., the same instruction is run in different cores with different data The memories provided by GPU can be divided into two types based on the access speed: fast-memory and slow-memory Accessing fast-memory is highly efficient, but the size of fast-memory is very limited A GPU program is executed in parallel by the GPU threads Usually thousands of threads are launched in parallel to hide latency Due to the specific architecture of GPUs, parallelising a process in a GPU has to be treated carefully A discussion of two particular issues follows Firstly, synchronisation between cores is very time expensive in a GPU To avoid it, we let each GPU core handle all the nodes in a PBN Instead of simulating one trajectory, we simulate multiple trajectories in parallel Samples from multiple trajectories can be combined to compute steady-state probabilities using a combination of the two-state Markov chain approach with the Gelman &Rubin method [1, 3] Secondly, the performance of a GPU is highly related to how well the latency is hidden Latency can be hidden via the use of more threads, more blocks, and/or fast-memory More threads/blocks require more fast-memory, but the size of fast-memory is very limited Therefore, a trade-off between the number of threads/blocks and the use of fast-memory is required We first optimize our Q Yuan—Supported by the National Research Fund, Luxembourg (grant 7814267) c Springer International Publishing AG 2016 E Bartocci et al (Eds.): CMSB 2016, LNBI 9859, pp 343–345, 2016 DOI: 10.1007/978-3-319-45177-0 344 A Mizera et al data structure to minimize the use of memory and then follow the rule that the frequently accessed information should be put in fast-memory whenever possible since the latency caused by accessing slow-memory is relatively large To better understand the optimization, we briefly review what a PBN is A PBN is composed of a set of binary-valued nodes, each of which has a certain number of Boolean functions The process of simulating a PBN consists of selecting a Boolean function for each node and updating its value in accordance the selected function (see [4, 6] for details) The state (value of all nodes) and the Boolean functions (stored as a truth table) are repeatedly used in the simulation process and require much memory to store, hence we optimize the data structure to represent the state of a PBN and the truth table We use the primitive integer type (32 bits) instead of Boolean arrays to store a state of a PBN The integer type is used due to the following two reasons: (1) it reduces the memory usage by times comparing to Boolean arrays; (2) operations on 32 bits data are faster than or equal to those on non-32 bits data in our GPU architecture The truth table is optimized similarly as the state, i.e., it is also stored using integers After optimization, we store the state in registers (fast-memory), if possible In the cases that a PBN is extremely large and registers are not enough, the slow global memory is used However, accessing this slow global memory is reduced by 32 times using an intermediate register The truth table as well as other frequently accessed arrays (e.g., the selection probabilities) are stored in shared memory (fast-memory) Frequently accessed single variables are stored in registers After arranging all variables in memory, we compute the optimal number of threads and blocks to be launched based on the usage of fast-memory to hide latency as much as possible Table GPU speedup for computing four steady-state probabilities node # CPU time (s) GPU time (s) speedup 100 635.27 1.84 345× 200 424.18 1.84 231× 500 1567.77 5.80 270× 91 905.10 3.54 256× Preliminary Results We have evaluated the proposed GPU-based simulation of PBNs for computing steady-state probabilities of both randomly generated networks and of a real biological network using the approach in [3] On randomly generated networks, our proposed GPU-based parallelised approach showed more than two orders of magnitude speedups compared to the sequential CPU version The evaluation on a real biological network was performed by analysing an apoptosis network with 91 nodes [2] The speedups for computing steady-state probabilities for randomly generated networks and the real 91-node network are shown in Table All experiments were conducted on a high-performance GPU-Accelerated Steady-State Analysis 345 computing (HPC) node, which contained Intel Xeon E5-2680 v3 @2.5 GHz and a NVIDIA Tesla K80 Graphic Card with 2496 cores @824MHz References Gelman, A., Rubin, D.: Inference from iterative simulation using multiple sequences Stat Sci 7(4), 457–472 (1992) Mizera, A., Pang, J., Yuan, Q.: Reviving the two-state markov chain approach Technical report (2015) http://arxiv.org/abs/1501.01779 Mizera, A., Pang, J., Yuan, Q.: Parallel approximate steady-state analysis of large probabilistic Boolean networks In: Proceedings of the 31st ACM Symposium on Applied Computing, pp 1–8 (2016) Shmulevich, I., Dougherty, E., Zhang, W.: From Boolean to probabilistic Boolean networks as models of genetic regulatory networks Proc IEEE 90(11), 1778–1792 (2002) Trairatphisan, P., Mizera, A., Pang, J., Tantar, A.A., Sauter, T.: optPBN: an optimisation toolbox for probabilistic boolean networks PLOS ONE 9(7) (2014) Trairatphisan, P., Mizera, A., Pang, J., Tantar, A.A., Schneider, J., Sauter, T.: Recent development and biomedical applications of probabilistic Boolean networks Cell Commun Signal 11, 46 (2013) PINT: A Static Analyzer for Dynamics of Automata Networks Loăc Pauleve(B) LRI UMR 8623, Univ Paris-Sud CNRS, Universite Paris-Saclay, Saint-aubin, France loic.pauleve@lri.fr The software Pint1 is devoted to the formal analysis of the transient dynamics of automata networks, which encompasses Boolean and logical networks Its main application domain is in systems biology for addressing models of signalling networks and gene regulatory networks Pint implements formal approximations of transient reachability-related properties, such as cut sets and model reduction which preserves all the traces that lead to a given goal (state) Pint has been applied to numerous large biological networks It has been experimentally shown that it can address networks with hundreds and thousands of interacting components, which are often intractable with standard approaches Input Formalism Pint takes as input Asynchronous Automata Networks (ANs) [4] ANs are close to Boolean and multi-valued networks, with the major difference that ANs rely on explicit transitions rules, instead of function-centered specifications Any logical network can be encoded in AN The tool logicalmodel2 can export SBML-qual models [2] to the Pint format: java -jar LogicalModel.jar sbml:an model.sbml model.an Static Analyses for Transient Dynamics Pint implements various analysis related to reachability properties It relies on static analysis by abstract interpretation which provides algorithms with a low complexity and guaranteed results Formal approximations of reachability Necessary and sufficient conditions for reachability have been derived in [4, 8] They can be efficiently verified on large ANs The following command line checks those conditions for the reachability of active BCL6 in a TCell differentiation model from [1] Such a model is too large for exact model-checking, but in this case, the sufficient condition is satisfied (computation took around 1s): $ pint-reach -i TCell-d.an BCL6=1 True Cut-sets are set of component states which predict mutations that should prevent a given reachability to occur Pint implements a highly scalable formal approximation of cut sets: all identified cut sets are correct, but some may be missed or be non-minimal [7] The following command computes cut sets with at most components which are not in the initial state for the transient http://loicpauleve.name/pint https://github.com/colomoto/logicalmodel c Springer International Publishing AG 2016 E Bartocci et al (Eds.): CMSB 2016, LNBI 9859, pp 346–347, 2016 DOI: 10.1007/978-3-319-45177-0 Pint: A Static Analyzer for Dynamics of Automata Networks 347 reachability of BCL6 within the TCell differentiation model Computation took less than 0.05 s Given the results, knocking down CD28 and IL6R should prevent the transient activation of BCL6 $ pint-reach cutsets no-init-cutsets -i TCell-d.an BCL6=1 "GP130"=1 "STAT3"=1 "CD28"=1,"IL6R"=1 "IL6RA"=1,"TCR"=1 Goal-oriented model reduction removes transitions that not contribute to the reachability of the supplied goal state The reduction can truncate significantly the reachable state space, whereas it preserves all the (minimal) traces to the goal The following command line reduces the TCell differentiation model for the reachability of BCL6 before using NuSMV to verify if active IL2RA and IL6RA form a cut set for BCL6 (CTL property not E [ IL2RA!=1 and IL6RA!=1 U BCL6=1 ]) Without the model reduction, the model-checking of this property was impossible [6] $ pint-export -i TCell-d.an reduce-for-goal BCL6=1 \ | pint-nusmv is-cutset"IL2RA=1,IL6RA=1" BCL6=1 Interaction with Other Softwares Bridges with other standard tools for dynamical models have been developed, in particular for model-checking (NuSMV [3], ITS [5], Mole [9]) It allows to take advantage of the static analyses of Pint beforehand further exact dynamical analyses References Abou-Jaoud´e, W., Monteiro, P.T., Naldi, A., Grandclaudon, M., et al.: Model checking to assess T-Helper cell plasticity Front Bioeng Biotech (2015) Chaouiya, C., B´erenguier, D., Keating, S.M., Naldi, A., et al.: SBML qualitative models: a model representation format and infrastructure to foster interactions between qualitative modelling formalisms and tools BMC Syst Biol 7(1), 135 (2013) Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV 2: an opensource tool for symbolic model checking In: Brinksma, E., Larsen, K.G (eds.) CAV 2002 LNCS, vol 2404, pp 359–364 Springer, Heidelberg (2002) Folschette, M., Paulev´e, L., Magnin, M., Roux, O.: Sufficient conditions for reachability in automata networks with priorities Theor Comp Sci 608, 66–83 (2015) LIP6/Move Its tools http://ddd.lip6.fr/itstools.php Paulev´e, L.: Goal-Oriented Reduction of Automata Networks Research report, May 2015 https://hal.archives-ouvertes.fr/hal-01149118 Paulev´e, L., Andrieux, G., Koeppl, H.: Under-approximating cut sets for reachability in large scale automata networks In: Sharygina, N., Veith, H (eds.) CAV 2013 LNCS, vol 8044, pp 69–84 Springer, Heidelberg (2013) Paulev´e, L., Magnin, M., Roux, O.: Static analysis of biological regulatory networks dynamics using abstract interpretation Math Struct in Comp Sci 22(04), 651–685 (2012) Schwoon, S.: Mole http://www.lsv.ens-cachan.fr/∼schwoon/tools/mole/ Linear Temporal Logic for Biologists in BMA Benjamin A Hall1(B) , Nir Piterman2 , and Jasmin Fisher1,3 University of Cambridge, Cambridge, UK bh418@mrc-cu.cam.ac.uk University of Leicester, Leicester, UK Microsoft Research, Cambridge, UK The BioModelAnalyzer (BMA1 ) is a web based tool for the development of discrete models of biological systems Through a graphical user interface, it allows rapid development of complex models of gene and protein interaction networks and stability analysis without requiring users to be proficient computer programmers [1, 2] Here I will present a new set of tools in the BMA that allow users to perform complex queries over models in linear temporal logic, allowing biologists to test specifications based on the dynamics observed in simulations In keeping with the core objective of tool, queries are constructed graphically and results are presented to the users with examples of simulations Alongside stability analysis, this new tool allows biologists to verify complex specifications to validate executable biological models Linear temporal logic queries are substantially more complex than stability testing due to the fundamental requirement for users to construct the query and select a path length Biologists specifically face further problems; biological models typically have many variables that may be included in a query, they may not be familiar with complex operator precedence issues, and they must balance parentheses Whilst this is handled by NuSMV in other tools [3, 4], a design principle of BMA is that computing proficiency is not required so necessarily this must be achieved in the GUI We address these issues in the tool through a two-stage workflow (Fig 1) Users define LTL states; large conjunctions of variable assignments that may be Fig The LTL state editor and the LTL query editor http://biomodelanalyzer.research.microsoft.com/ c Springer International Publishing AG 2016 E Bartocci et al (Eds.): CMSB 2016, LNBI 9859, pp 348–350, 2016 DOI: 10.1007/978-3-319-45177-0 Linear Temporal Logic for Biologists in BMA 349 created by dragging and dropping from the model canvas, or through a dropdown menu inspired by file browsers These states are tansformed into an LTL query in a second temporal and logical layer Operators in this layer carry a number of “sockets” into which operands (i.e LTL states) or other operators may be dragged and dropped As such complex queries can be developed through repeatedly nesting operators To aid users several default states are included In addition to “True”, users may also search for fixpoints or cycles in the system These are valuable for studying biological models as they allow users to study developmental end-points specifically The description of these states through other operators would be difficult For example, a self loop state is characterised by the formula v∈V v = Xv To the best of our knowledge, most LTL tools not support such a direct comparison between the value of a variable and its value in the next state User testing indicated that the LTL operator “until” confused unfamiliar users, as the first operand need not hold To address this we supplemented the list of operators with the non-standard operator “upto”, which carries a similar meaning in English but ensures that both operands hold (A upto B corresponds to A and next A until B) Fig An example trace from an LTL query On clicking the test button both the query and its negation are checked This produces three types of result- always true, never true, and true for some The user can then choose to see examples of simulations that satisfy, or fail to satisfy the query (Fig 2) References Benque, D., Bourton, S., Cockerton, C., Cook, B., Fisher, J., Ishtiaq, S., Piterman, N., Taylor, A., Vardi, M.Y.: Bma: visual tool for modeling and analyzing biological networks In: Madhusudan, P., Seshia, S.A (eds.) CAV 2012 LNCS, vol 7358, pp 686–692 Springer, Heidelberg (2012) 350 B.A Hall et al Chuang, R., Hall, B., Benque, D., Cook, B., Ishtiaq, S., Piterman, N., Taylor, A., Vardi, M., Koschmieder, S., Gottgens, B., Fisher, J.: Drug target optimization in chronic myeloid leukemia using innovative computational platform Sci Rep 5, 8190 (2015) Naldi, A., Thieffry, D., Chaouiya, C.: Decision diagrams for the representation and analysis of logical models of genetic networks In: Calder, M., Gilmore, S (eds.) CMSB 2007 LNCS (LNBI), vol 4695, pp 233–247 Springer, Heidelberg (2007) Bean, D., Heimbach, J., Ficorella, L., Micklem, G., Oliver, S., Favrin, G.: esyN: network building, sharing, and publishing PLoS ONE 9, e106035 (2014) Deregulation of Osmotic Regulation Machinery Explains and Predicts Cellular Transformation in Cancer and Disease David Shorthouse(B) , Angela Riedel, Jacqueline Shields, and Benjamin A Hall MRC Cancer Unit, University of Cambridge, Cambridge, UK Osmotic regulation is a hugely important homeostatic system in all cells Cells respond to osmotic stresses by activating or upregulating proteins involved in the transportation of charged ions, primarily Chlorine, Potassium, Sodium, and Calcium Additionally, the movement of ions and osmotically obliged water are necessary for many of the cellular hallmarks exhibited in the transformations associated with disease states such as cancer In particular, the aberrant expression of ion channels are hallmarks for increased proliferative and invasive behaviours [1, 2] We present a formal model of the osmotic regulation machinery within a mammalian cell The model can provide a mechanistic explanation for the behavioural changes observed in highly diverse cellular systems of murine premetastatic Lymph Node stromal cells, and Lung Cancer Fibroblasts The model explains phenotypic transformations within each cell types, and predicts behaviour from datasets not involved in its generation Furthermore, we use the model to predict key proteins involved in each transformation, and propose experiments to alter the behaviour of cells in controllable ways Fig The model of osmoregulation as rendered by BMA Phenotype nodes not shown for clarity c Springer International Publishing AG 2016 E Bartocci et al (Eds.): CMSB 2016, LNBI 9859, pp 351–352, 2016 DOI: 10.1007/978-3-319-45177-0 352 D Shorthouse et al A qualitative network of key channels, ions, and transporters was constructed using the BioModelAnalzer (http://biomodelanalyzer.research.microsoft.com/, [3, 4]) As osmoregulation achieves a homeostasis, the model was verified both through stability analysis (which proves the existence of a global attractor) and simulation Initially a specification was constructed from the literature, and then refined against microarray data from resting fibroblast reticular cells (FRCs) in the lymph node [5] To model the response of the FRCs to upstream tumuors at different timepoints, a subset of the ion channels and transporters were deregulated This in turn caused wide-spread, coordinated changes in other channels through osmotic pressure alterations, and subsequent changes in cellular phenotypes The model was found to accurately predict the changes observed in the FRCs, and subsequent validation of expression changes supported the model findings References Prevarskaya, N., Skryma, R., Shuba, Y.: Ion channels and the hallmarks of cancer Trends Mol Med 16, 107–21 (2010) Djamgoz, M., Coombes, R., Schwab, A.: Ion transport and cancer: from initiation to metastasis In: Philosophical Transactions of the Royal Society of London Series B, Biological Sciences, vol 369 (2014) Benque, D., Bourton, S., Cockerton, C., Cook, B., Fisher, J., Ishtiaq, S., Piterman, N., Taylor, A., Vardi, M.Y.: Bma: visual tool for modeling and analyzing biological networks In: Madhusudan, P., Seshia, S.A (eds.) CAV 2012 LNCS, vol 7358, pp 686–692 Springer, Heidelberg (2012) Chuang, R., Hall, B., Benque, D., Cook, B., Ishtiaq, S., Piterman, N., Taylor, A., Vardi, M., Koschmieder, S., Gottgens, B., Fisher, J.: Drug target optimization in chronic myeloid leukemia using innovative computational platform Sci Rep 5, 8190 (2015) Riedel, A., Shorthouse, S., Haas, L., Hall, B., Shields, J.: Tumor-induced stromal reprogramming drives lymph node transformation Nat Immunol 17 (2016) Game Theoretic Consideration of Transgenic Bacteria in the Human Gut Microbiota Converting Omega-6 to Omega-3 Fats Ahmed M Ibrahim1(B) and James Smith2,3,4 44 El-Geish St, Mansoura, Dakahlia, Egypt wetawdt@gmail.com Department of Applied Mathematics and Theoretical Physics, Centre for Mathematical Sciences, Cambridge Computational Biology Institute, Wilberforce Rd, Cambridge CB3 0WA, UK MRC Elsie Widdowson Laboratory, MRC Human Nutrition Research, University of Cambridge, 120 Fulbourn Rd, Cambridge CB1 9NL, UK School of Food Science and Nutrition, Faculty of Mathematics and Physical Sciences, University of Leeds, Leeds LS2 9JT, UK j.smith252@leeds.ac.uk Abstract Prophylactic use of functional foods and the design of nutraceuticals has a far-reaching public health benefit Understanding the phenotypic manipulations needed to take advantage of gut microbial ecology is fundamental to bioengineering and the food, diet and health industries This work considers a hypothetical adjustment of gut microbiota by an introduced transgenic bacterial strain that contributes to increased exposure of essential omega-3 (n-3) poly-unsaturated fatty acids, the socalled fish oils Absorption of the essential poly-unsaturated fats from food is dominated by the omega-6 (n-6) fats over the omega-3 (n-3) fats Unfortunately, long-term depleted levels of n-3-containing lipids in blood plasma is a high-risk indicator for outcomes such as metabolic syndrome, cardiovascular disease and diabetes-related conditions In our vignette, a genetically modified strain converts excessive dietary n-6 into bioavailable n-3 in the gut Maintaining a long-term co-existence between indigenous gut bacteria and the transgenic strain is the challenge Game theory is an appropriate formalism for exploring such conflicts We show that long-term co-existence is predicted if the two forms of bacteria engage in the Snowdrift game Our model explores putative mechanisms for addressing metabolic syndrome and related conditions by locally increasing n-3 production by the transgenic gut bacteria Our model suggests long-term therapeutic supplementation by a functional probiotic food is possible without detriment to the indigenous bacteria Keywords: Game theory · Snow drift game · Prisoners’ dilemma · Nonlinear behaviour · Gut microbiome · Fat metabolism c Springer International Publishing AG 2016 E Bartocci et al (Eds.): CMSB 2016, LNBI 9859, p 353, 2016 DOI: 10.1007/978-3-319-45177-0 Revealing Biomarker Mixtures in Lipid Pools from Large-Scale Lipidomics Kai Loell1 , Albert Koulman2 , and James Smith1,2,3(B) Department of Applied Mathematics and Theoretical Physics, Centre for Mathematical Sciences, Cambridge Computational Biology Institute, University of Cambridge, Wilberforce Rd, Cambridge CB3 0WA, UK 10311kai@gmail.com MRC Elsie Widdowson Laboratory, MRC Human Nutrition Research, 120 Fulbourn Rd, Cambridge CB1 9NL, UK ak675@cam.ac.uk Faculty of Mathematics and Physical Sciences, School of Food Science and Nutrition, University of Leeds, Leeds LS2 9JT, UK j.smith252@leeds.ac.uk Abstract Lipids are key structural elements, energy sources, and components for intracellular signalling and metabolic processes Their constituents are a small number of fatty acids (FAs), indicators of metabolic health and nutrition and biomarkers for disease risk Lipids contain singlet, doublet and triplet combinations of FAs Different combinations of FAs can have equivalent configurations that in aggregate are observed as lipid mixture pools Traditionally, the lipid pools have been considered to be biomarkers, however it is now recognised that subpopulations of explicit lipid species are more informative Lipid biomarkers for metabolic states, so far, come from the latent (hidden) structure of sub-populations in the pools and this needs to be addressed Epidemiological high-resolution lipidomics data is required to derive the mixtures of lipid species contributing to lipid pools FA signals are acquired using gas chromatography and lipid profiling performed by direct infusion high resolution mass spectrometry Profiling identifies lipid mixture pools as spectral peaks separated by their m/z ratio However, not all constituent lipid sub-populations are easily distinguished Furthermore, the data generated is compositional with the signals of FAs and lipid pools normalised separately Our approach to this problem uses both lipid pool and FA data Lipid data is re-scaled to account for the combinations of FAs required in each observed pool A linear algebra Gauss-Jordan reduction algorithm is applied to the stoichiometry of FAs incorporated in the explicit lipid species and the combinations of lipid species in every pool The method solves the contributing lipid species sub-populations, that is, the representative combinations of FAs that form the pools Abundances of explicit FA combinations not only improve lipid biomarker identification but also provide a more detailed picture of metabolic responses Keywords: Compositional mixture modelling · Optimisation markers · Metabolic states · Big data · Lipidomics c Springer International Publishing AG 2016 E Bartocci et al (Eds.): CMSB 2016, LNBI 9859, p 354, 2016 DOI: 10.1007/978-3-319-45177-0 · Bio- Author Index Anand, Priya 339 Backenköhler, Michael 15 Banga, Julio R 323 Becker, Kolja 323 Ben Abdallah, Emna 30 Beneš, Nikola 82 Borkowska-Panek, Monika 339 Bortolussi, Luca 15, 49 Brim, Luboš 82 Byrne, Greg 132 Caravagna, Giulio 49 Cardelli, Luca 147, 333 Červený, Jan 316 Chiu, Wu Kai 67 Clarke, Edmund M 132, 289 Cleaveland, Rance 132 Czeizler, Eugen 67 Demko, Martin 82 Despeyroux, Joëlle Dittrich, Peter 232 Faeder, James R 289 Fages, Franỗois 98 Fenton, Flavio H 132 Feret, Jérôme 116 Fiedler, Anna 186 Fink, Karin 339 Fisher, Jasmin 348 Fonseca, Jose M 341 Fridlyand, Leonid 273 Goncalves, Nadia 341 Gratie, Cristian 67 Grosu, Radu 132, 334 Gußmann, Florian 339 Hall, Benjamin Hasenauer, Jan Hillston, Jane Hrabec, Jakub A 348, 351 186 335 316 Ibrahim, Ahmed M 353 Inoue, Katsumi 30 Islam, Md Ariful 132 Jones, Paul L 132 Kandavalli, Vinodh K 341 Kanhaiya, Krishna 67 Kong, Soonho 132 Koulman, Albert 354 Kwiatkowska, Marta 147 Laurenti, Luca 147 Lhoussaine, Cédric 201 Liu, Bing 289 Lo, Chieh 168 Loell, Kai 354 Loos, Carolin 186 Lotze, Michael 289 Lý, Kim Quyên 116 Madelaine, Guillaume 201 Magnin, Morgan 30 Marculescu, Radu 168 Martinez, Thierry 98 Miskov-Zivanov, Natasa 289 Mizera, Andrzej 216, 309, 343 Mu, Chunyan 232 Niehren, Joachim 201 Oliveira, Samuel M.D 341 Pang, Jun 216, 309, 343 Parker, David 232 Pastva, Samuel 82 Paulevé, Loïc 252, 343 Petre, Ion 67 Philipson, Louis 273 Piterman, Nir 348 Radulescu, Ovidiu 273 Reinitz, John 273 356 Author Index Ribeiro, Andre S 341 Ribeiro, Tony 30 Riedel, Angela 351 Romanovská, Františka 316 Rosenblueth, David A 98 Roux, Olivier 30 Rowe, Jonathan E 232 Soliman, Sylvain 98 Sommer-Simpson, Jasha 273 Tonello, Elisa 201 Troják, Matej 316 Villaverde, Alejandro F 323 Šafránek, David 82, 316 Šalagovič, Jakub 316 Sanguinetti, Guido 49 Shields, Jacqueline 351 Shorthouse, David 351 Smith, James 353, 354 Smolka, Scott A 132 Wang, Qinsi 289 Wenzel, Wolfgang 339 Wolf, Verena 15 Yuan, Qixia 216, 309, 343 ... USA More information about this series at http://www.springer.com/series/5381 Ezio Bartocci Pietro Lio Nicola Paoletti (Eds.) • Computational Methods in Systems Biology 14th International Conference,. .. focused on c Springer International Publishing AG 2016 E Bartocci et al (Eds.): CMSB 2016, LNBI 9859, pp 3–12, 2016 DOI: 10.1007/978-3-319-45177-0 J Despeyroux Boolean systems and in this case a... parameters in a Bayesian setting, e.g by ABC methods [33] However, the total number of simulations to be performed is huge, still resulting in a computationally intensive approach c Springer International