{"id":"W52186638","doi":"10.1007/978-3-642-23638-9_11","title":"Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Closure (psychology); Constraint (computer-aided design); Computer science; Regular language; Set (abstract data type); Property (philosophy); Kleene algebra; Discrete mathematics; Polynomial; DNA computing; Time complexity; Algorithm; Theoretical computer science; Mathematics; Programming language; Automaton","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.0005823411,0.0004279298,0.0004630478,0.0002220276,0.0001175059,0.00009334583,0.0009071947,0.0004890497,0.0000333943],"category_scores_gemma":[0.00009978317,0.0003547703,0.0001334982,0.000154305,0.0006505651,0.000008432895,0.0008738823,0.0005044141,0.000009447283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005318121,"about_ca_system_score_gemma":0.0001547382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004444724,"about_ca_topic_score_gemma":0.0001956425,"domain_scores_codex":[0.9976004,0.00005039438,0.0003630311,0.001097011,0.0002754056,0.0006137851],"domain_scores_gemma":[0.9989817,0.00009012693,0.0002590528,0.0004832981,0.00008019113,0.0001056203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002527253,0.0002565023,0.02464479,0.0002544436,0.0001069533,0.001103275,0.001700218,0.01123692,0.1178212,0.001197271,0.0001241836,0.8413015],"study_design_scores_gemma":[0.009659263,0.007470965,0.05668204,0.008365588,0.0001768853,0.001650388,0.00007406408,0.1267921,0.6561796,0.09903701,0.01995702,0.0139551],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2852133,0.002623221,0.6968529,0.0002593157,0.001066062,0.0006941464,0.00003831201,0.00009257558,0.01316018],"genre_scores_gemma":[0.9809344,0.0000282972,0.01754981,0.0007295392,0.000476232,0.000002091595,0.00003973155,0.00002577935,0.0002141095],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8273464,"threshold_uncertainty_score":0.9998904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02026896284138437,"score_gpt":0.2469602608082751,"score_spread":0.2266912979668907,"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."}}