{"id":"W2079307253","doi":"10.1016/s1570-8667(03)00080-7","title":"The longest common subsequence problem for arc-annotated sequences","year":2004,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University; University of Alberta","funders":"","keywords":"Longest common subsequence problem; Sequence (biology); Subsequence; Arc (geometry); Longest increasing subsequence; Computer science; Matching (statistics); Combinatorics; Algorithm; Similarity (geometry); Artificial intelligence; Mathematics; Biology; Genetics; Statistics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001067008,0.0002138786,0.0003180309,0.00009543237,0.0005486677,0.0005264895,0.002160956,0.00007308061,0.00000215145],"category_scores_gemma":[0.00007744222,0.0001222458,0.0002035941,0.0003807413,0.0001869253,0.001435632,0.0002303406,0.0003410928,0.000006712038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001094737,"about_ca_system_score_gemma":0.0003121123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008764632,"about_ca_topic_score_gemma":0.00002757126,"domain_scores_codex":[0.9978348,0.00008332203,0.0007248719,0.0002719372,0.0006337118,0.0004513774],"domain_scores_gemma":[0.9978342,0.0002919612,0.0007233035,0.0005232181,0.000426203,0.0002010838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003378112,0.0005157024,0.0006665091,0.0001340462,0.0005124764,0.0008145456,0.003147566,0.01578971,0.009202225,0.135707,0.00788026,0.8252922],"study_design_scores_gemma":[0.008935285,0.006591733,0.006063569,0.001553112,0.0001983326,0.004178165,0.0009723229,0.1396494,0.03522214,0.6885039,0.1061371,0.001994894],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00751294,0.002193489,0.9804004,0.008155109,0.001028742,0.0003918134,0.00003756629,0.00005730396,0.0002225669],"genre_scores_gemma":[0.289021,0.001021564,0.7084844,0.0003924815,0.0008160925,0.00003820504,0.00001598917,0.00003561731,0.0001746987],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8232973,"threshold_uncertainty_score":0.5076951,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01808276619542487,"score_gpt":0.2840613365543329,"score_spread":0.265978570358908,"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."}}