{"id":"W1990514789","doi":"10.1186/1752-0509-6-113","title":"Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks","year":2012,"lang":"en","type":"article","venue":"BMC Systems Biology","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":85,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Gene regulatory network; Boolean network; Computer science; Probabilistic logic; Systems biology; Computation; Biological network; Computational complexity theory; Stochastic matrix; Sequence (biology); Boolean function; Theoretical computer science; Algorithm; Computational biology; Gene; Biology; Markov chain; Artificial intelligence; Machine learning; Genetics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001195326,0.0004313032,0.0005406706,0.0001471275,0.000203244,0.0000389492,0.0004834568,0.0005957006,0.000003893346],"category_scores_gemma":[0.00004182168,0.0004013728,0.0002214488,0.0003018046,0.00009032014,0.000006414644,0.0002655031,0.0001570728,0.00001981653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007055623,"about_ca_system_score_gemma":0.00006101105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004963659,"about_ca_topic_score_gemma":0.00001627634,"domain_scores_codex":[0.9966453,0.0005717666,0.0006136604,0.0008766911,0.0001645947,0.001128039],"domain_scores_gemma":[0.9978126,0.00002189983,0.0001897647,0.001249698,0.0001393854,0.0005866961],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006481321,0.0001331268,0.002671292,0.00001317839,0.0001174214,1.94462e-7,0.00004360648,0.9850395,0.01097506,0.0004317646,0.0002667931,0.0002431921],"study_design_scores_gemma":[0.0003137232,0.0001551195,0.0007923373,0.0000163836,0.00009641499,0.00005813843,0.0001759665,0.9971864,0.0002220829,0.000003138111,0.0004732413,0.0005071098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4281732,0.007466561,0.5631279,0.00000241035,0.0006975388,0.0003690844,0.000004896706,0.00004054733,0.0001178511],"genre_scores_gemma":[0.9917784,0.00001782902,0.002767616,0.0001122468,0.004448751,0.0001663322,0.0004576079,0.00008578888,0.0001653875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5636052,"threshold_uncertainty_score":0.9998438,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02244454250510567,"score_gpt":0.2457764000152073,"score_spread":0.2233318575101017,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}