{"id":"W1966899942","doi":"10.1109/cit.2012.137","title":"Searching for Optimal Deletion Correcting Codes: New Properties and Extensions of Tenengolts Codes","year":2012,"lang":"en","type":"article","venue":"","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"","keywords":"Hamming code; Luby transform code; Block code; Linear code; Tornado code; Reed–Muller code; Expander code; Concatenated error correction code; Raptor code; Computer science; Turbo code; Hamming distance; Fountain code; Code (set theory); Hamming bound; Construct (python library); Algorithm; 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.001178194,0.0004993149,0.0007040533,0.001752781,0.0007782225,0.001205621,0.000982226,0.0007639581,0.001835811],"category_scores_gemma":[0.0189392,0.0003614074,0.0004674971,0.001596756,0.001600648,0.00185822,0.001043186,0.001127441,0.0003658895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007622383,"about_ca_system_score_gemma":0.001466407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001012669,"about_ca_topic_score_gemma":0.0009135036,"domain_scores_codex":[0.9990641,0.0001687206,0.00007016621,0.0002177911,0.0003447545,0.0001343718],"domain_scores_gemma":[0.9866349,0.008741491,0.001557553,0.001340802,0.00133775,0.0003873958],"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.0009703198,0.0002238191,0.02045396,0.0005241526,0.000081907,0.0007998716,0.001037035,0.2892689,0.04121718,0.4230987,0.002783603,0.2195405],"study_design_scores_gemma":[0.00008180477,0.0004699147,0.003060426,0.0001612806,0.00005718147,0.002203388,0.0003419811,0.522688,0.03441501,0.4280296,0.008339687,0.0001518065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5329084,0.001407954,0.4519902,0.0007671971,0.0000781966,0.0001003484,0.0003736505,0.0005227378,0.01185119],"genre_scores_gemma":[0.8135434,0.001133246,0.1808545,0.0002116971,0.00007869146,0.0001248605,0.0005273299,0.0001496675,0.003376634],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.001835811,"threshold_uncertainty_score":0.00623095,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0625867515575177,"score_gpt":0.2860838762251726,"score_spread":0.2234971246676549,"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."}}