Topological incongruence between Median-Joining Networks and Bayesian inference phylogenies
Bibliographic record
Abstract
1 Abstract Inferring phylogenies among intraspecific individuals often yields unresolved relationships (i.e., polytomies). Consequently, methods that compute distance-based abstract networks, like Median-Joining Networks (MJNs), are thought to be more appropriate tools for reconstructing such relationships than traditional trees. MJNs visualize all routes of relationships in the form of cycles, if needed, when traditional approaches cannot resolve them. However, the MJN method is a distance-based phenetic approach that does not involve character transformations and makes no reference to ancestor–descendant relationships. Although philosophical and theoretical arguments challenging the implication that MJNs reflect phylogenetic signal in the traditional sense have been presented elsewhere, an empirical comparison with a character-based approach is needed given the increasing popularity of MJN analysis in evolutionary biology. Here, we use the conservative Approximately Unbiased (AU) test to compare 85 cases of branching patterns of cycle-free MJNs and Bayesian Inference (BI) phylogenies using datasets from 55 empirical studies. By rooting the MJN analyses to provide directionality, analyses find substantial disagreement between computed MJNs and posterior distributions on BI phylogenies. The branching patterns in MJNs and BI phylogenies show significantly different relationships in 37.6% of cases. Among the relationships that were not significantly different, 96.2% show different sets of relationships. Our results indicate that the two methods provide different measures of relatedness in a phylogenetic sense. Finally, our analyses also support previous observations of the statistical hypothesis testing by reconfirming the over-conservativeness of the Shimodaira–Hasegawa test versus the AU test.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.026 | 0.136 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.007 | 0.004 |
| Science and technology studies | 0.002 | 0.004 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".