{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003457808,0.001697426,0.003224846,0.00144751,0.001175854,0.002493427,0.004882996,0.003638769,0.008920915],"category_scores_gemma":[0.01993423,0.00129668,0.001529985,0.002139374,0.001948489,0.004989615,0.003294855,0.00394244,0.001125129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002424843,"about_ca_system_score_gemma":0.001484173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002016255,"about_ca_topic_score_gemma":0.002267406,"domain_scores_codex":[0.9975091,0.0012321,0.00005970075,0.0004834299,0.0004027563,0.000312826],"domain_scores_gemma":[0.9795189,0.01785786,0.0006872105,0.0008631878,0.0004726515,0.0006001292],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003865416,0.00021754,0.0009673014,0.0003047313,0.00008769115,0.0001394756,0.0001206774,0.8670244,0.001066448,0.09467234,0.006368346,0.02864441],"study_design_scores_gemma":[0.00002897345,0.00002320158,0.00009689922,0.000008360587,0.000009277222,0.00002595811,0.00002070219,0.9369485,0.0002323629,0.06214561,0.0004549676,0.000005198256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1181044,0.001304892,0.8590946,0.002565994,0.0001635424,0.0000943905,0.0005002528,0.000829194,0.01734281],"genre_scores_gemma":[0.7592479,0.0006856472,0.224572,0.0005033657,0.0003240484,0.0003670514,0.001246087,0.0005862731,0.01246761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008920915,"threshold_uncertainty_score":0.02984339,"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."}}