A Review of Target Identification Strategies for Drug Discovery: from Database to Machine-Based Methods
Bibliographic record
Abstract
Abstract In recent years, target identification has become more efficient than before, and it helped to discover huge amounts of drugs for various diseases. The mystery buried behind was the methods that developed in recent years utilized in the target identification. The advances and research status of database, biological assay and machine-based method in recent years for target identification would be integrated by this review. The various databases help scientists to find information about target property, chemical property or on genome level. The biological assay, such as RNAi, RNA sequencing, DNA microarray, and Gal4/UAS system, is commonly used to identify the target in recent years. The machine-based strategies, such as random forest algorithm and Support Vector Machine (SVM) algorithm, could help scientists identify the target and find compound activity more efficiently. Among the three methods mentioned above, the machine-based methods could have higher efficiency and lower cost while maintaining higher accuracy. Despite the promising properties of machine-based methods, the combination use of biological assay would still be necessary. With wider application of more efficient strategies, target identification, as well as drug discovery process, would gain more rapid development.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.005 | 0.006 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".