{"id":"W2992362114","doi":"10.1007/978-3-030-36412-0_1","title":"Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Longest common subsequence problem; Longest increasing subsequence; Subsequence; Bounded function; Algorithm; Computer science; Simple (philosophy); Exponential function; Sequence (biology); Time complexity; Combinatorics; Discrete mathematics; Mathematics","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.00191208,0.001711427,0.002732331,0.001995987,0.001706575,0.003490733,0.005091961,0.002417404,0.01562471],"category_scores_gemma":[0.01290256,0.001138829,0.00156438,0.005079249,0.001544639,0.007381506,0.00400439,0.003569257,0.005519632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001919901,"about_ca_system_score_gemma":0.00340658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003098211,"about_ca_topic_score_gemma":0.00424307,"domain_scores_codex":[0.9965826,0.0006613412,0.0002765305,0.000945046,0.001086722,0.0004478554],"domain_scores_gemma":[0.9922321,0.004506922,0.0003942907,0.001908637,0.0007584149,0.0001996812],"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.0009922107,0.0005204747,0.0006908783,0.0007818559,0.0001668353,0.0002161617,0.0003815068,0.1457524,0.006696286,0.1625804,0.0438535,0.6373675],"study_design_scores_gemma":[0.0003248578,0.0001438762,0.0002516104,0.00007443295,0.00006781743,0.0002503935,0.0001702827,0.5626791,0.003622387,0.4221342,0.01023637,0.00004470057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01408885,0.001392513,0.9673719,0.0007705421,0.0003269094,0.0002302448,0.000735611,0.003217807,0.01186565],"genre_scores_gemma":[0.1173789,0.0008317203,0.8681422,0.0003658542,0.0004075723,0.0005178208,0.002550192,0.0009073165,0.008898323],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01562471,"threshold_uncertainty_score":0.05226982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02583166160923958,"score_gpt":0.2675583788214435,"score_spread":0.2417267172122039,"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."}}