{"id":"W1605220802","doi":"10.1007/11496656_1","title":"Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Upper and lower bounds; Simple (philosophy); Computer science; Scheme (mathematics); Abstraction; Approximation algorithm; Polynomial-time approximation scheme; Algorithm; Discrete mathematics; Combinatorics; Theoretical computer science; 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.01814592,0.004521724,0.005363902,0.003868674,0.00419424,0.009241347,0.01466078,0.009249314,0.02050533],"category_scores_gemma":[0.08214828,0.002775915,0.004930016,0.005942503,0.009210601,0.02279711,0.0190384,0.02297103,0.004516299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01129351,"about_ca_system_score_gemma":0.005581119,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003351541,"about_ca_topic_score_gemma":0.00396345,"domain_scores_codex":[0.9852269,0.003834825,0.0009253178,0.002718095,0.005000079,0.002294668],"domain_scores_gemma":[0.9115184,0.0608169,0.002541191,0.0166366,0.004841734,0.003645184],"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.002253074,0.000524641,0.001197048,0.0007815839,0.0002372765,0.0001438483,0.001115083,0.2129046,0.01017975,0.6349553,0.02066733,0.1150405],"study_design_scores_gemma":[0.0001631054,0.0001923078,0.0002317723,0.0000983214,0.000132493,0.0001188993,0.0001241829,0.5852174,0.003439059,0.4065653,0.003639518,0.00007761524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02191015,0.00170914,0.9555437,0.003305585,0.0004511518,0.0003750565,0.0004579779,0.001434378,0.01481281],"genre_scores_gemma":[0.3465168,0.002139889,0.611724,0.002784227,0.001153319,0.002042559,0.00141299,0.00164733,0.03057891],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02050533,"threshold_uncertainty_score":0.09596592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02308233954582812,"score_gpt":0.2727705525386923,"score_spread":0.2496882129928642,"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."}}