MétaCan
Menu
Back to cohort
Record W2322004849 · doi:10.2316/j.2010.210-1025

DISCRETE APPROACHES FOR SOLVING MOLECULAR DISTANCE GEOMETRY PROBLEMS USING NMR DATA

2010· article· en· W2322004849 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternational Journal of Computational Bioscience · 2010
Typearticle
Languageen
FieldPhysics and Astronomy
TopicNMR spectroscopy and applications
Canadian institutionsnot available
FundersCentre National de la Recherche ScientifiqueConselho Nacional de Desenvolvimento Científico e TecnológicoFundação de Amparo à Pesquisa do Estado de São Paulo
KeywordsGeometryComputer scienceMathematics

Abstract

fetched live from OpenAlex

The molecular distance geometry problem (MDGP) is the problem of finding the conformation of a molecule by exploiting known distances between some pairs of its atoms. Estimates of the distances between the atoms can be obtained through experiments of nuclear magnetic resonance (NMR) spectroscopy. The information on the distances, however, is usually limited, because only distances between hydrogens and shorter than 6 are usually available, and this makes the solution of the MDGP quite hard. In this paper, we focus our attention on protein backbones and we present a methodology for computing their full-atom conformations starting from NMR data. This task is performed by solving two MDGPs.

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.000
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.644
Threshold uncertainty score0.340

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.001
Open science0.0010.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.043
GPT teacher head0.370
Teacher spread0.327 · 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