{"id":"W2003841667","doi":"10.1016/j.tcs.2014.04.018","title":"Approximating the maximum multiple RNA interaction problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Zhejiang Normal University; Alberta Innovates - Technology Futures","keywords":"Pseudoknot; RNA; Maximization; Pairwise comparison; Time complexity; Mathematics; Constant (computer programming); Order (exchange); Computer science; Combinatorics; Mathematical optimization; Biology; Genetics; Gene","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":[],"consensus_categories":[],"category_scores_codex":[0.001362979,0.00009690522,0.00007715043,0.00002182507,0.0002976148,0.0001141394,0.000572897,0.00004284054,0.00002388882],"category_scores_gemma":[0.0002547324,0.0000606196,0.00004258409,0.0001109988,0.0007238513,0.000008541054,0.000300549,0.00007958814,0.00006040265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007334131,"about_ca_system_score_gemma":0.00002032861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002002099,"about_ca_topic_score_gemma":4.360886e-7,"domain_scores_codex":[0.9989549,0.0001225113,0.0001462119,0.0003221485,0.0002041395,0.000250088],"domain_scores_gemma":[0.9993303,0.00007506559,0.00005555078,0.0003801782,0.00008835003,0.00007058712],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002680376,0.00002283195,0.00002303261,0.0000074868,0.000003966952,2.232497e-7,0.00006228179,0.0001007967,0.6960597,0.1940274,0.00008045737,0.109585],"study_design_scores_gemma":[0.0001713093,0.000365018,0.00005751321,0.00002631057,0.00000489228,0.00001945764,0.00001524404,0.1347861,0.8098492,0.04933487,0.005189092,0.000180953],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1451656,0.00001026188,0.8431761,0.0003293038,0.0003164836,0.0001800545,5.151447e-7,0.00002285115,0.01079883],"genre_scores_gemma":[0.9372155,0.000001986298,0.06200722,0.0004076531,0.0003226993,0.00001520982,0.000001503954,0.000007469675,0.00002076504],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7920499,"threshold_uncertainty_score":0.266706,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00843803895061503,"score_gpt":0.2331349117605872,"score_spread":0.2246968728099721,"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."}}