{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676477,0.0001774202,0.0001541826,0.0001630193,0.0005712821,0.0009433327,0.001601461,0.00003642222,0.00003984926],"category_scores_gemma":[0.00003940773,0.0001163792,0.00002596507,0.001052827,0.0007914348,0.001478049,0.0006695642,0.0002357511,0.0001265789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006256106,"about_ca_system_score_gemma":0.00007292737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001299001,"about_ca_topic_score_gemma":2.691507e-7,"domain_scores_codex":[0.9977041,0.00005738462,0.0002171632,0.0007224564,0.0007552378,0.0005436598],"domain_scores_gemma":[0.9987699,0.0001496221,0.00008425176,0.0005776457,0.0001804241,0.0002381197],"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.000002421304,0.00004297564,0.00004629949,0.000005763417,0.000002104451,0.000001368037,0.0001967632,0.002527428,0.000431177,0.9216416,0.00005335275,0.07504869],"study_design_scores_gemma":[0.0001746599,0.000395764,0.0004919685,0.0000691226,0.000001376622,0.00002479141,0.000005525097,0.8925745,0.001844866,0.1042105,0.00002257136,0.0001843069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04569829,0.000003631576,0.9512501,0.0003199361,0.0001936716,0.0002908971,3.408975e-7,0.0002799518,0.001963176],"genre_scores_gemma":[0.6500884,3.753345e-7,0.3496296,0.0002026966,0.00005044396,0.00001645581,4.265346e-7,0.000005490805,0.000006129948],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8900471,"threshold_uncertainty_score":0.9096578,"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."}}