{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00241966,0.001113579,0.001410077,0.002007172,0.001527159,0.003036175,0.002786747,0.001597318,0.006559429],"category_scores_gemma":[0.01424217,0.000891024,0.001589097,0.002377537,0.003340434,0.004169787,0.006540086,0.004586765,0.001690259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002980012,"about_ca_system_score_gemma":0.002370292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001361088,"about_ca_topic_score_gemma":0.002072508,"domain_scores_codex":[0.9964764,0.001132661,0.0001566045,0.0004975488,0.001260864,0.0004760137],"domain_scores_gemma":[0.9907724,0.005675691,0.000373321,0.001677414,0.0008921309,0.0006091241],"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.0001010479,0.00004025426,0.0001755895,0.00007008266,0.00001595013,0.00002828635,0.0001004923,0.02737211,0.001895153,0.947023,0.002985754,0.02019212],"study_design_scores_gemma":[0.00002693452,0.0000333581,0.00007567542,0.00003372564,0.00001147208,0.00002937193,0.00002454589,0.1016596,0.002180966,0.8918957,0.004004546,0.00002415606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02976038,0.0005702408,0.9432078,0.001226482,0.0002276251,0.00007572427,0.0002913488,0.0005676608,0.02407271],"genre_scores_gemma":[0.4407289,0.001065377,0.531095,0.001252323,0.000454278,0.0006931991,0.001038338,0.0008000742,0.02287259],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006559429,"threshold_uncertainty_score":0.02194351,"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."}}