{"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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001443511,0.0002544788,0.000263496,0.0000645697,0.001218774,0.001158209,0.005099915,0.00006225645,0.00003412434],"category_scores_gemma":[0.0001316746,0.0001629438,0.000107738,0.001191867,0.00247104,0.001178246,0.001767252,0.0002938306,0.00006252133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005699982,"about_ca_system_score_gemma":0.0001986716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001383656,"about_ca_topic_score_gemma":0.000001129941,"domain_scores_codex":[0.996866,0.0001046257,0.00038334,0.001076474,0.0008773189,0.0006922411],"domain_scores_gemma":[0.9970778,0.0008830001,0.0001290372,0.001207682,0.0002786082,0.0004238782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001328561,0.00003666626,0.00001976837,0.00001340153,0.000004857293,0.00001020721,0.000378207,0.0002657477,0.0003249916,0.9164569,0.0003789383,0.08209702],"study_design_scores_gemma":[0.000270773,0.0003524472,0.0003455941,0.00003273466,0.00000756646,0.00003654796,0.000008619735,0.8713386,0.00221236,0.1227333,0.002409843,0.0002516241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00101875,0.00009272956,0.9809514,0.01587513,0.0005217558,0.0005988298,0.00001481495,0.0003105817,0.0006160348],"genre_scores_gemma":[0.5773306,0.00001636744,0.4192583,0.002929677,0.0003950741,0.00004739666,0.000004974104,0.00001162053,0.00000602374],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8710729,"threshold_uncertainty_score":0.9998787,"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."}}