{"id":"W2180828828","doi":"10.1016/j.tcs.2013.05.037","title":"On approximating string selection problems with outliers","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Parameterized complexity; String (physics); Hamming distance; Combinatorics; Mathematics; Polynomial-time approximation scheme; Time complexity; Outlier; Edit distance; Selection (genetic algorithm); Approximation algorithm; Set (abstract data type); Randomized algorithm; Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Statistics","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.01067869,0.002013099,0.004359384,0.003045316,0.001429566,0.002996432,0.003970244,0.00498109,0.00386814],"category_scores_gemma":[0.07086775,0.001217717,0.001357083,0.009031937,0.003725046,0.008200152,0.005028247,0.005202569,0.001059302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001840457,"about_ca_system_score_gemma":0.001586919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002324793,"about_ca_topic_score_gemma":0.00120826,"domain_scores_codex":[0.9922451,0.004200416,0.0004587201,0.0007968697,0.001930675,0.0003682884],"domain_scores_gemma":[0.9322966,0.05905269,0.001820139,0.003439873,0.002568774,0.0008219613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007225195,0.0002577473,0.002656358,0.0004219719,0.0001533745,0.0002648045,0.0003040169,0.6947604,0.001469803,0.1174877,0.007991207,0.17351],"study_design_scores_gemma":[0.00003026214,0.00006311251,0.000146164,0.0000307753,0.00001674594,0.00006860677,0.00004170221,0.9260569,0.0005349352,0.07200523,0.0009950225,0.0000105119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01822833,0.001718371,0.9765308,0.00127698,0.0001799667,0.00006229802,0.0001050337,0.0003110771,0.00158713],"genre_scores_gemma":[0.3215412,0.00397651,0.6590699,0.001185239,0.001540439,0.0005957982,0.001667861,0.0006767048,0.009746414],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01067869,"threshold_uncertainty_score":0.05647498,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006601948988134197,"score_gpt":0.2095876785386424,"score_spread":0.2029857295505082,"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."}}