{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006064466,0.001124911,0.0009480362,0.00276592,0.0006097325,0.00109423,0.001594185,0.0009526305,0.00262452],"category_scores_gemma":[0.00477134,0.0005906646,0.001418827,0.001603762,0.0008242285,0.00162714,0.001697896,0.0008132535,0.0007321181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000991761,"about_ca_system_score_gemma":0.0009965972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005234405,"about_ca_topic_score_gemma":0.008633784,"domain_scores_codex":[0.9992793,0.0001747139,0.00003400453,0.0002500361,0.0001344571,0.0001274583],"domain_scores_gemma":[0.9983422,0.0008457584,0.0002201823,0.0002623492,0.0001949838,0.0001346433],"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.000629957,0.0004194203,0.02349105,0.0006594945,0.0005070517,0.0009939597,0.000942803,0.5347577,0.03384746,0.03711793,0.01033411,0.356299],"study_design_scores_gemma":[0.00002286648,0.00004577907,0.001611823,0.00001541586,0.00003631736,0.0001023697,0.000114402,0.9601057,0.002689227,0.03394218,0.001302327,0.00001156165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1876778,0.0003831223,0.8047195,0.0002832411,0.00003265381,0.0001711087,0.0009106251,0.003795362,0.002026557],"genre_scores_gemma":[0.6457403,0.0002109239,0.3457311,0.0001422111,0.00003567858,0.0002382685,0.005269235,0.000445432,0.002186904],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005234405,"threshold_uncertainty_score":0.01040792,"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."}}