{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004804965,0.0003160785,0.0002860524,0.00006852263,0.0002642086,0.0003891096,0.001118069,0.0002068171,0.00001924377],"category_scores_gemma":[0.00008154762,0.0002634805,0.0001384841,0.0002983166,0.0001764593,0.0004214647,0.001416072,0.0003169208,0.0002972971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001130809,"about_ca_system_score_gemma":0.00007528801,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002943323,"about_ca_topic_score_gemma":0.00003188408,"domain_scores_codex":[0.9976259,0.00002589074,0.0006284946,0.0005611386,0.0006524656,0.0005061249],"domain_scores_gemma":[0.9978611,0.0003053036,0.0003949066,0.001210628,0.00004277674,0.0001852678],"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.00002098425,0.0001511312,0.00001192481,0.0003224986,0.00004199434,0.000007289121,0.002212123,0.0001820684,0.0004470972,0.9935363,0.0005989271,0.002467688],"study_design_scores_gemma":[0.0004295101,0.00007428267,0.0002785873,0.0001789366,0.00004598056,0.00005036397,0.001056134,0.9873739,0.001117811,0.008377027,0.0007085613,0.0003089056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8250932,0.00004555101,0.1693625,0.0001501211,0.0001161957,0.0002032266,0.00005885597,0.00008473262,0.004885687],"genre_scores_gemma":[0.8654032,0.00002858784,0.1337607,0.0001924262,0.0001114993,0.0003312389,0.00007159417,0.00005968033,0.00004106149],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9871919,"threshold_uncertainty_score":0.9999818,"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."}}