{"id":"W2535511171","doi":"10.1109/itw2.2006.323799","title":"Construction of Optimal Edit Metric Codes","year":2006,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Guelph; Brock University","funders":"National Science Foundation","keywords":"Edit distance; Hamming distance; Hamming code; Block code; Linear code; Hamming bound; Concatenated error correction code; Computer science; Longest common subsequence problem; Metric (unit); Code word; Algorithm; Mathematics; Theoretical computer science; Discrete mathematics; Decoding methods","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.00007050781,0.00004751174,0.00006550577,0.00002195111,0.00002023879,0.000004456083,0.00005419222,0.0000671974,0.00002993631],"category_scores_gemma":[0.00002439832,0.00003431787,0.00004210401,0.00007951156,0.00006051139,6.083446e-7,0.00004057933,0.00002125243,0.000002507163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001844878,"about_ca_system_score_gemma":0.000008124684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002837956,"about_ca_topic_score_gemma":0.000003013548,"domain_scores_codex":[0.9996391,0.00001558816,0.0001083324,0.0001122499,0.0000420628,0.00008268683],"domain_scores_gemma":[0.9998314,0.000007740415,0.00003895793,0.00006738682,0.00004126367,0.00001326737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002226537,0.00004160051,0.01582243,0.000005669775,0.00001311081,5.311214e-7,8.454016e-7,0.0002045225,0.9732339,0.00255328,0.001984537,0.006117341],"study_design_scores_gemma":[0.0002037339,0.0002555327,0.009737836,0.000002234604,0.000007248702,0.00001185704,0.00002538911,0.0001709768,0.977164,0.0002408395,0.01208529,0.00009500871],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.972737,0.0001653425,0.01236761,0.00002189694,0.00009044451,0.00003108751,0.000003076027,0.000008988139,0.0145746],"genre_scores_gemma":[0.9856104,0.000009259929,0.01369641,0.0000272761,0.0002576234,6.989452e-7,0.00003631414,0.000002184351,0.0003598134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01421479,"threshold_uncertainty_score":0.1399442,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006100342524308951,"score_gpt":0.2214124100261805,"score_spread":0.2153120675018715,"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."}}