{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008630176,0.0009393373,0.001207012,0.001227133,0.001033024,0.004631017,0.001745221,0.001141675,0.009025148],"category_scores_gemma":[0.006512076,0.00112436,0.002212416,0.002019818,0.002194472,0.01040574,0.002803392,0.002644275,0.001467124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00110498,"about_ca_system_score_gemma":0.0009173501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001296581,"about_ca_topic_score_gemma":0.00295425,"domain_scores_codex":[0.9986345,0.0001290206,0.0001201407,0.0004807392,0.0003984683,0.0002371323],"domain_scores_gemma":[0.9960193,0.002820266,0.0002435213,0.0004179419,0.0002989766,0.000199992],"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.001149165,0.0004410357,0.003645747,0.001927085,0.0002230529,0.000758456,0.003478247,0.05282951,0.04174568,0.7089381,0.0110645,0.1737994],"study_design_scores_gemma":[0.00006136534,0.00009408163,0.0005157018,0.0001163135,0.00009065085,0.0002817835,0.0009171999,0.04349243,0.01858959,0.9269551,0.008818526,0.00006738173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4124371,0.0008347442,0.5550763,0.001059146,0.0001719358,0.0002028737,0.002980431,0.004090595,0.02314694],"genre_scores_gemma":[0.7013596,0.0004485707,0.2836455,0.0002004446,0.00008986211,0.000136086,0.004659858,0.001193709,0.008266383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009025148,"threshold_uncertainty_score":0.03019214,"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."}}