{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001281945,0.0005798819,0.0005918429,0.001038373,0.0003493254,0.0009654122,0.004647818,0.0004262536,0.00001811579],"category_scores_gemma":[0.0004583079,0.0005218153,0.00009090239,0.001033196,0.0002601995,0.002207505,0.003462326,0.001800458,0.00005531214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002845256,"about_ca_system_score_gemma":0.0005099645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001292527,"about_ca_topic_score_gemma":0.00171324,"domain_scores_codex":[0.9949833,0.00003820367,0.0006055178,0.001991024,0.00130463,0.001077344],"domain_scores_gemma":[0.9962978,0.0007108367,0.0004427188,0.00187661,0.0003316462,0.0003404226],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004640422,0.0003019987,0.0004081923,0.00009320978,0.00002214316,0.001189072,0.002857569,0.01560757,0.0005666872,0.0824059,0.0003297174,0.8961715],"study_design_scores_gemma":[0.001443901,0.0005388461,0.001185357,0.003605808,0.00002219838,0.000276577,0.000005600708,0.3615263,0.003272502,0.10215,0.5228331,0.003139733],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009780835,0.0004170423,0.991482,0.002125331,0.002816371,0.0004797773,0.00002503075,0.0001398392,0.002416767],"genre_scores_gemma":[0.01757895,0.00008098136,0.9707695,0.01068233,0.0007342557,0.000017866,0.000008845248,0.00004200368,0.00008532395],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8930318,"threshold_uncertainty_score":0.9997233,"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."}}