MétaCan
Menu
Back to cohort
Record W2085889061 · doi:10.1109/iscas.2010.5537209

Optimized numerical mapping scheme for filter-based exon location in DNA using a quasi-Newton algorithm

2010· article· en· W2085889061 on OpenAlexafffund
Parameswaran Ramachandran, Wu-Sheng Lu, A. Antoniou

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicFractal and DNA sequence analysis
Canadian institutionsUniversity of Victoria
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAlgorithmSet (abstract data type)Function (biology)Filter (signal processing)Computer scienceNewton's methodMathematicsComputer visionPhysics

Abstract

fetched live from OpenAlex

An optimized numerical mapping scheme for achieving improved location of exons in DNA sequences using digital filters is proposed. Characteristic numerical values for the four nucleotides, referred to as pseudo-EIIP values, are obtained using a training procedure where the location accuracy is maximized using a quasi-Newton algorithm based on the Broyden-Fletcher-Goldfarb-Shanno updating formula. A training set of 80 DNA sequences is chosen from the HMR195 database. The objective function for the optimization procedure is formulated using the so-called receiver operating characteristic (ROC) technique and the procedure is initialized using electron-ion interaction potential (EIIP) values. Unbiased testing of the optimized characteristic values is carried out using a set of DNA sequences that has no overlap with the training set. Simulation results show that the pseudo-EIIP values yield more accurate exon locations than those obtained using the actual EIIP values.

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.001
metaresearch head score (Gemma)0.001
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.005
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0020.001

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.020
GPT teacher head0.276
Teacher spread0.256 · 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

Citations7
Published2010
Admission routes2
Has abstractyes

Explore more

Same topicFractal and DNA sequence analysisFrench-language works237,207