{"id":"W3047376977","doi":"10.1016/j.tcs.2020.07.042","title":"Exact algorithms for the repetition-bounded longest common subsequence problem","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Hong Kong Polytechnic University","keywords":"Subsequence; Longest common subsequence problem; Algorithm; Combinatorics; Longest increasing subsequence; Bounded function; Sequence (biology); Constraint (computer-aided design); Upper and lower bounds; Symbol (formal); Mathematics; Function (biology); Exponential time hypothesis; Exponential function; Time complexity; Discrete mathematics; Computer science","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.003602316,0.002886916,0.002758266,0.0019979,0.00174267,0.002672674,0.005491633,0.002604042,0.009239518],"category_scores_gemma":[0.01929669,0.00117014,0.001971622,0.00457632,0.001893591,0.008414712,0.003234412,0.003668974,0.00346685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002621657,"about_ca_system_score_gemma":0.005093445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003519381,"about_ca_topic_score_gemma":0.003927686,"domain_scores_codex":[0.9929273,0.001317178,0.0005693646,0.002357006,0.001779487,0.001049721],"domain_scores_gemma":[0.9877762,0.007747887,0.001032284,0.002186269,0.000970401,0.0002869225],"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.00144763,0.0006754292,0.002183488,0.002081613,0.0003877573,0.0004102088,0.0007716683,0.3744332,0.01113164,0.1292152,0.03271797,0.4445442],"study_design_scores_gemma":[0.0003606501,0.0002078489,0.0003337845,0.00007927918,0.0000941014,0.0003448947,0.0001811858,0.7628599,0.004143566,0.2222773,0.009052931,0.00006462506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0188389,0.001790066,0.9676908,0.0007119815,0.0002241305,0.0003308022,0.0005527029,0.004404172,0.005456475],"genre_scores_gemma":[0.1363022,0.0008423559,0.8544878,0.000468533,0.0003004482,0.0005492117,0.002135209,0.000909897,0.004004308],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009239518,"threshold_uncertainty_score":0.0309093,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0279039761775633,"score_gpt":0.2783191148854392,"score_spread":0.2504151387078759,"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."}}