{"id":"W1760096751","doi":"10.1007/s00200-013-0188-x","title":"Construction of cyclic codes over $$\\mathbb F _2+u\\mathbb F _2$$ F 2 + u F 2 for DNA computing","year":2013,"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":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Complement (music); BCH code; Ring (chemistry); Constraint (computer-aided design); Combinatorics; Construct (python library); Physics; Mathematics; DNA; Discrete mathematics; Computer science; Chemistry; Decoding methods; Algorithm; Biology; Genetics; Computer network; Geometry","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.0003689612,0.0001888551,0.0002762585,0.00007023977,0.0001318166,0.0000511094,0.0003168434,0.0001559249,0.000004817416],"category_scores_gemma":[0.0000862829,0.0001882797,0.00006996591,0.0001708673,0.00008991265,0.00001177468,0.0003708727,0.0001574433,0.000001746514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001609183,"about_ca_system_score_gemma":0.00001348457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000062037,"about_ca_topic_score_gemma":0.000003473293,"domain_scores_codex":[0.9988177,0.00004767682,0.0004588353,0.0003058409,0.00007744122,0.0002925475],"domain_scores_gemma":[0.9990753,0.0002025706,0.000181403,0.0003960157,0.00008293645,0.00006180296],"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.00003153251,0.0001582141,0.01908369,0.0003711211,0.00009602129,3.3233e-7,0.000247963,0.01300049,0.8718743,0.01693973,0.0001895074,0.07800703],"study_design_scores_gemma":[0.002359797,0.0003577376,0.05248215,0.0004499329,0.00003847273,0.00004716511,0.0005868829,0.7893831,0.1443535,0.002909782,0.005987165,0.001044261],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9230404,0.0007011488,0.07542243,0.00007669683,0.00004813806,0.0004142293,0.000003077229,0.00005245552,0.0002413967],"genre_scores_gemma":[0.9582009,0.0001045946,0.04138577,0.00009871869,0.00007572564,0.00002744738,0.00007704314,0.00002078823,0.000008968605],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7763826,"threshold_uncertainty_score":0.7677824,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005864888415478002,"score_gpt":0.222129005381761,"score_spread":0.216264116966283,"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."}}