{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001915906,0.0007331949,0.000552542,0.0005660293,0.001142441,0.001780779,0.008824321,0.0003968172,0.00001079742],"category_scores_gemma":[0.0001630954,0.0005068411,0.0001672265,0.001426825,0.001564831,0.001116846,0.003608756,0.001322095,0.0002805472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003673465,"about_ca_system_score_gemma":0.000972943,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001268512,"about_ca_topic_score_gemma":0.0003014005,"domain_scores_codex":[0.9938353,0.00007393962,0.0007976703,0.002263422,0.001789353,0.001240356],"domain_scores_gemma":[0.9946102,0.001108953,0.0004647691,0.003080202,0.0004498545,0.0002859914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007838567,0.00002115127,0.00005049066,0.00003541353,0.00001778865,0.0004728803,0.0003846515,0.01228959,0.0002478669,0.09410202,0.0002331678,0.8921372],"study_design_scores_gemma":[0.0002866517,0.0002261019,0.0003226635,0.0008720766,0.00001098449,0.0002067983,3.509066e-7,0.5049376,0.00120534,0.482612,0.008103632,0.001215812],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003615372,0.00072124,0.990107,0.002090842,0.002837277,0.0006377348,0.00001754886,0.000597061,0.002955132],"genre_scores_gemma":[0.05681795,0.00257194,0.9210651,0.003072649,0.002764483,0.0001905509,0.000103993,0.0003390739,0.01307428],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8909214,"threshold_uncertainty_score":0.9997383,"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."}}