{"id":"W4389489786","doi":"10.1007/978-3-031-49611-0_32","title":"The Longest Subsequence-Repeated Subsequence Problem","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Subsequence; Longest increasing subsequence; Longest common subsequence problem; Substring; Combinatorics; Sequence (biology); Algorithm; Mathematics; Discrete mathematics; Computer science; Data structure; Bounded function","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.001476031,0.0008774791,0.002017517,0.001392553,0.0009640525,0.002027559,0.00242309,0.002683579,0.009183075],"category_scores_gemma":[0.01010836,0.0006372292,0.001290519,0.003701765,0.001391517,0.005014156,0.001979709,0.002074319,0.003082845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005224202,"about_ca_system_score_gemma":0.001086069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006342693,"about_ca_topic_score_gemma":0.0004424291,"domain_scores_codex":[0.9983906,0.0003905322,0.0001526281,0.000515388,0.0004256393,0.0001254129],"domain_scores_gemma":[0.9946977,0.00362643,0.0004078872,0.0007386457,0.0003885313,0.0001407779],"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.0007050291,0.0003054226,0.001258299,0.001468104,0.0003023067,0.00133805,0.0003230607,0.1177471,0.007849457,0.3021649,0.06853192,0.4980064],"study_design_scores_gemma":[0.0001055247,0.0001204046,0.0004592231,0.00009635023,0.00006557062,0.0009893455,0.0001709381,0.2212933,0.003613005,0.7520636,0.0209817,0.00004109598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0374948,0.006377547,0.9201692,0.003825059,0.001225432,0.0001606684,0.001808299,0.001266583,0.02767243],"genre_scores_gemma":[0.3369946,0.009019367,0.5915171,0.001460395,0.003957094,0.0004526402,0.009471278,0.001108091,0.04601948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009183075,"threshold_uncertainty_score":0.03072047,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02327861377219451,"score_gpt":0.24747296539501,"score_spread":0.2241943516228155,"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."}}