{"id":"W2201326897","doi":"10.1007/s00200-019-00386-y","title":"Greedy construction of DNA codes and new bounds","year":2019,"lang":"en","type":"article","venue":"Applicable Algebra in Engineering Communication and Computing","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Bounded function; Greedy algorithm; Upper and lower bounds; Mathematics; Constant (computer programming); GC-content; Construct (python library); Content (measure theory); Discrete mathematics; Algorithm; Computer science; Biology; Genetics; Genome","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.0001784214,0.0000828772,0.0001295002,0.00003333435,0.0000331456,0.0000184189,0.0001214172,0.00007364409,0.000002488491],"category_scores_gemma":[0.00002038916,0.00008250337,0.00001707516,0.00008891154,0.00004184559,0.000004009537,0.0002325348,0.00008734202,8.509259e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004603114,"about_ca_system_score_gemma":0.000009977264,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000429277,"about_ca_topic_score_gemma":0.000003303325,"domain_scores_codex":[0.9994931,0.0000204734,0.0001773932,0.0001596119,0.00003769299,0.0001117038],"domain_scores_gemma":[0.9996206,0.0000476705,0.00006009571,0.0002172546,0.00001784052,0.00003658485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002885117,0.00004093743,0.1166043,0.0001372729,0.00003923402,2.349207e-7,0.0001499814,0.003739303,0.8005955,0.01931157,0.00003415116,0.05931866],"study_design_scores_gemma":[0.005087724,0.0009905151,0.3182599,0.000761566,0.00005001068,0.0001796084,0.001147218,0.3904756,0.2518659,0.005606187,0.02384741,0.001728335],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9900514,0.001072017,0.008316128,0.00005251998,0.00002191419,0.0001062895,5.56889e-7,0.00001669368,0.0003624339],"genre_scores_gemma":[0.9874727,0.0001843431,0.01223434,0.00004169146,0.00002349537,0.00000160565,0.00001830688,0.000006496984,0.00001705201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5487296,"threshold_uncertainty_score":0.336439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00668701125520002,"score_gpt":0.2098744550817642,"score_spread":0.2031874438265642,"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."}}