MétaCan
Menu
Back to cohort

Is ACCTRAN better than DELTRAN?

2008· letter· en· W2165094560 on OpenAlexfundno aff
Ingi Agnarsson, Jeremy A. Miller

Bibliographic record

VenueCladistics · 2008
Typeletter
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenomics and Phylogenetic Studies
Canadian institutionsnot available
FundersJavna Agencija za Raziskovalno Dejavnost RSKillam Trusts
KeywordsCharacter (mathematics)Phylogenetic treeCharacter evolutionFeature (linguistics)Transformation (genetics)Tree (set theory)MathematicsEvolutionary biologyArtificial intelligenceComputer scienceBiologyAlgorithmCombinatoricsGeneticsCladePhilosophy

Abstract

fetched live from OpenAlex

When parsimony ancestral character reconstruction is ambiguous, it is often resolved in favour of the more complex character state. Hence, secondary loss (secondary "absence") of a complex feature is favoured over parallel gains of that feature as this preserves the stronger hypothesis of homology. We believe that such asymmetry in character state complexity is important information for understanding character evolution in general. However, we here point out an inappropriate link that is commonly made between this approach and the accelerated transformation (ACCTRAN) algorithm. In ACCTRAN, changes are assigned along branches of a phylogenetic tree as close to the root as possible. This has been taken to imply that ACCTRAN will minimize hypotheses of parallel origins of complex traits and thus that ACCTRAN is philosophically better justified than the alternatives, such as delayed transformation (DELTRAN), where changes are assigned along branches as close to the tips as possible. We provide simple examples to show that such views are mistaken and that neither ACCTRAN nor DELTRAN consistently minimize parallel gain of complex traits. We therefore do not see theoretical grounds for favouring the popular ACCTRAN algorithm. © The Willi Hennig Society 2008.

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 imitation

Not 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.

metaresearch head score (Codex)0.014
metaresearch head score (Gemma)0.068
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Commentary · Consensus signal: Commentary
Teacher disagreement score0.014
Threshold uncertainty score0.075

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0140.068
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0020.005
Scholarly communication0.0030.006
Open science0.0020.001
Research integrity0.0090.011
Insufficient payload (model declined to judge)0.0090.010

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.

Opus teacher head0.021
GPT teacher head0.236
Teacher spread0.216 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreCommentary

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".

Quick stats

Citations140
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueCladisticsSame topicGenomics and Phylogenetic StudiesFrench-language works237,207