{"id":"W4414725606","doi":"10.1186/s13015-025-00283-9","title":"Finding maximum common contractions between phylogenetic networks","year":2025,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Phylogenetic tree; Generalization; Contraction (grammar); Set (abstract data type); Computation; Space (punctuation); Upper and lower bounds","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.002967784,0.0008164646,0.001542251,0.00244876,0.001583641,0.002575445,0.002444607,0.001578548,0.003066888],"category_scores_gemma":[0.02598535,0.0007814122,0.001479342,0.002266863,0.002667933,0.01134553,0.004211708,0.00258958,0.0005188719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001258226,"about_ca_system_score_gemma":0.0009573076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007280275,"about_ca_topic_score_gemma":0.001261089,"domain_scores_codex":[0.9963472,0.001095038,0.000252404,0.001153457,0.0008448275,0.0003070751],"domain_scores_gemma":[0.9765273,0.01713816,0.001728948,0.002420924,0.001241064,0.0009435512],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000740118,0.0002209338,0.01196723,0.001277985,0.0002693853,0.001016157,0.003913788,0.2018659,0.02235927,0.5158471,0.00692976,0.2335923],"study_design_scores_gemma":[0.00003531878,0.0001374407,0.002031761,0.0001142682,0.00006144509,0.0005884859,0.000774221,0.2759478,0.0086948,0.7026647,0.008904841,0.00004493439],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2327546,0.0007679184,0.7591562,0.0008063522,0.0000554653,0.0001584342,0.0008762847,0.0005208562,0.004903771],"genre_scores_gemma":[0.6131591,0.0005956584,0.3794735,0.0002339518,0.00009428594,0.0002521486,0.002779463,0.0003466164,0.003065321],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003066888,"threshold_uncertainty_score":0.01569533,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01606171810145554,"score_gpt":0.307544356855016,"score_spread":0.2914826387535605,"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."}}