{"id":"W2804617844","doi":"10.1016/j.tcs.2018.05.017","title":"Designing and implementing algorithms for the closest string problem","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Algorithm; String (physics); Hamming distance; Time complexity; Set (abstract data type); String searching algorithm; Computer science; Mathematics; Pattern matching","routes":{"ca_aff":true,"ca_fund":true,"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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002932867,0.0001501938,0.0001314069,0.00008232496,0.001888991,0.0009996218,0.002037715,0.00002878595,0.000009396291],"category_scores_gemma":[0.000069238,0.00009379241,0.00003404263,0.0005606416,0.002026445,0.0008097384,0.002406384,0.0001178417,0.000007506997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000259233,"about_ca_system_score_gemma":0.00008647171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007422278,"about_ca_topic_score_gemma":8.288296e-7,"domain_scores_codex":[0.9978481,0.00004703064,0.0002342379,0.0006612174,0.0004248264,0.0007845954],"domain_scores_gemma":[0.9982854,0.0006121843,0.00007696664,0.0006174959,0.0002215758,0.0001864012],"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.000002590039,0.000009023955,0.00002493989,0.000003950937,0.000002769856,8.246441e-7,0.0003001702,0.000007725637,0.0007324037,0.6898618,0.00006118287,0.3089926],"study_design_scores_gemma":[0.0002270226,0.0002536122,0.0002865948,0.00003350212,0.000005758668,0.00002800974,0.00001899183,0.8977214,0.009144906,0.09077671,0.001341611,0.0001619369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002085314,0.00005443823,0.9959528,0.0007179466,0.0003764195,0.000343629,0.000002729751,0.0001203126,0.0003463436],"genre_scores_gemma":[0.4329947,0.000003408076,0.5664882,0.0002074202,0.0002849131,0.00001294222,3.838623e-7,0.000004694845,0.000003338666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8977136,"threshold_uncertainty_score":0.9994104,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02336628486097867,"score_gpt":0.2947649953804439,"score_spread":0.2713987105194652,"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."}}