{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004181937,0.0006959991,0.0005913095,0.001068693,0.001296866,0.001173544,0.0007032278,0.0007272104,0.006456665],"category_scores_gemma":[0.001502167,0.0003085654,0.0008277821,0.001196246,0.001130885,0.0008758118,0.001999743,0.001322535,0.001602168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022984,"about_ca_system_score_gemma":0.002392324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0016755,"about_ca_topic_score_gemma":0.0017241,"domain_scores_codex":[0.999325,0.0001030608,0.0000347603,0.0000959922,0.0002333317,0.0002077406],"domain_scores_gemma":[0.9992144,0.0002374776,0.00007550662,0.0001417438,0.000193259,0.0001376022],"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.000248446,0.0001409948,0.0005006032,0.0001608661,0.00002219619,0.0003330414,0.0003827771,0.005498643,0.02023611,0.9039397,0.01008261,0.05845407],"study_design_scores_gemma":[0.0001537694,0.0003774433,0.0006941417,0.0001262997,0.00006425817,0.0005149168,0.000221474,0.03700654,0.06271411,0.833627,0.06432294,0.0001771455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3140708,0.0008058098,0.5768645,0.001776097,0.001162514,0.0006854843,0.001748415,0.002767995,0.1001183],"genre_scores_gemma":[0.7841538,0.0005614913,0.178924,0.0007766224,0.000338293,0.0005443777,0.001794094,0.0006324674,0.03227493],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006456665,"threshold_uncertainty_score":0.02159971,"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."}}