MétaCan
Menu
Back to cohort
Record W2049151260 · doi:10.1021/ci030006i

BHB:  A Simple Knowledge-Based Scoring Function to Improve the Efficiency of Database Screening

2003· article· en· W2049151260 on OpenAlexaff
Miklós Fehér, Eugen Deretey, Samir Roy

Bibliographic record

VenueJournal of Chemical Information and Computer Sciences · 2003
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicMachine Learning in Bioinformatics
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsSimple (philosophy)Function (biology)Computer scienceInformation retrievalData mining

Abstract

fetched live from OpenAlex

A new knowledge-based scoring function was developed in this work to facilitate the rapid ranking of ligands in databases. The acronym of the method is BHB based on the descriptors it utilizes: buriedness, hydrogen bonding, and binding energy. Receptor buriedness is a measure of how well molecules occupy the binding pocket in comparison to known high-affinity ligands or, alternatively, whether they have contact with identified residues in the pocket. The possibility of hydrogen bond formation is checked for selected residues that are recognized as being important in the binding of known ligands. The approximate binding energy is calculated from the thermodynamic cycle using the optimized bound and free solvent conformations of the ligand-receptor system. The information necessary for the scoring function can ideally be gleaned from the 3D structure of the receptor-ligand complex. Alternatively, the descriptors can be derived from the 3D structure of the unbound receptor, provided this receptor has a known ligand that binds to the given site with nanomolar activity. We show that the new scoring functions provide up to 12 times improvement in enrichment compared to the popular commercial docking program GOLD.

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.004
metaresearch head score (Gemma)0.008
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.008
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.008
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0030.003
Science and technology studies0.0010.000
Scholarly communication0.0010.002
Open science0.0030.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0080.004

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.011
GPT teacher head0.264
Teacher spread0.253 · 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

Citations33
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Chemical Information and Computer SciencesSame topicMachine Learning in BioinformaticsFrench-language works237,207