{"id":"W2953365201","doi":"10.48550/arxiv.1207.3385","title":"Construction of Cyclic Codes over $\\mathbb{F}_2+u\\mathbb{F}_2$ for DNA Computing","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Complement (music); BCH code; Ring (chemistry); Constraint (computer-aided design); Construct (python library); Code (set theory); Combinatorics; Discrete mathematics; Mathematics; DNA; Physics; Computer science; Algorithm; Decoding methods; Chemistry; Biology; Genetics; Computer network; Programming language; 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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003134339,0.0003492276,0.0004576409,0.00008826456,0.0001508399,0.000025527,0.0004834741,0.000644398,0.00001987337],"category_scores_gemma":[0.00008930021,0.0003524007,0.0004003943,0.0001330289,0.0002754144,0.000007535549,0.0009822304,0.0002695855,0.000006014315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004681687,"about_ca_system_score_gemma":0.00008008973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003353587,"about_ca_topic_score_gemma":0.00001039353,"domain_scores_codex":[0.9982616,0.0001167087,0.000333391,0.0007912097,0.00006203681,0.0004350872],"domain_scores_gemma":[0.9985947,0.00008188409,0.0004944316,0.0005160073,0.0001823476,0.0001306343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001531242,0.001051959,0.1615703,0.002089769,0.001860273,0.00004740508,0.0003046906,0.03891923,0.7032946,0.07485645,0.001609327,0.01286472],"study_design_scores_gemma":[0.01257601,0.003046453,0.08032947,0.001837945,0.002837476,0.0001576639,0.001981636,0.1622651,0.6365794,0.0523464,0.03735102,0.008691418],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9317583,0.0002279595,0.06581102,0.00001323733,0.0005718579,0.0003688851,0.00009889359,0.00004764231,0.001102241],"genre_scores_gemma":[0.996539,0.0001273269,0.002263874,0.00006406322,0.0004563178,9.563034e-7,0.0003014122,0.00002615257,0.0002209055],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1233459,"threshold_uncertainty_score":0.9998928,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05896943219125268,"score_gpt":0.2080864407065754,"score_spread":0.1491170085153227,"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."}}