{"id":"W1550577131","doi":"10.1007/978-3-642-16321-0_10","title":"Why Large Closest String Instances Are Easy to Solve in Practice","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"String (physics); Hamming distance; Greedy algorithm; String searching algorithm; Computer science; Approximation algorithm; String metric; Combinatorics; Algorithm; Discrete mathematics; Mathematics; Data structure","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.003727256,0.00106476,0.001606165,0.001074215,0.00198764,0.005731339,0.00254313,0.004084263,0.04478361],"category_scores_gemma":[0.073339,0.001586777,0.001363375,0.00308713,0.002252701,0.0213833,0.003887631,0.005444925,0.01733093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007654036,"about_ca_system_score_gemma":0.002083902,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009202097,"about_ca_topic_score_gemma":0.001415862,"domain_scores_codex":[0.9937669,0.001978582,0.0004311159,0.001765025,0.001521261,0.0005371494],"domain_scores_gemma":[0.9522256,0.03576367,0.001303136,0.00788399,0.002122304,0.0007012992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007654151,0.000457178,0.003776806,0.001405155,0.0001637673,0.000613977,0.0009579175,0.04481035,0.00379702,0.2759211,0.1452587,0.5220727],"study_design_scores_gemma":[0.0001779602,0.000107893,0.0004534893,0.000126056,0.00003948109,0.001034865,0.0006860046,0.0765207,0.002534865,0.8952366,0.02304573,0.00003638994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09161564,0.004106135,0.8042122,0.02114577,0.001766113,0.0003322856,0.00123824,0.006928835,0.06865489],"genre_scores_gemma":[0.2961532,0.002235789,0.6637515,0.002341648,0.001226151,0.0004366846,0.002166313,0.003684076,0.02800467],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04478361,"threshold_uncertainty_score":0.1498162,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01551400689424934,"score_gpt":0.2680713928274086,"score_spread":0.2525573859331592,"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."}}