{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002781492,0.000409922,0.0002778868,0.0008883686,0.0007976723,0.0005799717,0.0004632591,0.0005384799,0.003482253],"category_scores_gemma":[0.001243106,0.0001918477,0.000406956,0.0007155403,0.001022528,0.0005241305,0.00091469,0.0007578051,0.0009754127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007560224,"about_ca_system_score_gemma":0.001072716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008635391,"about_ca_topic_score_gemma":0.001199493,"domain_scores_codex":[0.9996912,0.00005799391,0.0000115724,0.00004801833,0.0001196865,0.00007152091],"domain_scores_gemma":[0.999428,0.0001848404,0.00007572838,0.000111354,0.0001081907,0.00009179481],"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.0001443881,0.0001060561,0.0007037325,0.0002245878,0.00001599522,0.0003826215,0.0003059876,0.01487719,0.05335637,0.8129774,0.004938712,0.111967],"study_design_scores_gemma":[0.00009786186,0.0004567201,0.001126481,0.0001428323,0.00004613224,0.001177226,0.0001242888,0.1008407,0.1647113,0.645478,0.08562333,0.0001751585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3731467,0.001820153,0.5445075,0.001007868,0.0005495979,0.0003659656,0.0007829952,0.001274589,0.07654466],"genre_scores_gemma":[0.7936009,0.0008786534,0.1886361,0.0003208887,0.0001716037,0.0003242739,0.0005549557,0.0002694702,0.0152431],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003482253,"threshold_uncertainty_score":0.01164931,"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."}}