{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001961697,0.0002621241,0.0003431652,0.00009590396,0.0002479857,0.00002297889,0.000302017,0.0003454965,0.000003625848],"category_scores_gemma":[0.00006460033,0.0002682913,0.0002246495,0.0001458217,0.0001644557,6.12256e-7,0.0001985321,0.000121058,0.000002752554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002011375,"about_ca_system_score_gemma":0.00006282303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003013747,"about_ca_topic_score_gemma":0.0000229276,"domain_scores_codex":[0.9984948,0.00008311067,0.0003342884,0.0005470833,0.00004393387,0.0004968042],"domain_scores_gemma":[0.999223,0.00006309067,0.0001041254,0.0004252026,0.0001113455,0.00007322809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007672521,0.00007980689,0.03276018,0.00002480252,0.001080162,0.00000332999,0.00001578987,0.001041275,0.8907186,0.004063753,0.00105846,0.06907711],"study_design_scores_gemma":[0.005567741,0.002312491,0.05760223,0.00005621793,0.0008604285,0.00003360676,0.0001614838,0.002965059,0.4384622,0.0488451,0.4413112,0.001822302],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4828696,0.006436759,0.5075736,0.0004567372,0.00075727,0.0006948644,0.000163965,0.00001474267,0.001032456],"genre_scores_gemma":[0.9913281,0.0002876027,0.006495638,0.0006793395,0.0003234111,0.0001946511,0.0004074322,0.00003243485,0.0002513622],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5084586,"threshold_uncertainty_score":0.9999769,"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."}}