{"id":"W2145838433","doi":"10.1007/11496656_2","title":"On the Longest Common Rigid Subsequence Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Longest common subsequence problem; Substring; Subsequence; Time complexity; Longest increasing subsequence; Combinatorics; Computer science; Similarity (geometry); Algorithm; Mathematics; Artificial intelligence; Data structure","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.002202402,0.001313315,0.002417053,0.002330194,0.001971631,0.002711266,0.003143395,0.002743327,0.01294044],"category_scores_gemma":[0.01242665,0.0008083878,0.001448378,0.006879834,0.002652335,0.01005319,0.004060193,0.003983725,0.003705078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028314,"about_ca_system_score_gemma":0.001446375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0017481,"about_ca_topic_score_gemma":0.001180984,"domain_scores_codex":[0.9979925,0.000519475,0.0001616719,0.0005069262,0.0006034722,0.0002160139],"domain_scores_gemma":[0.9944808,0.003526317,0.0003104264,0.001020692,0.0005056556,0.0001561354],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003077371,0.0001656739,0.000487196,0.0005288808,0.00009606921,0.0003498969,0.0002744117,0.06438638,0.00226469,0.6246374,0.04107629,0.2654254],"study_design_scores_gemma":[0.00003397942,0.00003953277,0.0001492882,0.00004883233,0.00002024806,0.0001873951,0.00008353324,0.08086205,0.0008720894,0.9064388,0.01124319,0.00002102692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02573903,0.004912957,0.9183976,0.004102031,0.001083786,0.0001374531,0.0007790833,0.0007749064,0.04407319],"genre_scores_gemma":[0.2819195,0.01221732,0.6382513,0.001678563,0.004483627,0.0005209843,0.007203334,0.001254988,0.05247028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01294044,"threshold_uncertainty_score":0.04329008,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01861443766463373,"score_gpt":0.2435803459182233,"score_spread":0.2249659082535896,"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."}}