{"id":"W2016167735","doi":"10.1089/cmb.2011.0108","title":"A 2-Approximation for the Minimum Duplication Speciation Problem","year":2011,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Genetic algorithm; Gene duplication; Inference; Set (abstract data type); Generalization; Mathematics; Approximation algorithm; Combinatorics; Computer science; Mathematical optimization; Artificial intelligence; Biology; Gene; Evolutionary biology; Genetics","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.002324484,0.002304059,0.002819655,0.002034719,0.001357106,0.00288808,0.004154685,0.003668613,0.01034618],"category_scores_gemma":[0.01108526,0.001161784,0.002576233,0.003496961,0.001017764,0.00659783,0.002300691,0.003839041,0.001922971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002444061,"about_ca_system_score_gemma":0.00306352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003587332,"about_ca_topic_score_gemma":0.004862627,"domain_scores_codex":[0.9978498,0.0005680893,0.0001197796,0.0006952471,0.0004022681,0.0003647693],"domain_scores_gemma":[0.9947678,0.003600174,0.0003611714,0.0006556663,0.0003119101,0.0003032581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001988886,0.001067208,0.004424879,0.001555103,0.0004546522,0.0005136377,0.0006658922,0.6337942,0.007412733,0.04047244,0.04804944,0.259601],"study_design_scores_gemma":[0.0004137433,0.0001633889,0.000875207,0.00006040986,0.00009287441,0.0004262826,0.0001900228,0.8900695,0.001578869,0.1007545,0.005338794,0.00003640123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1230552,0.002827927,0.849624,0.004410881,0.0004024179,0.0006136398,0.004377631,0.004687247,0.01000107],"genre_scores_gemma":[0.2442414,0.0008432317,0.7432782,0.0007908412,0.0002599124,0.0005183044,0.006453571,0.0006748093,0.002939625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01034618,"threshold_uncertainty_score":0.0346114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0262975366789249,"score_gpt":0.2610809532231481,"score_spread":0.2347834165442232,"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."}}