MétaCan
Menu
Back to cohort
Record W2287141830 · doi:10.1093/bioinformatics/btw105

ecceTERA: comprehensive gene tree-species tree reconciliation using parsimony

2016· article· en· W2287141830 on OpenAlexaff
Edwin Jacox, Cédric Chauve, Gergely J. Szöllősi, Yann Ponty, Céline Scornavacca

Bibliographic record

VenueBioinformatics · 2016
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenomics and Phylogenetic Studies
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsTree (set theory)Tree rearrangementPhylogenetic treeBiologyMaximum parsimonyBinary treeGeneComputer scienceComputational biologyPhylogeneticsGenetic algorithmEvolutionary biologyAlgorithmGeneticsMathematicsCombinatoricsClade

Abstract

fetched live from OpenAlex

UNLABELLED: : A gene tree-species tree reconciliation explains the evolution of a gene tree within the species tree given a model of gene-family evolution. We describe ecceTERA, a program that implements a generic parsimony reconciliation algorithm, which accounts for gene duplication, loss and transfer (DTL) as well as speciation, involving sampled and unsampled lineages, within undated, fully dated or partially dated species trees. The ecceTERA reconciliation model and algorithm generalize or improve upon most published DTL parsimony algorithms for binary species trees and binary gene trees. Moreover, ecceTERA can estimate accurate species-tree aware gene trees using amalgamation. AVAILABILITY AND IMPLEMENTATION: ecceTERA is freely available under http://mbb.univ-montp2.fr/MBB/download_sources/16__ecceTERA and can be run online at http://mbb.univ-montp2.fr/MBB/subsection/softExec.php?soft=eccetera CONTACT: celine.scornavacca@umontpellier.fr SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

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.008
metaresearch head score (Gemma)0.022
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Software · Consensus signal: none
Teacher disagreement score0.037
Threshold uncertainty score0.124

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.022
Meta-epidemiology (narrow)0.0030.002
Meta-epidemiology (broad)0.0030.004
Bibliometrics0.0050.004
Science and technology studies0.0030.001
Scholarly communication0.0030.005
Open science0.0060.005
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0370.013

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.040
GPT teacher head0.242
Teacher spread0.203 · 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 designSimulation or modeling
Domainnot available
GenreSoftware

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

Citations115
Published2016
Admission routes1
Has abstractyes

Explore more

Same venueBioinformaticsSame topicGenomics and Phylogenetic StudiesFrench-language works237,207