<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>computational pharmacology &#8211; Science</title>
	<atom:link href="https://scienmag.com/tag/computational-pharmacology/feed/" rel="self" type="application/rss+xml" />
	<link>https://scienmag.com</link>
	<description></description>
	<lastBuildDate>Sat, 03 Oct 2026 16:13:29 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1.3</generator>

<image>
	<url>https://scienmag.com/wp-content/uploads/2024/07/cropped-scienmag_ico-32x32.jpg</url>
	<title>computational pharmacology &#8211; Science</title>
	<link>https://scienmag.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">73899611</site>	<item>
		<title>AI Learns to Pick Its Own Lessons: Complexity-Aware Active Learning Boosts Drug–Target Prediction</title>
		<link>https://scienmag.com/ai-learns-to-pick-its-own-lessons-complexity-aware-active-learning-boosts-drug-target-prediction/</link>
		
		<dc:creator><![CDATA[Louis Brooks]]></dc:creator>
		<pubDate>Sat, 03 Oct 2026 16:13:29 +0000</pubDate>
				<category><![CDATA[Biology]]></category>
		<category><![CDATA[active learning]]></category>
		<category><![CDATA[active learning in pharmacology]]></category>
		<category><![CDATA[BIOSNAP]]></category>
		<category><![CDATA[BMC Bioinformatics]]></category>
		<category><![CDATA[complexity-aware machine learning]]></category>
		<category><![CDATA[computational pharmacology]]></category>
		<category><![CDATA[cost-effective experimental design]]></category>
		<category><![CDATA[data scarcity in pharmacology]]></category>
		<category><![CDATA[DAVIS dataset]]></category>
		<category><![CDATA[drug discovery]]></category>
		<category><![CDATA[drug discovery optimization]]></category>
		<category><![CDATA[drug-target interaction]]></category>
		<category><![CDATA[drug-target interaction prediction]]></category>
		<category><![CDATA[intelligent sample selection for drug screening]]></category>
		<category><![CDATA[label efficiency]]></category>
		<category><![CDATA[laboratory resource-efficient experiments]]></category>
		<category><![CDATA[local complexity]]></category>
		<category><![CDATA[Machine learning]]></category>
		<category><![CDATA[machine learning for drug–target binding]]></category>
		<category><![CDATA[molecular recognition modeling]]></category>
		<category><![CDATA[predictive modeling in drug development]]></category>
		<category><![CDATA[TCM-Complexity]]></category>
		<category><![CDATA[TCM-Complexity framework]]></category>
		<category><![CDATA[TCMSP]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=230790</guid>

					<description><![CDATA[Researchers have developed TCM-Complexity, an active learning framework that uses the local structural complexity of drug–target embedding spaces to select the most informative samples, achieving over 90 percent of fully supervised performance with only a 20 percent labeling budget.]]></description>
										<content:encoded><![CDATA[<p>Finding out which drug molecules will actually bind to which protein targets is one of the most fundamental questions in pharmacology, and it is also one of the most expensive to answer. Every reliable drug–target interaction (DTI) annotation typically has to be confirmed in a wet laboratory, where reagents, equipment and researcher time are all in short supply. Machine learning models can, in principle, learn the rules of molecular recognition from existing data and point experimenters toward the most promising candidate interactions, but they face a stubborn bottleneck: labeled examples are scarce, and deciding which unlabeled examples are worth the cost of an experiment is itself a hard scientific problem. A new study published in BMC Bioinformatics by Pinzheng Liu, Xin Cheng, Shaobo Chen, Delong Yuan, Yi Zhang, Wangping Xiong and Zhaoxing Xu addresses exactly this bottleneck with a framework called TCM-Complexity, which aims to squeeze more predictive power out of every precious labeled sample.</p>
<p>The core idea behind the new work is active learning, a branch of machine learning in which the algorithm does not passively consume a fixed training set but instead actively chooses which data points to have labeled next. In the DTI setting, this means the model looks at a large pool of candidate drug–target pairs whose interaction status is unknown and selects a small subset for experimental annotation, hoping that those chosen examples will be maximally informative. Classic active learning strategies usually rank candidates by the model&#8217;s own uncertainty: pairs where the classifier is least confident are assumed to carry the most information. Other approaches consider how samples are distributed in the representation space, preferring candidates that cover poorly explored regions. Both families of methods, however, treat the learned embedding space largely as a black box, and the authors argue that they leave valuable information on the table.</p>
<p>That missing information, according to the study, is the local structural complexity of the data itself. When drugs and proteins are encoded into a joint embedding space—for example, using molecular representations derived from strings such as SMILES, the Simplified Molecular Input Line Entry System, together with protein features—the resulting cloud of points has geometry. Some candidate samples sit in dense, well-behaved neighborhoods where nearby points behave similarly, while others occupy tangled, heterogeneous regions where the local structure is intricate and the relationship between neighbors is less predictable. TCM-Complexity measures this local complexity, using nearest-neighbor information in the joint drug–target embedding space, and feeds it into the sample selection process as a new criterion alongside the usual model prediction signals such as uncertainty.</p>
<p>Combining these two kinds of evidence—what the model thinks and what the data structure looks like—is where the framework earns the word hybrid in its name. The authors build on an earlier two-stage strategy known as TCM, short for Two-stage Coverage and Mining, which alternates between exploring the candidate pool broadly and mining it deeply for the most valuable samples. TCM-Complexity extends this into a two-stage exploration–mining strategy that is stage-adaptive: early in the learning process, when the model is still poorly trained and its uncertainty estimates are unreliable, structural information can guide exploration more robustly; later, as the model matures, prediction-based signals become more trustworthy and the balance shifts. By dynamically adjusting how much weight each signal receives across learning stages, the framework avoids the common failure mode in which an immature model&#8217;s confidence misleads the selection process.</p>
<p>To find out whether this complexity-aware selection actually pays off, the team evaluated the framework on three widely used public DTI datasets: DAVIS, the Drug–Target Affinity dataset; BioSNAP, the Biomedical Network Dataset from the Stanford Network Analysis Project; and TCMSP, the Traditional Chinese Medicine Systems Pharmacology Database and Analysis Platform. The inclusion of TCMSP is notable because it reflects the study&#8217;s roots in computational pharmacology research at Jiangxi University of Chinese Medicine, where traditional medicine databases provide a rich but sparsely annotated source of candidate interactions. The primary experiments used random splits of the data, with a labeling budget set at 20 percent of the training pool—a deliberately constrained scenario designed to mimic the real-world situation in which only a fraction of candidate interactions can ever be experimentally verified.</p>
<p>The results showed that TCM-Complexity achieved the best overall performance across most evaluated metrics in those primary random-split experiments. The strongest baseline was the original TCM method, and against it the new framework delivered maximum observed improvements of 1.87 percent in ROC_AUC, the area under the receiver operating characteristic curve, and 1.79 percent in PR_AUC, the area under the precision–recall curve. These two metrics capture complementary aspects of classification quality: ROC_AUC reflects the trade-off between true-positive and false-positive rates across thresholds, while PR_AUC is particularly informative when positive interactions are rare, as they typically are in DTI data. Gains on both curves suggest that the improvement is not an artifact of a single operating point but a genuine sharpening of the model&#8217;s ability to separate true interactions from non-interactions.</p>
<p>Perhaps the most practically significant finding concerns label efficiency. The authors report that TCM-Complexity reached more than 90 percent of the predictive performance of fully supervised models—models trained on the complete labeled dataset—across the evaluated settings, with the maximum relative performance approaching 98 percent. In other words, by choosing its own training examples intelligently, the framework recovered almost all of the accuracy that would normally require a full annotation budget. The study expresses this through relative measures such as accuracy ratio, F1-score ratio, ROC_AUC ratio and PR_AUC ratio, each comparing the active learning model against its fully supervised counterpart. For research groups weighing whether they can afford the experiments needed to train a competitive DTI model, a framework that delivers near-full performance at a fraction of the annotation cost could change the calculus entirely.</p>
<p>The authors were careful to probe the robustness of their results rather than rely on a single favorable split. Beyond the primary random-split experiments, they ran cold-drug and cold-target analyses, in which the model is tested on drugs or targets entirely absent from training—a much harsher test of generalization that simulates the common real-world scenario of predicting interactions for a newly synthesized compound or a newly characterized protein. They also performed multi-seed analyses to check that reported gains were not the product of a lucky random initialization. The verdict from these stress tests was more nuanced: the magnitude of the performance advantage over baselines was dataset- and metric-dependent, meaning that the framework&#8217;s edge, while real, does not translate uniformly to every benchmark and every evaluation measure. This kind of honest reporting is increasingly valued in machine learning for drug discovery, where inflated benchmark claims have historically been a persistent problem.</p>
<p>Technically, the framework sits at the intersection of several established tools. The underlying predictive architecture involves encoders that map drugs and proteins into a shared space, with a classification token serving as the aggregate representation used for the final interaction decision, and classifier components built from multilayer perceptrons. The complexity measure itself relies on K-nearest-neighbor computations within that joint embedding space, quantifying how structurally intricate each candidate&#8217;s neighborhood is. The authors also frame their contribution using the concept of a label efficiency ratio, a way of quantifying how much annotation effort a method saves relative to full supervision. None of these components is exotic in isolation; the novelty lies in their integration, specifically in treating local structural complexity as a first-class selection criterion that complements, rather than replaces, model-centric signals.</p>
<p>The implications reach beyond the three datasets studied. Computer-aided drug discovery increasingly depends on models that can generalize from limited, expensive data, and active learning is one of the few principled ways to allocate that data budget. By demonstrating that the geometry of the embedding space—its local complexity—carries actionable information about which samples are worth labeling, the study opens a line of inquiry that could extend to other biomedical prediction tasks facing similar annotation bottlenecks, from phenotypic drug screening to protein complex prediction. The work, funded in part by the National Natural Science Foundation of China and the Key Research and Development Program of Jiangxi Province, is published open access, with the accepted manuscript carrying the DOI 10.1186/s12859-026-06684-w. For a field where every experiment counts, a framework that helps algorithms choose their own lessons wisely may prove to be one of the more quietly consequential ideas in computational pharmacology this year.</p>
<p><strong>Subject of Research:</strong> Complexity-aware active learning for drug–target interaction prediction</p>
<p><strong>Article Title:</strong> TCM-Complexity: a complexity-aware hybrid active learning framework for drug–target interaction prediction</p>
<p><strong>Article References:</strong> Liu, P., Cheng, X., Chen, S., Yuan, D., Zhang, Y., Xiong, W., &amp; Xu, Z. (2026). TCM-Complexity: a complexity-aware hybrid active learning framework for drug–target interaction prediction. <em>BMC Bioinformatics</em>. <a href="https://doi.org/10.1186/s12859-026-06684-w" rel="noopener noreferrer">https://doi.org/10.1186/s12859-026-06684-w</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1186/s12859-026-06684-w" rel="noopener noreferrer">10.1186/s12859-026-06684-w</a></p>
<p><strong>Keywords:</strong> drug–target interaction, active learning, machine learning, drug discovery, local complexity, TCM-Complexity, DAVIS dataset, BioSNAP, TCMSP, label efficiency, BMC Bioinformatics, computational pharmacology</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">230790</post-id>	</item>
		<item>
		<title>Hybrid AI Model Blends Transformer and BiLSTM to Predict Cancer Drug Synergy</title>
		<link>https://scienmag.com/hybrid-ai-model-blends-transformer-and-bilstm-to-predict-cancer-drug-synergy/</link>
		
		<dc:creator><![CDATA[Nathaniel Bowman]]></dc:creator>
		<pubDate>Sun, 20 Sep 2026 19:15:14 +0000</pubDate>
				<category><![CDATA[Technology and Engineering]]></category>
		<category><![CDATA[AI in Oncology]]></category>
		<category><![CDATA[benchmark dataset classification accuracy]]></category>
		<category><![CDATA[BiLSTM]]></category>
		<category><![CDATA[BT-Synergy]]></category>
		<category><![CDATA[cancer cell lines]]></category>
		<category><![CDATA[Cancer drug synergy prediction]]></category>
		<category><![CDATA[combination cancer therapy]]></category>
		<category><![CDATA[combination therapy]]></category>
		<category><![CDATA[computational drug discovery]]></category>
		<category><![CDATA[computational pharmacology]]></category>
		<category><![CDATA[deep learning]]></category>
		<category><![CDATA[drug interaction modeling]]></category>
		<category><![CDATA[drug pair screening automation]]></category>
		<category><![CDATA[drug synergy prediction]]></category>
		<category><![CDATA[DrugCombDB]]></category>
		<category><![CDATA[hybrid deep learning models]]></category>
		<category><![CDATA[in vitro synergy assay limitations]]></category>
		<category><![CDATA[molecular and cell-line data encoding]]></category>
		<category><![CDATA[protein embeddings]]></category>
		<category><![CDATA[ProteinBERT]]></category>
		<category><![CDATA[representational learning in pharmacology]]></category>
		<category><![CDATA[SELFIES]]></category>
		<category><![CDATA[Transformer]]></category>
		<category><![CDATA[transformer and BiLSTM integration]]></category>
		<guid isPermaLink="false">https://scienmag.com/?p=201632</guid>

					<description><![CDATA[Researchers at the University of Qom have developed BT-Synergy, a hybrid BiLSTM-Transformer deep learning model that predicts synergistic cancer drug combinations with 0.8458 accuracy by integrating SELFIES molecular encodings with protein language model cell-line representations.]]></description>
										<content:encoded><![CDATA[<p>One of the most stubborn bottlenecks in modern oncology is not finding new drugs, but finding the right pairs of existing drugs that work better together than either does alone. Combination therapy can amplify treatment efficacy, slow the emergence of resistance, and reduce systemic toxicity, yet the number of possible drug pairings across thousands of compounds and hundreds of cancer cell lines grows so quickly that laboratory screening cannot keep pace. In vitro synergy assays remain slow, expensive, and labor-intensive, leaving most of the chemical space of possible combinations unexplored. A new study published in Discover Artificial Intelligence by Sahar Abbasi Rostami and Amir Lakizadeh of the University of Qom in Iran addresses this gap with a hybrid deep learning architecture called BT-Synergy, which the researchers report achieved an accuracy of 0.8458 on benchmark datasets for classifying synergistic drug combinations.</p>
<p>The central problem that BT-Synergy tackles is representational. Earlier computational approaches to synergy prediction, including AuDNNsynergy, SynPathy, and the widely used DeepSynergy model, relied on engineered molecular descriptors or structured multi-omics inputs. More recent frameworks such as SynergyX, DFFNDDS, SYNPRED, PRODeepSyn, DeepTraSynergy, and CFSSynergy jointly encode drug structures and cell-line characteristics using attention mechanisms, feature fusion modules, or protein-protein interaction networks. Yet many of these methods depend on SMILES string encodings or protein similarity matrices, which can miss higher-order chemical and biological dependencies. The Qom team argues that what is needed is an encoder that simultaneously understands the sequential grammar of a molecule and the long-range contextual relationships distributed across it, joined with a biologically grounded picture of the cell in which the interaction takes place.</p>
<p>To build that encoder, the researchers turned to SELFIES, a self-referencing molecular string representation that guarantees chemically valid outputs, unlike SMILES, which can produce structurally impossible sequences that corrupt downstream learning. Each drug is tokenized into SELFIES subunits, truncated or padded to a fixed length, and then processed by a hybrid module in which a bidirectional long short-term memory network is integrated directly into a Transformer block. In the final configuration, the BiLSTM actually replaces the conventional feed-forward sublayer inside the Transformer encoder. This design choice is deliberate: the Transformer&#8217;s multi-head self-attention excels at capturing long-range, non-local dependencies across a molecular sequence, while the BiLSTM contributes sequential inductive biases, reading the token stream in both forward and backward directions to preserve local structural patterns that attention alone can dilute.</p>
<p>The architecture was not chosen blindly. The team systematically compared variants, including a GRU-Transformer hybrid, a parallel configuration in which BiLSTM and Transformer pathways process the sequence simultaneously before element-wise fusion and layer normalization, and pure BiLSTM or pure Transformer baselines. Model depth also mattered: reducing the Transformer to two layers slightly degraded accuracy, while four or five layers inflated computational cost without commensurate gains. Three layers emerged as the optimal balance and were adopted in the final model. Ablation experiments confirmed that the hybrid design outperformed each single-architecture variant under identical conditions, supporting the premise that global contextual modeling and sequential dependency learning are complementary rather than redundant.</p>
<p>Equally important is how BT-Synergy represents the cellular context. Rather than relying on manually curated similarity networks, the model constructs cell-line embeddings from pre-trained protein language models. For each drug-cell-line instance, the researchers compile the union of proteins that are either annotated drug targets or observed as expressed in the relevant cancer cell line, drawing on drug-protein interaction and cell-line protein expression matrices inherited from the DeepTraSynergy dataset. This union typically spans between 54 and 1,479 proteins per sample, averaging roughly 354. Each protein&#8217;s canonical amino acid sequence is retrieved from UniProt and encoded with ProteinBERT from the TAPE suite, which produces dense vectors capturing local residue motifs and longer-range sequence dependencies. A learnable attention-based pooling layer then weights each protein embedding by its relevance, aggregating them into a single fixed-size cell representation that can be trained end-to-end with the rest of the network.</p>
<p>Fusion of the chemical and biological streams happens through a dual-fusion module designed to capture higher-order cross-modal interactions. The two drug embeddings are concatenated, then combined with the cell-line embedding via element-wise multiplication, addition, and subtraction. Multiplication emphasizes synergistic effects, addition captures complementary relationships, and subtraction highlights contrastive signals between molecular and cellular modalities. This interaction-aware scheme replaces naive concatenation, which a baseline variant confirmed is less effective. Because drug combinations are biologically symmetric, the team also applied order-invariance augmentation, generating mirrored training samples in which the two drugs are swapped. The augmentation paid off: across five cross-validation folds, predictions for original and reversed pairs showed a correlation of 0.9721 with a mean absolute difference of just 0.0511, indicating the model treats drug order symmetrically as biology demands.</p>
<p>Training and evaluation relied on two heterogeneous benchmarks. DrugCombDB contributed 69,436 drug-pair-cell-line observations spanning 764 compounds and 76 cancer cell lines, scored with the Zero Interaction Potency metric, whose values cluster tightly around zero. OncologyScreen, by contrast, contains 4,176 observations across 29 compounds and 21 cell lines, scored with the Loewe additivity model, which spans a far wider numerical range. To harmonize these divergent scales and combat class imbalance, the researchers adopted a quantile-based discretization: pairs in the upper quartile of each dataset&#8217;s score distribution were labeled synergistic, those in the lower quartile non-synergistic, and the ambiguous middle half was excluded. A sensitivity analysis comparing 50/50, 33/67, and 25/75 thresholds showed that including low-confidence pairs introduces substantial label noise. The strictest 25/75 configuration delivered the best trade-off, with accuracy of 0.8458, AUC-ROC of 0.9229, and F1 of 0.8422 on DrugCombDB.</p>
<p>The model also held up under punishing robustness protocols. In leave-one-drug-out evaluation, where all combinations involving held-out drugs are removed from training, BT-Synergy achieved an AUC-ROC of 0.8349; in leave-one-cell-line-out testing it reached 0.8357, suggesting genuine resilience to unseen drugs and biological contexts. When trained exclusively on DrugCombDB and tested on the entirely non-overlapping OncologyScreen dataset, the model retained encouraging predictive performance, providing preliminary evidence of cross-dataset transfer, though the authors caution that differing synergy-scoring systems limit strong generalizability claims. Interpretability analyses reinforced the picture: attention heatmaps revealed both globally distributed attention, integrating distant structural components, and sharply localized focus on chemically salient SELFIES symbols such as branching indicators, double-bond notations, and heteroatom tokens. In a token ablation experiment, masking the highest-attention fragments dropped one predicted synergy probability from 0.476 to 0.175, a striking decrease that suggests the model&#8217;s decisions hinge on specific molecular motifs, although the researchers stress that attention weights are proxy indicators rather than proven mechanisms.</p>
<p>Per-drug subgroup analysis added a biologically coherent note. Among the 29 OncologyScreen compounds, the model performed best on drugs with well-characterized mechanisms of action: 5-fluorouracil, an antimetabolite targeting thymidylate synthase, achieved a per-drug AUC-ROC of 0.9354, methotrexate, which inhibits dihydrofolate reductase, scored 0.9055, and doxorubicin, a DNA-targeting agent, reached 0.8850. Compounds with broad, pleiotropic, or poorly defined pharmacology fared noticeably worse. Across all 21 cancer cell lines, performance remained stable, with AUC-ROC values generally between 0.72 and 0.85, indicating the protein-informed cell representations prevent over-specialization to particular cellular backgrounds. Compared against DeepSynergy, GraphSynergy, NEXGB, DeepTraSynergy, and CFSSynergy, BT-Synergy delivered competitive performance on both benchmarks, an outcome the authors attribute to the combination of chemically valid SELFIES encoding, the BiLSTM-Transformer hybrid, and biologically informed protein embeddings.</p>
<p>The limitations are candidly acknowledged. Quantile-based binarization excludes half of the experimental spectrum, so reported performance reflects clearly defined observations rather than the full continuous distribution of synergy. Differences between ZIP and Loewe scoring constrain interpretations of transfer learning, and data sparsity plus the multi-target nature of complex biology mean performance will vary across contexts. The authors call for future validation using harmonized synergy measurements, continuous-label prediction, and additional independent pharmacological benchmarks, alongside extensions to multi-drug combinations and richer omics modalities. Even with those caveats, BT-Synergy demonstrates that fusing sequence-aware molecular encoders with protein language model embeddings can push drug synergy prediction toward the accuracy and robustness that precision oncology demands, and with the source code released on GitHub and both datasets publicly available, the framework is positioned to be tested, extended, and potentially deployed in the search for the next life-extending drug combination.</p>
<p><strong>Subject of Research:</strong> A hybrid deep learning model combining BiLSTM and Transformer architectures with protein embeddings to predict synergistic cancer drug combinations</p>
<p><strong>Article Title:</strong> A hybrid BiLSTM transformer model for drug synergy prediction</p>
<p><strong>Article References:</strong> Rostami, S. A., &amp; Lakizadeh, A. (2026). A hybrid BiLSTM transformer model for drug synergy prediction. <em>Discover Artificial Intelligence, 6</em>(1), Article 1182. <a href="https://doi.org/10.1007/s44163-026-02262-4" rel="noopener noreferrer">https://doi.org/10.1007/s44163-026-02262-4</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1007/s44163-026-02262-4" rel="noopener noreferrer">10.1007/s44163-026-02262-4</a></p>
<p><strong>Keywords:</strong> drug synergy prediction, BT-Synergy, BiLSTM, Transformer, SELFIES, ProteinBERT, combination therapy, cancer cell lines, DrugCombDB, deep learning, computational pharmacology, protein embeddings</p>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">201632</post-id>	</item>
	</channel>
</rss>
