{"id":"W2110177138","doi":"10.1109/tcbb.2008.38","title":"A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data","year":2009,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Ottawa Hospital","funders":"","keywords":"Inference; Boolean network; Computational complexity theory; Series (stratigraphy); Expression (computer science); Maximum satisfiability problem; Mathematics; Boolean expression; Time complexity; Computer science; Boolean function; Algorithm; Time series; Gene regulatory network; Artificial intelligence; Machine learning; Gene; Biology; Gene expression","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01730088,0.001763907,0.002565014,0.001372898,0.001186992,0.003725001,0.003578075,0.00270337,0.003219058],"category_scores_gemma":[0.1154674,0.001636192,0.001954425,0.00235376,0.004594424,0.01288322,0.003902657,0.006162199,0.0005235291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00322557,"about_ca_system_score_gemma":0.002933053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002811121,"about_ca_topic_score_gemma":0.00524466,"domain_scores_codex":[0.9899419,0.005412083,0.0006419764,0.001493826,0.002027804,0.0004825058],"domain_scores_gemma":[0.7238539,0.2606653,0.003856965,0.008786893,0.001938221,0.0008986981],"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.001374747,0.0004048142,0.006251039,0.000584684,0.0002986052,0.0003772031,0.0005009348,0.7564834,0.005025074,0.127545,0.002551215,0.09860333],"study_design_scores_gemma":[0.00008537526,0.0001069877,0.0007532269,0.00002882692,0.00003717333,0.00009829352,0.00005465857,0.8927053,0.001193251,0.1044838,0.0004269667,0.0000260396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04568953,0.0009468814,0.9462538,0.004547331,0.00006165263,0.0001555733,0.0002583411,0.0004627746,0.001624187],"genre_scores_gemma":[0.5400764,0.001790944,0.4516161,0.001299251,0.0005037174,0.001067056,0.001170045,0.0004027814,0.002073702],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01730088,"threshold_uncertainty_score":0.09149694,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03778213872369173,"score_gpt":0.2824662853534385,"score_spread":0.2446841466297468,"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."}}