{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001325887,0.0006847819,0.001279149,0.002437109,0.001130295,0.001637368,0.001271639,0.001289276,0.004510375],"category_scores_gemma":[0.01766874,0.0006805998,0.0008167221,0.002087496,0.001425141,0.002367245,0.002636772,0.001557442,0.001429467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001422604,"about_ca_system_score_gemma":0.002867934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001194461,"about_ca_topic_score_gemma":0.001562088,"domain_scores_codex":[0.997327,0.0006598396,0.0002262785,0.0004007353,0.001058854,0.0003273591],"domain_scores_gemma":[0.9904851,0.004894136,0.0005448426,0.001507201,0.002035525,0.0005332333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003871496,0.0001992094,0.00206831,0.0005122864,0.00005673087,0.0003702803,0.0006420601,0.1888807,0.01708074,0.4497225,0.01640964,0.3236704],"study_design_scores_gemma":[0.00009165342,0.0001954617,0.0004397546,0.00008094259,0.00002937409,0.0004204157,0.0002526279,0.5370744,0.01708979,0.4245218,0.01973639,0.00006735651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07470559,0.0004927039,0.9068313,0.000542819,0.0001029054,0.0002791543,0.000777463,0.001163267,0.01510485],"genre_scores_gemma":[0.2976735,0.0004455562,0.6943193,0.0001885477,0.00006461036,0.0003972332,0.00152097,0.0004246091,0.00496574],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004510375,"threshold_uncertainty_score":0.01508868,"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."}}