MétaCan
Menu
Back to cohort
Record W2006569277 · doi:10.1021/ci034125+

Design of Diverse and Focused Combinatorial Libraries Using an Alternating Algorithm

2003· article· en· W2006569277 on OpenAlexaff
S. Stanley Young, Marcia Wang, Fei Gu

Bibliographic record

VenueJournal of Chemical Information and Computer Sciences · 2003
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicChemical Synthesis and Analysis
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsDiversity (politics)ReagentComputer scienceComputationChemical spaceSpace (punctuation)AlgorithmCombinatorial chemistryChemistryOrganic chemistryDrug discoverySociology

Abstract

fetched live from OpenAlex

There is considerable research in chemistry to develop reaction conditions so that any of a very large number of reactants will successfully form new compounds, e.g. for two components, A(i) + B(j) --> A-B(ij). The numbers of A's and B's usually make it impossible to make all the possible products; with multicomponent reactions, there could easily be millions to billions of possible products. There is a need to identify subsets of reagents so that the resulting products have desirable predicted properties. Our idea is to select reactants sequentially and iteratively to optimize the evolving candidate library. The new Alternating Algorithm, AA, can be used for diversity, a space-filling design, or for a focused design, using either a near neighborhood or structure-activity relationship, SAR. A diversity design seeks to select compounds different from one another; a focused design seeks to find compounds similar to an active compound or compounds that follow a structure activity relationship. The benefit of the method is rapid computation of diversity or focused combinatorial chemical libraries.

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.002
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.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.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.023
GPT teacher head0.245
Teacher spread0.222 · 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

Citations13
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Chemical Information and Computer SciencesSame topicChemical Synthesis and AnalysisFrench-language works237,207