MétaCan
Menu
Back to cohort
Record W2105580430 · doi:10.1080/10635150701245370

Properties of Supertree Methods in the Consensus Setting

2007· article· en· W2105580430 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueSystematic Biology · 2007
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenomics and Phylogenetic Studies
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsSupertreeBiologyEvolutionary biologyComputational biologyPhylogenetic treeGenetics

Abstract

fetched live from OpenAlex

“Supertrees are in essence not more than generalised consensus trees. Perhaps it would be judicious to reach a satisfactory consensus on the use of consensus trees before tackling their generalisation.” (Bryant 2003:164). Supertree methods (SMs) are techniques for inferring (super)trees from sets of (input) trees. Classical consensus methods are SMs that were designed for the special case where input trees have identical leaf sets. The need for methods that can also combine information from input trees with nonidentical leaf sets has led to many alternative SMs. Some of these SMs are generalizations from conservative consensus methods (strict and semistrict) that do not resolve input tree conflicts (e.g., Gordon, 1986; Goloboff and Pol, 2002). Our focus here is on more liberal SMs, those capable of resolving conflicts among input trees. Liberal SMs comprise the majority of described methods and have been the most used in practice by biologists seeking well-resolved phylogenies. However, today's practitioners are confronted with choosing among a potentially bewildering array of liberal SM(s).

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.019
Threshold uncertainty score0.228

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.036
GPT teacher head0.322
Teacher spread0.286 · 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