{"id":{"repo_id":"glasgow","oai_identifier":"oai:theses.gla.ac.uk:3571"},"canonical_url":"https://search.ndltd.org/etd/glasgow/oai:theses.gla.ac.uk:3571","repository":{"repo_id":"glasgow","name":"University of Glasgow","base_url":"https://theses.gla.ac.uk/cgi/oai2"},"display":{"title":"Modelling and analysis of structure in cellular signalling systems","abstract":"Cellular signalling is an important area of study in biology. Signalling pathways are well-known abstractions that explain the mechanisms whereby cells respond to signals. Collections of pathways form signalling networks, and interactions between pathways in a network, known as cross-talk, enables further complex signalling behaviours. Increasingly, computational modelling and analysis is required to handle the complexity of such systems. While there are several computational modelling approaches for signalling pathways, none make cross-talk explicit. We present a modular modelling framework for pathways and their cross-talk. Networks are formed by composing pathways: different cross-talks result from different synchronisations of reactions between, and overlaps of, the pathways. We formalise five types of cross-talk and give approaches to reason about possible cross-talks in a network. The complementary problem is how to handle unstructured signalling networks, i.e. networks with no explicit notion of pathways or cross-talk. We present an approach to better understand unstructured signalling networks by modelling them as a set of signal flows through the network. We introduce the Reaction Minimal Paths (RMP) algorithm that computes the set of signal flows in a model. To the best of our knowledge, current algorithms cannot guarantee both correctness and completeness of the set of signal flows in a model. The RMP algorithm is the first. Finally, the RMP algorithm suffers from the well-known state space explosion problem. We use suitable partial order reduction algorithms to improve the efficiency of this algorithm.","abstract_html":"Cellular signalling is an important area of study in biology. Signalling pathways are well-known abstractions that explain the mechanisms whereby cells respond to signals. Collections of pathways form signalling networks, and interactions between pathways in a network, known as cross-talk, enables further complex signalling behaviours. Increasingly, computational modelling and analysis is required to handle the complexity of such systems. While there are several computational modelling approaches for signalling pathways, none make cross-talk explicit. We present a modular modelling framework for pathways and their cross-talk. Networks are formed by composing pathways: different cross-talks result from different synchronisations of reactions between, and overlaps of, the pathways. We formalise five types of cross-talk and give approaches to reason about possible cross-talks in a network. The complementary problem is how to handle unstructured signalling networks, i.e. networks with no explicit notion of pathways or cross-talk. We present an approach to better understand unstructured signalling networks by modelling them as a set of signal flows through the network. We introduce the Reaction Minimal Paths (RMP) algorithm that computes the set of signal flows in a model. To the best of our knowledge, current algorithms cannot guarantee both correctness and completeness of the set of signal flows in a model. The RMP algorithm is the first. Finally, the RMP algorithm suffers from the well-known state space explosion problem. We use suitable partial order reduction algorithms to improve the efficiency of this algorithm.","abstract_has_math":false,"creators":["Donaldson, Robin"],"institution":"University of Glasgow","degree_name":null,"degree_level":"PhD","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012","date_published":"2012","updated_at":"2026-11-19T08:22:25Z","subjects":["QH301 Biology","QA75 Electronic computers. Computer science"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":"https://theses.gla.ac.uk/3571/1/2012DonaldsonPhD.pdf","download_label":"Download PDF","download_source":"dc:identifier.uri","access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://theses.gla.ac.uk/cgi/oai2?verb=GetRecord&metadataPrefix=uketd_dc&identifier=oai%3Atheses.gla.ac.uk%3A3571","prefix":"uketd_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Donaldson, Robin"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2012"]},{"key":"dc:date.issued","label":"Date","values":["2012"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["University of Glasgow"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://theses.gla.ac.uk/3571/"]},{"key":"dc:relation.isreferencedby.uri","label":"Dc Relation Isreferencedby URI","values":["https://gla.on.worldcat.org/oclc/854613977"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["PhD"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QH301 Biology","QA75 Electronic computers. Computer science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://theses.gla.ac.uk/3571/1/2012DonaldsonPhD.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Cellular signalling is an important area of study in biology. Signalling pathways are well-known abstractions that explain the mechanisms whereby cells respond to signals. Collections of pathways form signalling networks, and interactions between pathways in a network, known as cross-talk, enables further complex signalling behaviours. Increasingly, computational modelling and analysis is required to handle the complexity of such systems. While there are several computational modelling approaches for signalling pathways, none make cross-talk explicit. We present a modular modelling framework for pathways and their cross-talk. Networks are formed by composing pathways: different cross-talks result from different synchronisations of reactions between, and overlaps of, the pathways. We formalise five types of cross-talk and give approaches to reason about possible cross-talks in a network. The complementary problem is how to handle unstructured signalling networks, i.e. networks with no explicit notion of pathways or cross-talk. We present an approach to better understand unstructured signalling networks by modelling them as a set of signal flows through the network. We introduce the Reaction Minimal Paths (RMP) algorithm that computes the set of signal flows in a model. To the best of our knowledge, current algorithms cannot guarantee both correctness and completeness of the set of signal flows in a model. The RMP algorithm is the first. Finally, the RMP algorithm suffers from the well-known state space explosion problem. We use suitable partial order reduction algorithms to improve the efficiency of this algorithm."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dcterms:accessrights","label":"Dcterms Accessrights","values":["public"]},{"key":"dc:title","label":"Title","values":["Modelling and analysis of structure in cellular signalling systems"]}]}],"canonical_facts":{"dc:creator":["Donaldson, Robin"],"dc:date":["2012"],"dc:date.issued":["2012"],"dc:description.abstract":["Cellular signalling is an important area of study in biology. Signalling pathways are well-known abstractions that explain the mechanisms whereby cells respond to signals. Collections of pathways form signalling networks, and interactions between pathways in a network, known as cross-talk, enables further complex signalling behaviours. Increasingly, computational modelling and analysis is required to handle the complexity of such systems. While there are several computational modelling approaches for signalling pathways, none make cross-talk explicit. We present a modular modelling framework for pathways and their cross-talk. Networks are formed by composing pathways: different cross-talks result from different synchronisations of reactions between, and overlaps of, the pathways. We formalise five types of cross-talk and give approaches to reason about possible cross-talks in a network. The complementary problem is how to handle unstructured signalling networks, i.e. networks with no explicit notion of pathways or cross-talk. We present an approach to better understand unstructured signalling networks by modelling them as a set of signal flows through the network. We introduce the Reaction Minimal Paths (RMP) algorithm that computes the set of signal flows in a model. To the best of our knowledge, current algorithms cannot guarantee both correctness and completeness of the set of signal flows in a model. The RMP algorithm is the first. Finally, the RMP algorithm suffers from the well-known state space explosion problem. We use suitable partial order reduction algorithms to improve the efficiency of this algorithm."],"dc:format":["application/pdf"],"dc:identifier.uri":["https://theses.gla.ac.uk/3571/1/2012DonaldsonPhD.pdf"],"dc:language":["en"],"dc:publisher.institution":["University of Glasgow"],"dc:relation.isreferencedby":["https://theses.gla.ac.uk/3571/"],"dc:relation.isreferencedby.uri":["https://gla.on.worldcat.org/oclc/854613977"],"dc:subject":["QH301 Biology","QA75 Electronic computers. Computer science"],"dcterms:accessrights":["public"],"dc:title":["Modelling and analysis of structure in cellular signalling systems"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["PhD"]},"updated_at":"2026-11-19T08:22:25Z"}