{"id":"W2086340885","doi":"10.1016/j.jda.2011.08.005","title":"On the structure of run-maximal strings","year":2011,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"String (physics); Property (philosophy); Combinatorics; Cover (algebra); Mathematics; Compression (physics); String searching algorithm; Computer science; Algorithm; Data structure; Discrete mathematics; Physics; Engineering","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.001988203,0.0005968601,0.001259473,0.002791694,0.002064034,0.003979302,0.001994618,0.001681262,0.00743998],"category_scores_gemma":[0.02236136,0.0007634989,0.0006096677,0.003751771,0.004130195,0.009139161,0.00356979,0.003133693,0.001317516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001304273,"about_ca_system_score_gemma":0.001212204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006821293,"about_ca_topic_score_gemma":0.0008568207,"domain_scores_codex":[0.9984989,0.0004382241,0.0001252181,0.0003154205,0.0003797736,0.0002423516],"domain_scores_gemma":[0.9773319,0.01596896,0.001822824,0.002500947,0.001427653,0.0009476374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004907454,0.00008956812,0.001815644,0.0001464697,0.00002271322,0.0002103267,0.0007594853,0.01851529,0.002663664,0.9314306,0.004798758,0.03905681],"study_design_scores_gemma":[0.00001987293,0.00004336733,0.0002763604,0.00004459111,0.00001192148,0.00007511368,0.0000973432,0.03309084,0.001014642,0.9630424,0.002266885,0.00001662651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4698735,0.002789785,0.4663895,0.004801463,0.0003315601,0.0001029591,0.001857849,0.001801921,0.05205147],"genre_scores_gemma":[0.9069439,0.001348824,0.07326076,0.0006834108,0.0004864343,0.000160461,0.002236991,0.0007732798,0.01410599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00743998,"threshold_uncertainty_score":0.02488917,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02079478762518111,"score_gpt":0.2360137644056544,"score_spread":0.2152189767804733,"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."}}