MétaCan
Menu
Back to cohort
Record W2148315211 · doi:10.1093/bioinformatics/btl662

Computing exact<i>P</i>-values for DNA motifs

2007· article· en· W2148315211 on OpenAlexaff
Jing Zhang, Bo Jiang, Ming Li, John Tromp, Xuegong Zhang, Michael Q. Zhang

Bibliographic record

VenueBioinformatics · 2007
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenomics and Chromatin Dynamics
Canadian institutionsUniversity of Waterloo
FundersNational Human Genome Research Institute
KeywordsHeuristicComputationComputer scienceDynamic programmingRanking (information retrieval)Value (mathematics)AlgorithmSoftwareExact solutions in general relativityPosition (finance)Theoretical computer scienceMathematicsArtificial intelligenceMachine learning

Abstract

fetched live from OpenAlex

MOTIVATION: Many heuristic algorithms have been designed to approximate P-values of DNA motifs described by position weight matrices, for evaluating their statistical significance. They often significantly deviate from the true P-value by orders of magnitude. Exact P-value computation is needed for ranking the motifs. Furthermore, surprisingly, the complexity of the problem is unknown. RESULTS: We show the problem to be NP-hard, and present MotifRank, software based on dynamic programming, to calculate exact P-values of motifs. We define the exact P-value on a general and more precise model. Asymptotically, MotifRank is faster than the best exact P-value computing algorithm, and is in fact practical. Our experiments clearly demonstrate that MotifRank significantly improves the accuracy of existing approximation algorithms. AVAILABILITY: MotifRank is available from http://bio.dlg.cn. 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.005
metaresearch head score (Gemma)0.055
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.055
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0020.003
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0060.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.009
GPT teacher head0.244
Teacher spread0.236 · 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

Citations50
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueBioinformaticsSame topicGenomics and Chromatin DynamicsFrench-language works237,207