MétaCan
Menu
Back to cohort
Record W4255949132 · doi:10.1177/117693430600200005

A New Effective Method for Estimating Missing Values in the Sequence Data Prior to Phylogenetic Analysis

2006· article· en· W4255949132 on OpenAlexaff
Abdoulaye Baniré Diallo, François‐Joseph Lapointe, Vladimir Makarenkov

Bibliographic record

VenueEvolutionary Bioinformatics · 2006
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenomics and Phylogenetic Studies
Canadian institutionsUniversité de MontréalUniversité du Québec à Montréal
Fundersnot available
KeywordsMissing dataPhylogenetic treeInferenceComputer scienceProbabilistic logicRepresentation (politics)Sequence (biology)Data miningArtificial intelligenceBiologyMachine learningGenetics

Abstract

fetched live from OpenAlex

In this article we address the problem of phylogenetic inference from nucleic acid data containing missing bases. We introduce a new effective approach, called “Probabilistic estimation of missing values” (PEMV), allowing one to estimate unknown nucleotides prior to computing the evolutionary distances between them. We show that the new method improves the accuracy of phylogenetic inference compared to the existing methods “Ignoring Missing Sites” (IMS), “Proportional Distribution of Missing and Ambiguous Bases” (PDMAB) included in the PAUP software [ 26 ]. The proposed strategy for estimating missing nucleotides is based on probabilistic formulae developed in the framework of the Jukes-Cantor [ 10 ] and Kimura 2-parameter [ 11 ] models. The relative performances of the new method were assessed through simulations carried out with the SeqGen program [ 20 ], for data generation, and the BioNJ method [ 7 ], for inferring phylogenies. We also compared the new method to the DNAML program [ 5 ] and “Matrix Representation using Parsimony” (MRP) [ 13 , 19 ] considering an example of 66 eutherian mammals originally analyzed in [ 17 ].

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.013
metaresearch head score (Gemma)0.043
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: Methods · Consensus signal: Methods
Teacher disagreement score0.013
Threshold uncertainty score0.067

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0130.043
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0040.004
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0040.003
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0030.002

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.024
GPT teacher head0.317
Teacher spread0.293 · 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
GenreMethods

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

Citations8
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueEvolutionary BioinformaticsSame topicGenomics and Phylogenetic StudiesFrench-language works237,207