{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004582409,0.001303141,0.002220565,0.00251058,0.002147439,0.004821252,0.005749437,0.004044761,0.007441843],"category_scores_gemma":[0.03187479,0.001214585,0.00174261,0.004702637,0.002365209,0.01127861,0.006190874,0.004502588,0.003738232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001586903,"about_ca_system_score_gemma":0.003032987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001285161,"about_ca_topic_score_gemma":0.001694739,"domain_scores_codex":[0.9928526,0.002096613,0.0007693684,0.001495377,0.002163281,0.0006226728],"domain_scores_gemma":[0.9860486,0.007407677,0.0007256735,0.003983489,0.001516951,0.0003176595],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000694147,0.0005040777,0.002071934,0.0006232952,0.0001573239,0.0001712671,0.0005844516,0.09605069,0.01084305,0.2020857,0.01675048,0.6694636],"study_design_scores_gemma":[0.0001839202,0.0001626366,0.0001984134,0.00007932338,0.00005207332,0.0003423133,0.000333415,0.5994238,0.01593557,0.3744141,0.008824694,0.00004972407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008885239,0.0002585096,0.9866841,0.0004570487,0.0001242048,0.000115461,0.00008408095,0.001641432,0.001749917],"genre_scores_gemma":[0.06969006,0.0002939492,0.927079,0.0002162047,0.0001390829,0.0001954387,0.0004485523,0.0003579085,0.001579829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007441843,"threshold_uncertainty_score":0.02489549,"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."}}