{"id":"W2765086360","doi":"10.1007/978-3-319-94812-6_10","title":"State Complexity of Overlap Assembly","year":2018,"lang":"en","type":"preprint","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki","keywords":"Unary operation; Upper and lower bounds; State (computer science); Regular language; Mathematics; Combinatorics; Deterministic finite automaton; Alphabet; Binary number; Discrete mathematics; Operand; Finite-state machine; Automaton; Algorithm; Computer science; Arithmetic; Theoretical computer science","routes":{"ca_aff":true,"ca_fund":true,"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.001261703,0.0005138029,0.001017648,0.001709179,0.00167337,0.003430315,0.001527478,0.001873194,0.01225742],"category_scores_gemma":[0.01117245,0.000620519,0.0007424321,0.0008943123,0.001883617,0.004312464,0.002493144,0.001764723,0.0006960724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001365494,"about_ca_system_score_gemma":0.0008995724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001154994,"about_ca_topic_score_gemma":0.0008349633,"domain_scores_codex":[0.9989806,0.0002187675,0.00004496587,0.0001818514,0.0003358783,0.0002379155],"domain_scores_gemma":[0.9925688,0.004723873,0.0006014956,0.0007623751,0.0005595082,0.0007839507],"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.0002656821,0.00009598977,0.001841239,0.00008685965,0.00002684658,0.000162463,0.0002370808,0.05069568,0.003662368,0.9333118,0.002448083,0.007165957],"study_design_scores_gemma":[0.00002549605,0.00003032042,0.001064409,0.00001514491,0.00001426446,0.0000790556,0.00007809763,0.4330217,0.001724734,0.5633924,0.0005277093,0.00002672727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8730761,0.0003411011,0.08280428,0.002155596,0.0001036531,0.00005021242,0.0005973355,0.0005106512,0.04036104],"genre_scores_gemma":[0.9946592,0.00007203248,0.002363781,0.00006204788,0.00006311654,0.00004499097,0.0002698714,0.00007732824,0.002387654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01225742,"threshold_uncertainty_score":0.04100519,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03417745417835744,"score_gpt":0.2959145557577035,"score_spread":0.261737101579346,"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."}}