{"id":"W2394599118","doi":"","title":"A Parameterized Formulation for the Maximum Number of Runs Problem.","year":2011,"lang":"en","type":"article","venue":"","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Parameterized complexity; Combinatorics; Mathematics; String (physics); Bounded function; Alphabet; Upper and lower bounds; Diagonal; Table (database); Function (biology); Discrete mathematics; Constant (computer programming); Computer science; Mathematical analysis; Geometry","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.004275995,0.002046362,0.002236343,0.001331506,0.001497253,0.0051511,0.00467738,0.003468785,0.01534017],"category_scores_gemma":[0.02213526,0.001452247,0.002655752,0.002666982,0.002715432,0.01229749,0.002895605,0.004817608,0.001768996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00379371,"about_ca_system_score_gemma":0.002219145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002103511,"about_ca_topic_score_gemma":0.00211992,"domain_scores_codex":[0.9949621,0.001838468,0.0003223151,0.001501526,0.0008116737,0.000564037],"domain_scores_gemma":[0.9856014,0.01019313,0.001323198,0.001435058,0.0007540838,0.0006931542],"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.0005339453,0.000238704,0.001411699,0.0006624252,0.000151194,0.000449483,0.0004079924,0.2976179,0.002777552,0.6483073,0.01253516,0.03490655],"study_design_scores_gemma":[0.00007358526,0.00008757445,0.0002588791,0.00008114799,0.00004033278,0.0002057462,0.0001024971,0.4594516,0.001043386,0.5318346,0.006784418,0.00003625223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0584477,0.001436118,0.9053904,0.003288558,0.0001885693,0.0003141022,0.002746019,0.000858833,0.02732977],"genre_scores_gemma":[0.5467566,0.001257499,0.4168438,0.001149754,0.0006132806,0.001310726,0.004590271,0.001667865,0.02581028],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01534017,"threshold_uncertainty_score":0.05131799,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04923647735752655,"score_gpt":0.2761872924681522,"score_spread":0.2269508151106256,"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."}}