{"id":"W1988193355","doi":"10.1109/tcbb.2011.137","title":"Algorithms for Reticulate Networks of Multiple Phylogenetic Trees","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Computational Biology and Bioinformatics","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":44,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Hong Kong; McMaster University; Division of Information Systems; Ministère de l'Agriculture, de l'Agroalimentaire et de la Forêt; City University of Hong Kong","keywords":"Reticulate; Reticulate evolution; Phylogenetic tree; Type (biology); Phylogenetic network; Tree (set theory); Combinatorics; Upper and lower bounds; Computer science; Mathematics; Algorithm; Mathematical optimization; Biology; Genetics; Gene; Botany; Paleontology","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001079012,0.0001526138,0.0001753542,0.00006240512,0.0001434498,0.000005378792,0.0001295867,0.0001580527,0.000005084305],"category_scores_gemma":[0.00001865372,0.0001330861,0.00009714773,0.00005929384,0.000211639,0.000001640324,0.00001046239,0.00005801601,0.000001233549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004222814,"about_ca_system_score_gemma":0.00002862639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007764642,"about_ca_topic_score_gemma":0.00001574032,"domain_scores_codex":[0.9992604,0.00002327563,0.0003282045,0.0001703292,0.0000451963,0.0001726207],"domain_scores_gemma":[0.9994261,0.0001043628,0.0001182506,0.0001745239,0.0001265636,0.00005022486],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002273223,0.001225047,0.02164414,0.0003657709,0.002638171,0.000001701137,0.003109257,0.466119,0.1017081,0.001745063,0.0003459282,0.3988246],"study_design_scores_gemma":[0.00731453,0.00871119,0.08832975,0.00008945704,0.0004459766,0.0001010905,0.0008032009,0.7305051,0.1374046,0.02088264,0.003798792,0.001613664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3221105,0.0002946386,0.6767905,0.00003271693,0.000226541,0.0002578841,0.0002041346,0.000004974512,0.00007814897],"genre_scores_gemma":[0.8775348,0.0002810123,0.1218781,0.0001257528,0.000044688,0.00003096916,0.00007403854,0.000009064741,0.00002153749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5554243,"threshold_uncertainty_score":0.5427094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0296981239654243,"score_gpt":0.2590716686947765,"score_spread":0.2293735447293522,"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."}}