{"id":"W1969844667","doi":"10.1016/j.dam.2013.10.021","title":"A<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si22.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>d</mml:mi></mml:math>-step approach to the maximum number of distinct squares and runs in strings","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Parameterized complexity; Mathematics; String (physics); Combinatorics; Upper and lower bounds; Computation; Discrete mathematics; Algorithm; Mathematical analysis","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.001404717,0.001071987,0.0008387543,0.003537419,0.0008922189,0.003649281,0.002749128,0.001763918,0.1751584],"category_scores_gemma":[0.01037772,0.000806585,0.0009701692,0.003703227,0.00101674,0.005732545,0.002388351,0.00350651,0.1122465],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231019,"about_ca_system_score_gemma":0.0008697551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001450459,"about_ca_topic_score_gemma":0.00311106,"domain_scores_codex":[0.9986291,0.0003564341,0.0001238011,0.0002517126,0.0005680178,0.00007099014],"domain_scores_gemma":[0.995531,0.001752372,0.0001635088,0.001153705,0.001214896,0.0001844451],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002504642,0.00008583318,0.0003222306,0.0005163136,0.00003689331,0.000187099,0.000189478,0.003738439,0.006950858,0.3393587,0.4347277,0.213636],"study_design_scores_gemma":[0.00007411424,0.00005936925,0.0006993876,0.0001614182,0.00002121126,0.0006668438,0.00008494387,0.07082006,0.01638581,0.3685564,0.542398,0.00007220791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001057652,0.0003681493,0.9123223,0.001659282,0.0006466437,0.0001096265,0.005969843,0.01428452,0.0635819],"genre_scores_gemma":[0.02979968,0.0009652875,0.8442711,0.00113151,0.0008649902,0.0003773882,0.01136762,0.01721609,0.09400639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1751584,"threshold_uncertainty_score":0.5859631,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01435884101498904,"score_gpt":0.236957026351675,"score_spread":0.222598185336686,"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."}}