Repository logo
 
Publication

Estimating Attractor Reachability in Asynchronous Logical Models

dc.contributor.authorMendes, Nuno D.
dc.contributor.authorHenriques, Rui
dc.contributor.authorRemy, Elisabeth
dc.contributor.authorCarneiro, Jorge
dc.contributor.authorMonteiro, Pedro T.
dc.contributor.authorChaouiya, Claudine
dc.date.accessioned2018-10-10T11:28:36Z
dc.date.available2018-10-10T11:28:36Z
dc.date.issued2018-09-07
dc.descriptionThis deposit is composed by the main article. The Supplementary Material for this article can be found online at: https://www.frontiersin.org/articles/10.3389/fphys.2018.01161/full#supplementary-material.pt_PT
dc.description.abstractLogical models are well-suited to capture salient dynamical properties of regulatory networks. For networks controlling cell fate decisions, cell fates are associated with model attractors (stable states or cyclic attractors) whose identification and reachability properties are particularly relevant. While synchronous updates assume unlikely instantaneous or identical rates associated with component changes, the consideration of asynchronous updates is more realistic but, for large models, may hinder the analysis of the resulting non-deterministic concurrent dynamics. This complexity hampers the study of asymptotical behaviors, and most existing approaches suffer from efficiency bottlenecks, being generally unable to handle cyclical attractors and quantify attractor reachability. Here, we propose two algorithms providing probability estimates of attractor reachability in asynchronous dynamics. The first algorithm, named Firefront, exhaustively explores the state space from an initial state, and provides quasi-exact evaluations of the reachability probabilities of model attractors. The algorithm progresses in breadth, propagating the probabilities of each encountered state to its successors. Second, Avatar is an adapted Monte Carlo approach, better suited for models with large and intertwined transient and terminal cycles. Avatar iteratively explores the state space by randomly selecting trajectories and by using these random walks to estimate the likelihood of reaching an attractor. Unlike Monte Carlo simulations, Avatar is equipped to avoid getting trapped in transient cycles and to identify cyclic attractors. Firefront and Avatar are validated and compared to related methods, using as test cases logical models of synthetic and biological networks. Both algorithms are implemented as new functionalities of GINsim 3.0, a well-established software tool for logical modeling, providing executable GUI, Java API, and scripting facilities.pt_PT
dc.description.sponsorshipThis work was supported by Fundação para a Ciência e a Tecnologia (FCT, Portugal), grants PTDC/EIA-CCO/099229/2008, UID/CEC/50021/2013, IF/01333/2013, and PTDC/EEI-CTP/2914/2014.pt_PT
dc.description.versioninfo:eu-repo/semantics/publishedVersionpt_PT
dc.identifier.citationMendes ND, Henriques R, Remy E, Carneiro J, Monteiro PT and Chaouiya C (2018) Estimating Attractor Reachability in Asynchronous Logical Models. Front. Physiol. 9:1161. doi: 10.3389/fphys.2018.01161pt_PT
dc.identifier.doi10.3389/fphys.2018.01161pt_PT
dc.identifier.urihttp://hdl.handle.net/10400.7/897
dc.language.isoengpt_PT
dc.peerreviewedyespt_PT
dc.publisherFrontiers Mediapt_PT
dc.relationIF/01333/2013pt_PT
dc.relationMALIN: Modular modelling and Analysis of Large biological Interacting Networks
dc.relation.publisherversionhttps://www.frontiersin.org/articles/10.3389/fphys.2018.01161/fullpt_PT
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/pt_PT
dc.subjectregulatory networkpt_PT
dc.subjectlogical modelingpt_PT
dc.subjectdiscrete asynchronous dynamicspt_PT
dc.subjectattractorspt_PT
dc.subjectreachabilitypt_PT
dc.titleEstimating Attractor Reachability in Asynchronous Logical Modelspt_PT
dc.typejournal article
dspace.entity.typePublication
oaire.awardTitleMALIN: Modular modelling and Analysis of Large biological Interacting Networks
oaire.awardURIinfo:eu-repo/grantAgreement/FCT/3599-PPCDT/PTDC%2FEIA-CCO%2F099229%2F2008/PT
oaire.awardURIinfo:eu-repo/grantAgreement/FCT/5876/UID%2FCEC%2F50021%2F2013/PT
oaire.awardURIinfo:eu-repo/grantAgreement/FCT/3599-PPCDT/PTDC%2FEEI-CTP%2F2914%2F2014/PT
oaire.citation.endPage15pt_PT
oaire.citation.startPage1pt_PT
oaire.citation.titleFrontiers in Physiologypt_PT
oaire.citation.volume9pt_PT
oaire.fundingStream3599-PPCDT
oaire.fundingStream5876
oaire.fundingStream3599-PPCDT
project.funder.identifierhttp://doi.org/10.13039/501100001871
project.funder.identifierhttp://doi.org/10.13039/501100001871
project.funder.identifierhttp://doi.org/10.13039/501100001871
project.funder.nameFundação para a Ciência e a Tecnologia
project.funder.nameFundação para a Ciência e a Tecnologia
project.funder.nameFundação para a Ciência e a Tecnologia
rcaap.rightsopenAccesspt_PT
rcaap.typearticlept_PT
relation.isProjectOfPublication820042aa-3860-49b5-9f01-646a11e76442
relation.isProjectOfPublicationb051f9e7-a087-4268-b37b-02e7fbde6231
relation.isProjectOfPublicationd600f3a0-7eb6-419b-a6f5-dd692e7bf104
relation.isProjectOfPublication.latestForDiscovery820042aa-3860-49b5-9f01-646a11e76442

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Mendes,N.D._Front.Physiol._(2018).pdf
Size:
2.28 MB
Format:
Adobe Portable Document Format
Description:
main article
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: