{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003806481,0.001222931,0.003166203,0.004079172,0.001672672,0.002847702,0.003209288,0.003636674,0.003753056],"category_scores_gemma":[0.02371774,0.001110935,0.001458503,0.008082368,0.001664225,0.007633507,0.002069648,0.002883465,0.001485683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001255571,"about_ca_system_score_gemma":0.002932861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003049461,"about_ca_topic_score_gemma":0.00249285,"domain_scores_codex":[0.9956802,0.0009231013,0.0006586634,0.001254015,0.001187597,0.0002963222],"domain_scores_gemma":[0.9801831,0.01362304,0.001600959,0.002212939,0.00190901,0.0004708918],"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.002019015,0.0006524173,0.004543444,0.001682068,0.0003505901,0.00137316,0.000734791,0.4003227,0.0110841,0.06610705,0.01834631,0.4927844],"study_design_scores_gemma":[0.0001020975,0.0001703286,0.0006263744,0.00008139972,0.0000595795,0.0004174502,0.0003404545,0.849076,0.004620054,0.1408074,0.003661097,0.00003782267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06659449,0.002253444,0.9235187,0.001458536,0.0002781671,0.0002224278,0.002503175,0.001263458,0.00190763],"genre_scores_gemma":[0.3375968,0.002581039,0.6363041,0.0003377738,0.0007277364,0.0005533927,0.01509445,0.0007314596,0.006073277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004079172,"threshold_uncertainty_score":0.02013087,"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."}}