Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages 2013
DOI: 10.1145/2429069.2429125
|View full text |Cite
|
Sign up to set email alerts
|

Synthesis of biological models from mutation experiments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 32 publications
(19 citation statements)
references
References 25 publications
0
18
0
Order By: Relevance
“…Model checking and symbolic reasoning have been used to verify properties of manually constructed biological models , complete partially specified pathways using perturbation data (Köksal et al, 2013), and synthesize gene regulatory networks directly from data (Dunn et al, 2014;Moignard et al, 2015) (reviewed in ). In addition, other types of declarative approaches, such as integer programming (Budak et al, 2015;Chasman et al, 2014;Jain et al, 2016;Ourfali et al, 2007;Sharan and Karp, 2013;Silverbush and Sharan, 2014) and answer set programming (Guziolowski et al, 2013), have been applied to biological pathway analysis.…”
Section: Contrasting Tps With Related Computational Approachesmentioning
confidence: 99%
“…Model checking and symbolic reasoning have been used to verify properties of manually constructed biological models , complete partially specified pathways using perturbation data (Köksal et al, 2013), and synthesize gene regulatory networks directly from data (Dunn et al, 2014;Moignard et al, 2015) (reviewed in ). In addition, other types of declarative approaches, such as integer programming (Budak et al, 2015;Chasman et al, 2014;Jain et al, 2016;Ourfali et al, 2007;Sharan and Karp, 2013;Silverbush and Sharan, 2014) and answer set programming (Guziolowski et al, 2013), have been applied to biological pathway analysis.…”
Section: Contrasting Tps With Related Computational Approachesmentioning
confidence: 99%
“…In [28], parameter synthesis for discrete GRNs is reduced to coloured LTL model checking and solved through a distributed algorithm. Methods based on SMT are presented in [29,36] to synthesize Boolean network models from time-series and perturbation experiments data.…”
Section: Related Workmentioning
confidence: 99%
“…The fifth change occurs at t 5 = 6, change (6). Here, it is z whose value changes from z 1 to z 0 ; thus, the time local transition that has realized this change has the form of: τ = z 1 → δ z 0 where can be any combination of the regulators' value at t 3 − 1 of b.…”
Section: Case Studymentioning
confidence: 99%
“…Reverse engineering of gene regulatory networks from expression data have been handled by various approaches [4][5][6][7][8]. Most of them are only static.…”
Section: Introductionmentioning
confidence: 99%