{"id":"W3164771453","doi":"10.1371/journal.pcbi.1008990","title":"Finding recurrent RNA structural networks with fast maximal common subgraphs of edge-colored graphs","year":2021,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Canadian Institutes of Health Research; Natural Sciences and Engineering Research Council of Canada; Institute for Basic Science; Genome Canada","keywords":"RNA; Computer science; Nucleic acid secondary structure; Algorithm; Base (topology); Theoretical computer science; Base pair; Computational biology; Mathematics; Biology; Genetics; DNA","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.0000874836,0.0001734305,0.0002572666,0.00006049991,0.00008341292,0.00001320766,0.0001640069,0.0001726813,0.00005272716],"category_scores_gemma":[0.00003452906,0.000148368,0.000100796,0.0001624839,0.0001461351,0.000003776473,0.00009425655,0.0001022261,0.000002036694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008710737,"about_ca_system_score_gemma":0.00008530996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005238385,"about_ca_topic_score_gemma":0.00002053097,"domain_scores_codex":[0.9988369,0.0001776277,0.0002704198,0.0003646279,0.0001119642,0.0002384278],"domain_scores_gemma":[0.9993117,0.00007503051,0.0001684,0.0001781126,0.0002029434,0.00006374036],"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.0008282358,0.0001759647,0.02834379,0.00005615214,0.0005882566,0.00002080884,0.0000966503,0.01332003,0.9214497,0.01624111,0.0001376313,0.01874164],"study_design_scores_gemma":[0.002011126,0.002428653,0.03045581,0.0001195108,0.0001238551,0.0001770422,0.0001383963,0.01149154,0.9227778,0.02881104,0.0006742559,0.0007909481],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9846899,0.0009325299,0.01362305,0.0001025574,0.0001869657,0.0001628945,0.00005872115,0.00001314532,0.0002302154],"genre_scores_gemma":[0.9890028,0.00004632842,0.009629409,0.0001152411,0.00009104382,0.00002282036,0.001053737,0.0000168932,0.00002171313],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01795069,"threshold_uncertainty_score":0.6050271,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01453524437481185,"score_gpt":0.2457971338334719,"score_spread":0.2312618894586601,"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."}}