{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001535676,0.0006264951,0.0005941737,0.0004033076,0.0006999396,0.001281303,0.005540704,0.0003674909,0.00001918508],"category_scores_gemma":[0.0000657895,0.000441712,0.0002017075,0.0005021229,0.0007554355,0.001197042,0.001856263,0.0009003403,0.00005671499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003545298,"about_ca_system_score_gemma":0.0007917273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007920591,"about_ca_topic_score_gemma":0.0001335757,"domain_scores_codex":[0.9953604,0.00004726358,0.0006429459,0.00193481,0.001192485,0.0008220968],"domain_scores_gemma":[0.9947847,0.001415956,0.0004988789,0.002783875,0.0003624121,0.0001541686],"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.0000140748,0.00003909576,0.00003008659,0.00008679013,0.00001778173,0.00003853934,0.0003278428,0.01257356,0.0001139937,0.0645124,0.0001745491,0.9220713],"study_design_scores_gemma":[0.0003679293,0.0003061742,0.0001702649,0.0005820254,0.00001545395,0.0001137669,2.335775e-7,0.7668657,0.000674535,0.2181296,0.01207892,0.0006954747],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001908941,0.0009500561,0.9914519,0.001779036,0.002673235,0.00149397,0.00004124826,0.0001863702,0.001405073],"genre_scores_gemma":[0.02185938,0.0003301218,0.972511,0.002371569,0.001360514,0.000101272,0.00008484463,0.00009004111,0.001291267],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9213758,"threshold_uncertainty_score":0.9998398,"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."}}