{"id":"W2029929198","doi":"10.1016/j.jfranklin.2009.07.002","title":"Cyclic DNA codes over the ring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo stretchy=\"false\">[</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy=\"false\">]</mml:mo><mml:mo>/</mml:mo><mml:mo stretchy=\"false\">(</mml:mo><mml:msup><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>-</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math> based on the deletion distance","year":2009,"lang":"lv","type":"article","venue":"Journal of the Franklin Institute","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":61,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Ring (chemistry); Set (abstract data type); Mathematics; DNA; Similarity (geometry); Minimum distance; Combinatorics; Genetics; Discrete mathematics; Computer science; Biology; Artificial intelligence; Chemistry; Image (mathematics)","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.0003823223,0.0006215353,0.0003250374,0.0008817494,0.0007733473,0.001149806,0.0005350548,0.0004877485,0.05422411],"category_scores_gemma":[0.002248936,0.0002548229,0.0004161248,0.001196293,0.0006924852,0.001155426,0.0009141545,0.0007537553,0.02529097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001288846,"about_ca_system_score_gemma":0.001414272,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004069175,"about_ca_topic_score_gemma":0.003808065,"domain_scores_codex":[0.9994568,0.00007743631,0.00004022764,0.0001165578,0.0001755892,0.000133337],"domain_scores_gemma":[0.9988145,0.0002672874,0.0001896044,0.000175434,0.0004310775,0.0001223075],"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.0008789361,0.0001041338,0.001447598,0.0006382452,0.00002875822,0.000588736,0.0006287656,0.007823942,0.04367296,0.5593507,0.1581292,0.2267081],"study_design_scores_gemma":[0.0001609725,0.0003115014,0.002219537,0.0002547778,0.00003451045,0.0007338448,0.0003060708,0.01442172,0.07941116,0.1497636,0.7522458,0.0001364801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1395714,0.002141163,0.2913718,0.003699405,0.002424819,0.0004799683,0.0202703,0.01332487,0.5267162],"genre_scores_gemma":[0.5602995,0.0023037,0.1161292,0.001224866,0.0008355996,0.0005328532,0.01795389,0.003228023,0.2974923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05422411,"threshold_uncertainty_score":0.1813977,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0160574690519091,"score_gpt":0.2378533661460158,"score_spread":0.2217958970941067,"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."}}