{"id":"W1584808909","doi":"10.1007/11851561_22","title":"On the Complexity of the Crossing Contact Map Pattern Matching Problem","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"RNA Research and Splicing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Time complexity; Computer science; Matching (statistics); Interval (graph theory); Algorithm; Pattern matching; Set (abstract data type); Substructure; Polynomial; Computational complexity theory; Theoretical computer science; Combinatorics; Mathematics; Artificial intelligence","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.002025402,0.00114342,0.003188824,0.001859681,0.002378892,0.006847902,0.00432841,0.003921734,0.02251593],"category_scores_gemma":[0.02429124,0.001042127,0.001793131,0.00498222,0.002717979,0.01353946,0.004325988,0.004989437,0.001942055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002238095,"about_ca_system_score_gemma":0.00182383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003608186,"about_ca_topic_score_gemma":0.002350171,"domain_scores_codex":[0.9972528,0.0007339985,0.0001672854,0.0006322423,0.0008240637,0.0003896694],"domain_scores_gemma":[0.9766679,0.0195155,0.001074716,0.001334996,0.0007600955,0.0006467547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007792829,0.0004751103,0.003256158,0.0008047065,0.0001955577,0.0005752667,0.000585556,0.1728929,0.002545219,0.6913207,0.0345554,0.09201416],"study_design_scores_gemma":[0.00006910972,0.00003438348,0.000504508,0.0000304252,0.00003714969,0.0001784248,0.0001179188,0.2165214,0.0004575565,0.7798271,0.002196244,0.00002584837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4058657,0.004275942,0.4616187,0.01414336,0.0005924352,0.000427379,0.004523084,0.00130417,0.1072494],"genre_scores_gemma":[0.8425642,0.00371368,0.1225253,0.001043276,0.001202258,0.0005262742,0.005668864,0.0005603475,0.02219577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02251593,"threshold_uncertainty_score":0.07532328,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02305254288140221,"score_gpt":0.2653243336359522,"score_spread":0.24227179075455,"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."}}