Donaldson, R. and Calder, M. (2012) Modular modelling of signalling pathways and their crosstalk. Theoretical Computer Science, 456, pp. 30-50. (doi: 10.1016/j.tcs.2012.07.003)
Text
66754.pdf 594kB |
Abstract
Signalling pathways are well-known abstractions that explain the mechanisms whereby cells respond to signals. Collections of pathways form networks, and interactions between pathways in a network, known as cross-talk, enables further complex signalling behaviours. While there are several formal modelling approaches for signalling pathways, none make cross-talk explicit; the aim of this paper is to define and categorise cross-talk in a rigorous way. We define a modular approach to pathway and network modelling, based on the module construct in the PRISM modelling language, and a set of generic signalling modules. Five different types of cross-talk are defined according to various biologically meaningful combinations of variable sharing, synchronisation labels and reaction renaming. The approach is illustrated with a case-study analysis of cross-talk between the TGF-β, WNT and MAPK pathways.
Item Type: | Articles |
---|---|
Additional Information: | NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Computer Science 456 (2012). DOI: 10.1016/j.tcs.2012.07.003 |
Status: | Published |
Refereed: | Yes |
Glasgow Author(s) Enlighten ID: | Calder, Professor Muffy |
Authors: | Donaldson, R., and Calder, M. |
College/School: | College of Science and Engineering > School of Computing Science |
Journal Name: | Theoretical Computer Science |
Publisher: | Elsevier |
ISSN: | 0304-3975 |
ISSN (Online): | 1879-2294 |
Copyright Holders: | Copyright © 2012 Elsevier |
First Published: | First published in Theoretical Computer Science 456:30-50 |
Publisher Policy: | Reproduced in accordance with the copyright policy of the publisher |
University Staff: Request a correction | Enlighten Editors: Update this record