{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.008771225,0.004072046,0.001631836,0.002133876,0.007515784,0.006499058,0.01118918,0.009794826,0.3242693],"category_scores_gemma":[0.008164596,0.006963028,0.009077261,0.004813797,0.007657687,0.003297031,0.007373367,0.008695007,0.003210102],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001321766,"about_ca_system_score_gemma":0.005885225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004582636,"about_ca_topic_score_gemma":0.005283067,"domain_scores_codex":[0.9640849,0.003017642,0.007901701,0.006674925,0.009297553,0.00902326],"domain_scores_gemma":[0.9717763,0.00543432,0.01011012,0.007046131,0.001180914,0.00445222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00946534,0.001947162,0.0001059686,0.002867545,0.008613097,0.004822872,0.003231435,0.01452357,0.018311,0.3760425,0.5495569,0.01051258],"study_design_scores_gemma":[0.007384841,0.007128296,0.0002630239,0.004879054,0.006369747,0.00575434,0.004488538,0.02199301,0.9134761,0.003004906,0.01863276,0.006625396],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6921914,0.007029356,0.002749779,0.003553884,0.009654577,0.0002829922,0.00243635,0.0008105609,0.2812911],"genre_scores_gemma":[0.962236,0.006698239,0.003870583,0.006823264,0.009882272,0.002925453,0.004233356,0.002842306,0.0004885505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8951651,"threshold_uncertainty_score":0.9997505,"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."}}