Abstract
Despite the high accuracy of ‘black box’ deep learning models, drug discovery still relies on protein–ligand interaction principles and heuristics. To improve interpretability of protein–small molecule binding predictions, we developed the PWRules framework, which applies binding affinity data to identify privileged small molecule fragments and subsequently defines complementary pairing rules between these fragments and protein words (semantic sequence units) through an interpretability module. The resulting word–fragment rules are then used by the PWScore function to prioritize active compounds. Evaluations on benchmark datasets show that PWScore achieves competitive performance comparable to the physics-based model (Glide) and the deep learning model (PSICHIC) and shows broad applicability for protein targets outside the training dataset, e.g., SARS-CoV-2 main protease. Notably, PWScore captures complementary interaction information, yielding superior enrichment performance when integrated with these established methods. Structural analysis of protein–ligand complexes indicates that learned word–fragment rules are significantly enriched near ligand-binding pockets, despite training without explicit structural guidance. By extracting and applying complementary pairing rules, PWRules provides an interpretable framework for drug discovery.
PWRules learns interpretable word–fragment pairing rules from protein–ligand binding data via Integrated Gradients and applies them through PWScore, a rule-based scoring function for accurate, generalizable, and interpretable virtual screening.
Introduction
Drug discovery relies on the physical principles governing protein–ligand interactions, including hydrogen-bond donor–acceptor pairing, hydrophobic enclosure of nonpolar groups, π–π stacking between aromatic rings, and electrostatic complementarity between protein residues and small molecules.1 In practice, however, application of these principles relies heavily on accumulated experimental knowledge and experience-driven heuristics developed by medicinal chemists.2–4 Such heuristic approaches guide the design of high-potential drug candidates by promoting favorable interactions while avoiding steric clashes and electrostatic incompatibilities between target proteins and ligand scaffolds.5 Alternatively, structure-based drug design can provide a framework for applying heuristic knowledge, including pharmacophore modeling6 and fragment-based drug design.7,8 Nevertheless, the accessible chemical space and diversity of therapeutic targets is continually expanding, limiting the inherent scalability of approaches that primarily depend on manual curation and heuristics.9,10
In recent years, the increasing adoption of machine learning and deep learning methods to support various stages of drug discovery has complemented human expertise by automating and accelerating tasks such as virtual screening, binding-site and binding-affinity prediction, and molecular generation.11–17 At the same time, increasing availability of large-scale molecular datasets supports the development of data-driven models that capture complex, nonlinear relationships which exceed the capacity of simple heuristic rules. Sequence-based methods have also gained attention due to their capability to infer protein–ligand interactions using only protein sequences and molecular representations in the absence of experimentally resolved structures.18–21 For example, models such as DeepDTA22 and TransformerCPI23 have demonstrated strong predictive performance in estimating protein–ligand binding affinity using only sequence-level inputs.
Despite this predictive success, interpretability in deep learning models for drug–target interaction (DTI) prediction has drawn increasing attention. Early work relied on attribution-based analyses that flag influential residues or atoms but remain tied to individual predictions rather than generalizing across them. More recent methods have pushed toward finer-grained interpretability. DrugBAN24 employed a bilinear attention network to learn explicit atom–residue pairwise interactions with interpretable attention maps. MGraphDTA25 paired a deep multiscale graph neural network with a gradient-based explanation method that highlights the molecular substructures most responsible for predicted affinity, while GIGN26 incorporated 3D complex structures and physical interactions into a geometric graph neural network, whose learned representations could be visualized to reveal biologically meaningful protein–ligand interactions. Moving closer to chemically intuitive reasoning, fragment-level interpretability has begun to emerge: MolTrans27 decomposed drugs and proteins into frequent substructures and highlighted the substructure pairs driving interactions, while FragXsiteDTI28 fragmented ligands into substructures and used Transformer-driven interpretation to identify the drug fragments and protein pocket segments responsible for binding.
Decades of medicinal chemistry research show that protein–ligand recognition is governed largely by local interactions between specific active-site residues and small-molecule pharmacophores.29–31 These interpretability efforts have begun to open the black boxes,32–35 echoing the view of molecular recognition as local fragment–residue interplay. However, they largely produce instance-specific attention weights or visualizations rather than explicit, generalizable rules. As a result, medicinal chemists cannot readily distill actionable pairing principles from these models to guide the design of new compounds. This lack of explainability presents a growing need for learning frameworks that surpass predictive performance to provide interpretable representations relevant to protein–ligand recognition. That is, models capable of associating molecular fragments with compatible local sequence patterns offer a promising avenue for bridging data-driven learning with chemically intuitive reasoning in drug discovery.
Here, we introduce PWRules (Protein Word-based Rules), a framework that automatically discovers interpretable complementary pairing rules between protein sequences (“words”) and small-molecule fragments. Based on binding affinity data, PWRules uses small molecule fragments exhibiting privileged association with a given protein to guide model training. The predictions are subsequently translated into interpretable binding rules through an Integrated Gradients (IG)-based interpretability module. Building on these word–fragment rules, we further developed PWScore (Protein Word-based Score), a scoring function that prioritizes active compounds. PWRules departs from existing interpretable DTI methods in three key respects: (i) it operates on protein words, semantic sequence units derived through unsupervised segmentation of protein sequences by protein language models, rather than individual residues or entire sequences; (ii) it systematically mines privileged fragments from binding data and automatically generates explicit pairing rules with protein words, producing a reusable rule library rather than instance-specific visualizations; and (iii) its scoring function, PWScore, is built entirely from these interpretable rules, offering mechanistic insight that complements physics-based and deep-learning approaches while delivering competitive virtual screening performance. This scoring system demonstrated performance comparable to other ranking systems in active molecule enrichment on benchmark datasets. Notably, by capturing complementary interaction information, its integration with other established methods yields enhanced enrichment performance. PWScore also exhibits generalizability to targets absent in the training set, such as SARS-CoV-2 main protease (Mpro). Our analyses of protein–ligand complex structure showed that, despite lacking explicit structural guidance, the learned protein word–fragment rules are enriched near ligand-binding sites. Overall, PWRules thus provides an interpretable framework for advancing drug discovery.
Results
An interpretable protein word-based framework for predicting protein–small-molecule complementary pairing rules
To discover the rules governing complementary pairing between proteins and small molecules, we developed the PWRules framework for identifying small molecule fragments associated with specific protein words,36i.e., contiguous or discontinuous segments of 5–20 amino acid residues that represent putative functional units. Using protein–small-molecule binding data from PDBbind,37 BindingDB,38 BindingNet,39 and ChEMBL40 as the supervisory signal, PWRules takes protein word embeddings as input and outputs word–fragment pairing rules, each pairing a single protein word with a small-molecule fragment. For a given target protein, potential ligands were first analyzed using a refined fragment library wherein each protein–ligand complex in the training dataset with an experimentally verified binding affinity <10 µM was defined as a binding interaction, and those fragments present in >50% of binding-positive ligands designated as “privileged”. Using protein-word embeddings as inputs for a supervised transformer-based encoder architecture, PWRules provides multidimensional vectors, with each dimension representing the predicted probability that a given small molecule fragment is privileged for the input protein. This formulation is analogous to a multi-label protein function prediction task, which we previously demonstrated as an effective approach for extracting high-quality rules for protein words.36
Privileged fragments are labeled as 1, while all other fragments are labeled as 0 or NA, thus serving as the supervisory signals for model training. After training and validation, PWRules can automatically extract complementary pairing rules through an IG-based interpretability analysis. To generate rules for each protein, the model selects only positive (i.e., privileged, label = 1) small molecule fragments with predicted labels that agree with the ground truth. The IG analysis then computes attribution scores for each protein word paired with a privileged fragment. Finally, to obtain complementary pairing rules, protein words with high attribution scores are identified as key contributors to binding activity and are subsequently paired with corresponding privileged fragments. Specifically, for a given privileged fragment, we iteratively select the protein words with the highest positive attribution scores until their cumulative contribution exceeds 50% of the total positive attribution. This automated criterion allows the model to distill the most salient, contributing protein words for each privileged fragment to form the final pairing rules (Fig. 1a).
Fig. 1. The PWRules framework. (a) Overview of the PWRules framework. PWRules takes protein–small-molecule binding data as inputs, then outputs word–fragment rules, each consisting of a protein word paired with a small-molecule fragment. An Integrated Gradients method is applied to compute attribution scores between each protein word and individual privileged fragments. Protein words with high attribution scores are designated as key contributors to ligand interactions and combined with corresponding fragments to form rule pairs. (b) Workflow for protein word extraction with protein wordwise. (c) Workflow for extracting small-molecule fragments using the MacFrag algorithm. Finally, a library of drug-like fragments is generated by retaining fragments with a frequency greater than 0.1% and filtering out structurally redundant or undesirable fragments, such as flexible chains with excessive rotatable bonds.

To generate protein words for rule prediction, protein wordwise36 was used to partition all protein sequences in the merged dataset (from PDBbind,37 BindingDB,38 BindingNet,39 and ChEMBL40) into a set of protein words. ESM-2 (ref. 41) was applied to compute embeddings for the constituent residues, the average of which served as the embedding for each word (Fig. 1b). The words were subsequently filtered with a preconstructed dictionary to retain high-frequency words occurring across multiple protein sequences. This use of protein words rather than individual amino acids represents the primary difference in feature extraction between PWRules and other common ESM-2-based models. To test whether dictionary-based filtering might exclude binding-pocket residues, we mapped pocket residues from PDBbind complex structures onto the full sequence and calculated their coverage by the retained protein words: binding-region residues showed 81.3% average coverage, significantly higher than non-binding regions (76.7%; Mann–Whitney U test, p < 0.001, n = 2690) (Fig. S1), indicating that core functional residues within binding pockets are captured by protein words at high rates despite the unsupervised nature of the segmentation.
To obtain small molecule fragments for rule prediction, the MacFrag42 algorithm was employed to decompose small molecules from the merged dataset into known synthetic drug building blocks (Fig. 1c), which were then filtered to eliminate low-frequency fragments or those with overly simple structural motifs. These steps ensure that the retained fragments are statistically robust and structurally informative for target-specific binding prediction. Full decomposition yielded 1 996 165 unique fragments, of which only 4876 (0.24%) survived frequency filtering (>0.1%) and structural refinement. Most excluded fragments appeared just once in the dataset. Physicochemical characterization aimed at assessing the quality of the resulting library of 4876 drug-like fragments (see Methods for details) revealed that 90.3% fully complied with the “Rule of Three”43 (Fig. S2a). Additionally, we evaluated the chemical space covered by our fragment library, with coverage rate defined as the proportion of molecules in a given database that contain at least one fragment from our library. Testing on the FDA-approved drug library, HMDB44 metabolite database, ChEMBL40 ligand set, and a ZINC45 drug-like subset showed coverage rates of 95.2%, 92.9%, 98.3%, and 97.2%, respectively (Fig. S2b). Further analysis of chemical space coverage with tSNE distribution maps confirmed that our fragment library provides comprehensive coverage of drug-like chemical space (Fig. S2c). Beyond global coverage, we further quantified fragment usage at the individual-molecule level: across the four databases, molecules contained an average of 13.5, 14.3, 11.9, and 7.9 library fragments, with mean heavy-atom coverage of 71.2%, 72.9%, 76.5%, and 79.5%, respectively (Fig. S3).
To train and evaluate PWRules, the merged dataset was partitioned into training and validation sets, with three test datasets further constructed to assess predictive performance in scenarios absent from training—using sequence- and structure-level novelty filters, with protein novelty defined by MMseqs2-based sequence identity46 and ligand novelty by ECFP-based47 Tanimoto similarity (see Methods for details): novel protein, comprising unseen proteins paired with training-set ligands; novel ligand, comprising unseen ligands paired with training-set proteins; and novel complex, comprising protein–ligand pairs in which both partners satisfy their respective novelty criteria. After generating protein word–fragment rules with the IG algorithm, we compared these rules with whole protein sequences in both the training and validation sets and computed the accuracy of each rule to assess its reliability and potential applicability to novel proteins. This analysis showed that rules with higher model prediction scores and higher attribution scores were generally more accurate. To provide a metric for rules that reflects both model confidence in the fragment and importance of the protein word for interaction with ligands, we computed rule scores as the geometric mean of the model prediction value and the IG attribution score (Fig. S4). By framing binding prediction as a multi-label privileged fragment prediction task and incorporating an IG-based interpretability module, PWRules thus generates interpretable rules for guiding drug discovery. The final pairing rules library comprises 2 523 287 protein word–fragment rules, encompassing 80 468 unique protein words.
PWRules identifies privileged small-molecule fragments for diverse drug targets
To assess the informative value of rules in protein or ligand prediction for drug discovery, we first examined the accuracy of privileged fragment prediction. An input protein sequence is first parsed into protein words using protein wordwise and then queried against the rule database to identify matching small-molecule fragments. Each small molecule fragment can potentially match multiple protein words (Fig. 2a), and fragments matching larger numbers of protein words tend to yield higher accuracy predictions (Fig. S5a). We therefore estimated the probability that fragments were correctly designated as privileged by aggregating the scores of all matched rules. Comparison of maximum, averaging, and joint probability approaches for scoring privileged fragments indicated that the joint probability formulation achieved the highest discrimination, with an area under the receiver operating characteristic curve (AUROC) of 0.775 on the novel ligand test set, and was therefore selected as the scoring function for predicting privileged fragments (Fig. S5b).
Fig. 2. PWRules performance in predicting privileged small-molecule fragments for diverse targets. (a) Workflow for privileged fragment prediction with PWRules. Protein words are extracted from the input sequence and sequentially scanned to identify all matching rules in the PWRules database. A prediction score of each fragment's likelihood of being privileged is calculated based on the number of matched rules and their corresponding rule scores. (b) Comparison of precision among three baseline models (residue embedding, word embedding, and 5-mer embedding), PWRules (rule-based), and 5-mer rules across the three test datasets (novel protein, novel ligand, novel complex). (c) Comparison of MCC for the same models and datasets. (d) Case study of privileged fragments for BTK_HUMAN. Four representative high-affinity small molecules known to bind BTK_HUMAN are shown with high-scoring privileged fragments predicted by PWRules. Notably, each high-affinity ligand contains at least two of the predicted privileged fragments.

We compared the precision of a prediction approach that directly applies the learned rules against two supervised learning models: a word-embedding-based model (the original supervised model within PWRules) and a residue-embedding-based model (using raw ESM-2 embeddings as input features). The results revealed that the rule-based approach consistently outperformed both deep learning models across all test sets, achieving precisions of 0.809, 0.866, and 0.772 on the novel protein, novel ligand, and novel complex datasets, respectively. In comparison, the word-embedding model achieved 0.671, 0.825, and 0.680, while the residue-embedding model achieved 0.668, 0.802, and 0.689 (Fig. 2b).
To further assess the overall discriminative ability of each method in both positive and negative sample prediction, we calculated the Matthews correlation coefficient (MCC) for samples in each test. The word-embedding model respectively achieved MCC values of 0.213, 0.518, and 0.189 on the three test sets, the residue-embedding model achieved values of 0.191, 0.478 and 0.196, compared to values of 0.171, 0.487, and 0.163 achieved by the rule-based method (Fig. 2c). These results suggest that rule-based prediction favors precision, at the cost of reduced coverage across negative sample space, thus supporting the value of integrating rule-based predictions as a complementary module within other models.
To confirm the necessity of protein wordwise segmentation for rule extraction, we tested a fixed 5-mer segmentation scheme as an alternative. The 5-mer model achieved precision (0.673, 0.805, 0.666) and MCC values (0.224, 0.460, 0.153) comparable to those of the word-embedding model for privileged-fragment prediction (Fig. 2b and c). However, once rules were extracted through the IG-based interpretability module, the 5-mer-derived rules retained comparable precision (0.791, 0.884, 0.760), as expected given the same accuracy-based filtering applied to both rule sets, but showed markedly lower MCC values (0.087, 0.188, 0.089). This gap arises because fixed-length 5-mer segments lack the functional coherence of attention-derived protein words, so the resulting rules generalize poorly to novel proteins given the lower cross-protein recurrence of arbitrary k-mer patterns.
To further probe the robustness of PWRules across varying novelty definitions, we systematically varied the sequence-identity threshold for proteins (0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, and 1.0) and the Tanimoto similarity threshold for ligands (0.5, 0.7, and 0.9), and re-evaluated performance on the corresponding test sets (Fig. S6). Precision on the novel protein set remained relatively stable across the 0.3–0.8 range (0.759 at 0.3 to 0.718 at 0.7, with a slight dip at 0.7 likely attributable to normal statistical fluctuation), before rising to 0.800 at 0.9 and 0.810 at 1.0; MCC followed a similar pattern, ranging from 0.129 at 0.3 to 0.172 at 1.0. Precision on the novel ligand set decreased from 0.856 at Tanimoto 0.9 to 0.663 at 0.5 (MCC: 0.463 to 0.244). On the novel complex test set, the interplay of both protein and ligand thresholds yields a more complex landscape, with the highest precision (0.779) and MCC (0.167) observed at the least stringent threshold combination (1.0, 0.9). Performance is generally lower under more stringent dual-novelty constraints, consistent with the greater challenge of predicting genuinely novel protein–ligand pairs. Although performance declines gradually as novelty criteria become more stringent—particularly for ligand-centric definitions—precision and MCC remain at reasonable levels across all tested conditions, demonstrating that PWRules maintains robust predictive performance under diverse definitions of novelty.
In virtual screening, precision among top-ranked predictions typically matters more than overall recall, since downstream experimental validation is resource-intensive and only a small fraction of candidates can realistically be tested. The high precision of PWRules stems from the rigorous accuracy filtering applied to each extracted rule, which keeps individual word–fragment pairing predictions reliable. The moderate recall mainly reflects that the current rule set does not yet exhaustively cover every possible binding pattern; additional rules can be mined as more training data become available, progressively improving recall. Alternatively, the precision–recall trade-off can be tuned by adjusting the prediction threshold (Fig. S7).
To further validate the use of extracted rules in predicting ligands of a real-world drug target, we conducted a representative case study on the non-receptor tyrosine kinase, BTK_HUMAN, which participates in B-cell development, differentiation, and signal transduction, and serves as an important therapeutic target for multiple diseases.48 For this protein, we examined four known high-affinity ligands, including N-(2-chloro-6-methylphenyl)-2-[[6-[4-(2-hydroxyethyl)piperazin-1-yl]-2-methylpyrimidin-4-yl]amino]-1,3-thiazole-5-carboxamide(Cpd1, Kd = 1 nM), 1-[4-[[[6-amino-5-(4-phenoxyphenyl)pyrimidin-4-yl]amino]methyl]piperidin-1-yl]propan-1-one (Cpd2, Kd = 2 nM), (2R)-2-[(3R)-3-[4-amino-3-(4-phenoxyphenyl)pyrazolo[3,4-d]pyrimidin-1-yl]piperidine-1-carbonyl]-4,4-dimethylpentanenitrile (Cpd3, IC50 = 4.6 nM), and 7-cyclopentyl-5-(4-phenoxyphenyl)pyrrolo[2,3-d]pyrimidin-4-amine (Cpd4, IC50 = 0.7 nM).
Through our rule-matching strategy, we successfully identified several high-confidence privileged fragments for BTK_HUMAN, including frag_16 (rule score = 0.909), frag_17 (rule score = 0.912), frag_450 (rule score = 0.922), frag_1117 (rule score = 0.963), frag_2045 (rule score = 0.987), and frag_4604 (rule score = 0.987). Notably, all four high-affinity ligands contained multiple privileged fragments: frag_1117 and frag_2045 in Cpd1; frag_16 and frag_17 in Cpd2; frag_17 and frag_4604 in Cpd3; and frag_17 and frag_450 in Cpd4. These results showed that protein word–fragment rules could effectively identify key chemical fragments involved in target binding. As these fragments were recurrently present in well-established high affinity ligands, this case study confirmed that extracted binding rules could guide lead compound discovery and optimization.
PWRules encodes interpretable interactions between protein words and small-molecule fragments
Considering the interpretability of rules obtained by PWRules, we hypothesized that protein word–fragment pairs predicted by our model would be in close spatial proximity within the structure of protein–ligand complexes, consistent with structurally meaningful interactions. To test this hypothesis, we examined three-dimensional structures of protein–ligand complexes from the PDBbind database. After extracting protein words from the protein sequences and small molecule fragments from the ligands of each complex structure, we calculated the distance between the centroids of the protein word and the fragment for every word–fragment pair co-occurring within that complex (Fig. 3a). We found that 47.58% of word–fragment pairs in the training set proteins and 51.37% of pairs in test set proteins were located within 15 Å of each other. To assess whether the close spatial proximity of these word-privileged fragment pairs significantly differed from the distribution of random word–fragment pairs, we constructed an equal-sized control set of word–fragment pairs by randomly sampling protein words and molecular fragments. Analysis of word–fragment distance distributions indicated that only 34.49% of random pairs in the training set and 29.95% of the test set were located within 15 Å, both significantly lower than the corresponding proportions of word–privileged fragment pairs predicted by PWRules (Fig. S8). Statistical analysis confirmed this difference: rule pairs were significantly closer than random pairs in both the training (median = 15.4 vs. 18.0 Å) and test sets (median = 14.8 vs. 19.2 Å) (Mann–Whitney U test, p < 0.0001 for each). These results demonstrate that the spatial proximity of rule-based pairs is non-random and structurally meaningful. Although not all predicted pairs were located in close proximity, this substantial proportion of short-distance pairs indicated that many interactions identified through PWRules were indeed structurally plausible and that fragments in these pairs were likely in or otherwise impacted protein regions involved in ligand binding.
Fig. 3. Structural validation of protein word–fragment rules using PDB complexes. (a) Method for validating protein word–fragment rules in PDB structures. PDB was scanned for all occurrences of each pairing rule; distances were then calculated between the centroids of each protein word and paired fragment. (b and c) Two examples illustrating word–fragment rules capturing hydrogen-bonding and electrostatic interactions between protein words and small-molecule fragments. (b) Case study 1: a hydrogen-bonding interaction captured by PWRules (PDB: 6DH0). The high-affinity inhibitor Darunavir binds to HIV-1 protease. PWRules identified a pairing rule between the protein word DTGAD (residues 25–29) and the fragment frag_2565 within the ligand. In the complex structure, their centroid distance is 5.63 Å, consistent with the observed hydrogen bond between the backbone of Gly27 (in DTGAD) and a peptide bond nitrogen in frag_2565. (c) Case study 2: an electrostatic interaction and a hydrogen bond captured by PWRules (PDB: 2CEJ). The inhibitor 1AH binds to HIV-1 protease. PWRules identified a pairing rule between the protein word LDTGADDTV (residues 24–32) and frag_2279 (centroid distance: 7.08 Å), corresponding to a charge interaction between Asp25 and a nitrogen atom in the inhibitor. The rule pairing DTGAD with frag_2565 (same as in b) was also observed, but here it manifests as a distinct hydrogen bond between Asp29 and an oxygen atom in frag_2565.

To pinpoint the source of this proximity, we generated two additional control sets by randomizing one partner of the predicted pairs while fixing the other, and compared the resulting distance distributions with those of true PWRules pairs and the completely random pairs described above using cumulative distribution function (CDF) analysis (Fig. S9a and b). On the test set, only 30.99% of fixed-fragment-random-word pairs lay within 15 Å—comparable to the completely random control and significantly lower than true PWRules pairs (Mann–Whitney U test, p < 0.0001)—whereas the fixed-word-random-fragment control yielded a distribution nearly overlapping that of true pairs (49.03% within 15 Å). This asymmetry is expected: ligand fragments are inherently compact and localized within the binding pocket, so randomizing the fragment has limited effect on spatial distance, whereas randomizing the protein word shifts the distribution toward substantially larger values. Thus, the spatial proximity of PWRules pairs is driven primarily by the identity of the specific protein words rather than by chance.
We additionally compared PWRules with CLAPE-SMB,49 a protein–small molecule binding site prediction method based on pre-trained protein language models with contrastive learning. For each protein, we treated pocket residue prediction as a residue-level binary classification task against the true binding pocket (residues within 10 Å of the bound ligand) and computed the F1 score, defined as the harmonic mean of precision (the fraction of predicted residues overlapping true pocket residues) and recall (the fraction of true pocket residues covered by the prediction). On the PDBbind test set, PWRules-predicted protein words achieved a mean F1 score of 0.315, outperforming CLAPE-SMB-predicted binding residues (mean: 0.277). Notably, PWRules provides additional interpretability by explicitly pairing protein words with specific ligand fragments, whereas CLAPE-SMB predicts binding sites without fragment-level resolution (Fig. S9c).
To investigate the detailed interactions between protein words and small-molecule fragments, we first examined the PDB structure, 6DH0, as a representative case study, which includes the HIV-1 protease in complex with its high binding affinity inhibitor, Darunavir ([(3aS,4R,6aR)-2,3,3a,4,5,6a-hexahydrofuro[2,3-b]furan-4-yl] N-[(2S,3R)-4-[(4-aminophenyl)sulfonyl-(2-methylpropyl)amino]-3-hydroxy-1-phenylbutan-2-yl]carbamate, Ki = 0.026 nM). Structural analysis showed that the backbone of residue G27 forms a hydrogen bond with the nitrogen atom of a peptide bond in the inhibitor (Fig. 3b). Consistent with this observation, our rule database contained a high-scoring pairing rule between the protein word DTGAD (residues 25–29) and the inhibitor fragment frag_2565, which includes this peptide bond (rule score = 0.459). In the complex structure, DTGAD and frag_2565 shared a centroid distance of 5.63 Å, confirming their close spatial proximity and supporting their ability to undergo a direct hydrogen bonding interaction. Given that the DTGAD–frag_2565 rule extracted by PWRules corresponds to a key hydrogen bond in the protein–ligand structure, this case highlights the biological interpretability of our method.
As an additional case study, we examined the PDB structure, 2CEJ, comprising the HIV-1 protease in complex with another high affinity inhibitor, 1AH (methyl N-[(2S)-1-[2-[(2S)-2-benzyl-2-hydroxy-3-[[(1S,2R)-2-hydroxy-2,3-dihydro-1H-inden-1-yl]amino]-3-oxopropyl]-2-[(4-bromophenyl)methyl]hydrazinyl]-3,3-dimethyl-1-oxobutan-2-yl]carbamate, Ki = 2.4 nM). Structural analysis revealed an electrostatic interaction between the sidechain of residue D25 and a nitrogen atom in the inhibitor (Fig. 3c). In our rule database, we found a pairing rule (rule score = 0.583) between the protein word, LDTGADDTV (residues 24–32), and a corresponding inhibitor fragment, frag_2279. In the complex structure, LDTGADDTV shared a centroid distance of 7.08 Å with frag_2279, consistent with the close proximity required for this electrostatic interaction, thus demonstrating that pairing rules could capture charge-based interactions. Notably, in this PDB structure, the rule database also identified the aforementioned DTGAD–frag_2565 pairing, although structural analysis revealed a different interaction mode in this context, wherein residue D29 forms a hydrogen bond with the oxygen atom of the peptide bond in frag_2565. These observations suggested that PWRules could identify word–fragment pairs that undergo distinct atomic-level interactions depending on structural context.
PWScore achieves competitive performance in active molecule enrichment
Building on the ability of PWRules to accurately predict privileged fragments for protein words, we further developed PWScore, a virtual screening method that prioritizes leads based on privileged fragments. PWScore quantifies the degree of matching between candidate small molecules in the screening library and the privileged fragment library predicted by PWRules, with paired candidate small molecules scored and ranked according to their predicted binding propensity to guide target-oriented molecular design (Fig. 4a). The core assumption of PWScore is that small molecules containing a larger number of privileged fragments, especially high confidence fragments, are more likely to undergo binding with protein words in the target. Based on this assumption, we constructed a composite scoring function for small molecules that integrates the number of target-matched privileged fragments within a molecule and rule scores of those corresponding fragments. Specifically, as detailed in the Methods, PWScore evaluates a candidate molecule by identifying privileged fragments that match the target protein. A comprehensive score for each fragment is calculated by multiplying its binding confidence score (derived from the number of associated rules and their scores) by its specificity score. The final PWScore for a molecule is computed by summing the comprehensive scores of these covered fragments, with a maximum atom coverage limit applied to prevent score inflation. The resulting score reflects the overall likelihood of a small molecule binding to a query protein, with higher scores indicating higher probability of activity.
Fig. 4. Evaluation of PWScore in virtual screening tasks. (a) Workflow of virtual screening using PWScore. Privileged fragments are first predicted for the target protein using PWRules, after which PWScore is used to score and rank compounds in the screening library based on the predicted privileged fragments. (b and c) Enrichment factor performance of different methods on the VSDS-vd RandomDecoy dataset (b) and VSDS-vd MassiveDecoy dataset (c) at EF 0.5%, EF 1%, and EF 5%.

Glide50 is the gold standard for structure-based virtual screening, while PSICHIC51 represents the state of the art among sequence-based methods, having outperformed existing sequence-based approaches such as DeepDTA and TransformerCPI across multiple benchmarks. To evaluate the performance of this screening workflow, we compared PWScore with representative physics-based (Glide) and deep-learning-based (PSICHIC) methods on two virtual screening benchmark datasets, including VSDS-vd RandomDecoy (68 protein targets; active compound to random decoy ratio = 1 : 20), and VSDS-vd MassiveDecoy dataset (8 protein targets; active-to-decoy ratio = 1 : 300).52 Using average enrichment factors (EF) from the top 0.5%, 1.0%, and 5.0% of the ranked lists as evaluation metrics, we found that PWScore achieved EF values of 13.4, 11.3, and 5.5 on the RandomDecoy dataset, respectively. In comparison, Glide achieved EF values of 12.1, 10.7, and 6.0, while PSICHIC achieved EF values of 12.6, 10.8, and 5.8 (Fig. 4b). Similarly, PWScore obtained EF values of 40.2, 24.2, and 7.2 on the MassiveDecoy dataset, whereas Glide yielded EF values of 38.4, 24.0, and 8.0, PSICHIC yielded EF values of 34.2, 23.4, and 7.4 (Fig. 4c). PWScore's advantage over Glide and PSICHIC is concentrated at the earliest thresholds—it achieves the highest EF 0.5% and EF 1% on both benchmarks, whereas its EF 5% falls slightly behind—a pattern that is a direct consequence of its rule-based scoring. Because PWScore prioritizes molecules with multiple high-confidence fragment matches, such compounds cluster near the top of the ranking; further down, toward the top 5%, a growing share of molecules match only a handful of low-confidence rules, diluting the enrichment at this threshold. This behavior makes PWScore especially well-suited to early-stage hit identification, where precision among top-ranked compounds matters most. These results indicate that PWScore achieves comparable enrichment performance to both physics-based and deep-learning-based methods while additionally providing interpretability through explicit privileged fragment mapping.
Notably, PWScore captures rule-based interaction features distinct from the energy calculations employed by Glide and the complex pattern recognition features employed by PSICHIC. Therefore, we hypothesized that PWScore could serve as a complementary module to enhance the predictive accuracy of these established screening methods. To explore this, the raw scores from PWScore and the baseline models (Glide or PSICHIC) were first individually transformed using Z-score normalization, and the average of these standardized scores was used to rank the compounds. This combined strategy resulted in superior performance. On the RandomDecoy dataset, the combination of Glide and PWScore achieved EF values of 15.5, 13.5, and 7.2, while the combination of PSICHIC and PWScore reached EF values of 15.5, 13.4, and 6.8. Consistent improvements were also observed on the MassiveDecoy dataset (Fig. 4b and c). These findings demonstrate that by integrating the interpretable, rule-based insights of PWScore with the rigorous scoring of established models, we can achieve a synergistic effect that greatly improves active molecule enrichment.
Beyond EF, we assessed virtual screening performance using AUROC, the area under the precision–recall curve (AUPRC), and Pearson correlation for a more comprehensive evaluation (Tables S1 and S2). On RandomDecoy, PWScore achieved an AUROC of 0.690, an AUPRC of 0.279, and a Pearson correlation of 0.230, comparable to Glide (0.710, 0.289, and 0.185) and PSICHIC (0.716, 0.274, and 0.207); notably, PWScore yielded the highest Pearson correlation among the three methods. On MassiveDecoy, PWScore achieved an AUROC of 0.724 and an AUPRC of 0.117, with the AUPRC surpassing both Glide (0.103) and PSICHIC (0.066) by a clear margin, reflecting stronger performance on highly imbalanced data; its Pearson correlation (0.077) likewise exceeded those of Glide (0.058) and PSICHIC (0.053). Consistent with the EF results, combining Glide with PWScore yielded the best overall performance across these metrics on both datasets (RandomDecoy: AUROC = 0.765, AUPRC = 0.364, Pearson = 0.293; MassiveDecoy: AUROC = 0.797, AUPRC = 0.183, Pearson = 0.095).
To validate the 50% privileged-fragment threshold, we conducted a sensitivity analysis comparing 30%, 50%, and 70% cutoffs (Table S3). At 30%, the average number of privileged fragments per protein rose substantially (from 214 to 231), and the number of extracted rules increased sharply (from 2 523 287 to 3 655 383), lowering PWScore precision and inflating false positives during virtual screening (EF 0.5%: 13.0 on RandomDecoy; 35.6 on MassiveDecoy). At 70%, the privileged-fragment set became overly sparse (from 214 to 178), yielding fewer rules (from 2 523 287 to 2 065 076) and missing more active molecules (EF 0.5%: 12.4 on RandomDecoy; 33.6 on MassiveDecoy). The 50% threshold gave the strongest virtual-screening enrichment overall.
To gauge the contribution of the IG-based interpretability module, we compared the full IG-based rule-extraction pipeline against a prediction-only approach that bypasses IG attribution and applies model output probabilities directly to virtual screening. The IG-based approach achieved EF 0.5% values of 13.4 and 40.2 on the RandomDecoy and MassiveDecoy benchmarks, respectively, with EF 1% values of 11.3 and 24.2 and EF 5% values of 5.5 and 7.2. The prediction-only approach, by contrast, achieved EF 0.5% values of only 11.5 and 34.0, with EF 1% values of 9.5 and 20.3 and EF 5% values of 4.7 and 6.4 (Table S4). This substantial drop in enrichment confirms that IG attribution is essential for filtering out spurious predictions and retaining structurally meaningful rules; without it, virtual screening incurs a markedly higher false-positive rate.
Proof-of-principle demonstration of PWScore generalizability and application in real-world virtual screening tasks
For further proof-of-principle evaluation of the practical application and generalizability of PWRules and PWScore in drug discovery, we conducted a case study assessing our framework's performance in virtual screening for ligands of the primary SARS-CoV-2 main protease, Mpro (also known as 3CLpro), a key therapeutic target in anti-COVID-19 drug development required for viral replication. Importantly, Mpro was not included in the training data for either PWRules or PWScore, ensuring stringent evaluation of generalizability to previously unseen targets (Fig. 5a). To this end, we compiled an extensive independent test set of Mpro binding data encompassing 15 843 small molecules from the literature and public databases, 12.7% of which are known active molecules (Fig. 5b). In this independent evaluation, the combination of Glide and PWScore achieved an EF 0.5% score of 6.77 (Fig. 5c), compared to 6.48 for Glide alone. Notably, in this combined approach, putative active molecules accounted for 86.3% of the top 0.5% ranked compounds, substantially exceeding enrichment through random selection. These results indicated that integrating PWScore with established methods could effectively discriminate active from inactive compounds, even for protein targets not encountered during training, thus demonstrating its generalizability and application in real-world virtual screening tasks.
Fig. 5. Inhibitor prediction for SARS-CoV-2 main protease using PWScore to augment Glide with word–fragment rules. (a) Target analysis showing Mpro is excluded from the training dataset. (b) Proportion of active molecules in the Mpro test set. (c) Ranking of compounds in the Mpro test set by the combination of Glide and PWScore. (d and e) Case studies of Mpro inhibitors, Nirmatrelvir (d) and Boceprevir (e), to visualize matched protein word–fragment rules in complex crystal structures for analysis of possible binding mechanisms.

Using the combined Glide and PWScore approach, we accurately identified Nirmatrelvir (IC50 = 2.67 nM, score = 3.38, rank = 76), the active component of the FDA approved drug, Paxlovid, as well as its covalent inhibitor, Boceprevir (IC50 = 4.13 µM, score = 2.96, rank = 123). To understand how PWScore contributed to the improved ranking of these actives, we next investigated whether word–fragment rules reflected physical binding principles of Mpro inhibitors using the structure of Nirmatrelvir in complex with Mpro (PDB: 7TLL) as an example. This analysis revealed that PWRules identified an interaction between the Mpro protein word, “ELPTGV” (residues 166–171), and the small molecule fragment, frag_2027 (Fig. 5d), with a hydrogen bond observed between the backbone of E166 and the peptide bond nitrogen in frag_2027. This finding suggested that PWScore reflected binding characteristics in the vicinity of this word. Additionally, we examined the structure of Mpro (PDB: 7NBR) in complex with Boceprevir. PWRules identified an interaction between the protein word “GTTTLN” (residues 23–28) and fragment frag_4730, which covers the amide nitrogen of Boceprevir through hydrogen bonding, explaining the binding characteristics of Boceprevir. These results showed that word–fragment rules for these compounds encode physical principles of binding, enabling the model to prioritize active compounds.
Discussion
In this study, we introduce the PWRules framework for predicting complementary pairing rules between protein words and small-molecule fragments. PWRules leverages binding affinity data to predict privileged small molecule fragments for a given protein and employs an interpretability module to translate these predictions into word–fragment rules. Building on these rules, we developed the PWScore function for prioritizing active compounds, which demonstrated competitive performance in active molecule enrichment compared to other scoring functions while uniquely offering interpretability. We found that PWScore is broadly generalizable to proteins outside the training set, such as the SARS-CoV-2 main protease. Although trained without explicit structural guidance, our analyses of validated protein–ligand complexes showed that PWRules learns protein word–fragment rules that are enriched near ligand-binding pockets (Fig. 3). Additionally, PWRules and PWScore are highly adaptable, and can be integrated with other deep learning-based methods to improve predictive accuracy in drug discovery tasks. By extracting and applying these complementary pairing rules, PWRules offers an interpretable framework for enhancing current computational drug discovery methods, bridging deep learning models with foundational principles of protein–ligand interactions.
Historically, heuristic rules have been widely used in drug design efforts,4 wherein pairing rules are typically applied to the protein active site, while non-active site residues that might also contribute to ligand binding are often ignored.53–55 In addition, medicinal chemists frequently focus on residue-substrate interactions, but overlook cooperative interactions among residues, especially among residues outside the active site. Our present framework enables prediction of higher-order sequence patterns involved in ligand recognition by applying protein words to capture local sequence context with functional relevance, consequently extending the rule set beyond active-site regions and single-residue-level knowledge. Through protein words, PWRules can model cooperative effects among residues that are often missed by amino acid-level embeddings. The learned rules also provide an interpretable knowledge base for drug discovery, which can be applied at multiple stages of drug design, including (i) prioritization of fragment libraries for fragment-based drug discovery, (ii) de novo molecule design targeting specific protein words, and (iii) predicting active molecules for sequence-only targets lacking structural information, which are particularly relevant for targets harboring intrinsically disordered regions.
Additionally, we noted that rules involving words located outside a binding pocket might reflect long-range or pre-binding interactions required for ligand recognition.56 Given that some rules are not yet fully understood, especially those involving protein words outside of active sites, we proposed a cascade model for understanding how pairing rules predicted by PWRules and PWScore could exhibit high prediction accuracy (Fig. S10).57 Briefly, growing evidence suggests that high-affinity ligands do not necessarily localize to protein binding pockets through purely random three-dimensional diffusion, but instead proceed through initial, transient associations with the protein surface mediated by long-range electrostatic interactions and shallow hydrophobic patches. This process, commonly referred to as electrostatic steering or encounter complex formation, selectively enriches ligands near functional regions of the protein, effectively increasing local ligand concentrations near the binding site. Two-dimensional surface diffusion and/or local conformational rearrangements subsequently guide ligands into deeply buried binding pockets.58 Our model can thus capture protein words outside the active site that play a role in ligand enrichment, guidance, and stabilization during the binding process, supporting the utility of pairing rules that do not involve the binding pocket.
Several methodological limitations warrant acknowledgment. Protein wordwise performs unsupervised sequence segmentation without explicit knowledge of ligand-binding sites, so the extracted protein words may occasionally miss binding-pocket residues. Defining privileged fragments as those present in >50% of active ligands is a statistical heuristic, not a guarantee of physical interaction with the target. Our PDB validation (Fig. 3) shows that approximately half of the predicted privileged fragments lie spatially close to their paired protein words, yet some frequent fragments may serve primarily as structural scaffolds rather than pharmacophoric contributors. Conversely, rare but functionally critical fragments—warhead groups, for instance—may fall below this threshold and be excluded, an inherent limitation of any frequency-based approach. Future work could incorporate quantitative fragment-contribution analyses, such as Matched Molecular Pair (MMP)59 and Free-Wilson60 analysis, to infer fragment-specific binding contributions from large-scale affinity data. Because PWRules' predictive capacity is bounded by the protein words and ligand fragments seen during training, proteins whose binding regions contain rare or unseen protein words, and molecules bearing substructures absent from the 4876-fragment library, may not be fully captured—even though that library achieves high chemical-space coverage across the benchmark databases and 81.3% of binding-pocket residues fall within covered regions.
Beyond the word–fragment rules described in the current study, future work could extend the PWRules framework to other classes of biomolecular interactions, including protein–protein interaction (PPI) rules61,62 and protein–nucleic acid (NA) pairing rules.63,64 This expanded capacity would require construction of PPI or protein–NA interaction datasets to substitute the protein–small molecule binding datasets employed in our present work. Although the current overall rule structure would remain similar for PPIs, with protein words defined on both interacting partners, to accommodate protein–NA interactions, our framework would require development of a dedicated motif dictionary defining the sequences or structural motifs of DNA and RNA. Despite these challenges, this adaptability to other basic research and drug design questions highlights the generalizability of our framework to diverse protein–ligand binding systems beyond small molecule recognition.
Methods
Dataset construction and data preprocessing
Data sources
Protein–small molecule affinity data were collected from four databases: PDBbind,37 BindingDB,38 BindingNet,39 and ChEMBL.40 In these databases, proteins with sequence lengths exceeding 1024 amino acids were excluded because such sequences are computationally demanding to process. A binding event was defined as a protein–ligand pair with experimentally determined Ki, Kd, IC50 or EC50 < 10 µM. This 10 µM threshold is widely adopted in large-scale compound–protein interaction (CPI) prediction studies. Koyama et al.,65 for example, used this cutoff to annotate positive and negative labels when building classification models from ChEMBL, Davis, and BindingDB, and the same threshold has served as a bioactivity cutoff in high-throughput screening and target-prediction methods.66 For affinity data from the ChEMBL database, entries with assay type annotated as “Binding” or “Functional” were retained while protein complexes entries were removed. During data integration, duplicate records were processed based on the following priority order: PDBbind > BindingDB > BindingNet > ChEMBL Binding > ChEMBL Functional, while the affinity type priority was Kd > Ki > IC50 > EC50. For repeated measurements of the same affinity type, the median value was selected as the final affinity value. All affinity data were binarized using a 10 µM threshold (values <10 µM were considered active). The final dataset contained 9661 proteins, 1 635 634 small molecules, and 3 438 736 affinity data points.
Fragment library generation
Small-molecule fragmentation was performed using the MacFrag42 algorithm. Fragments appearing in >50% of binding-positive ligands were retained as ‘privileged’, while fragments that occurred in <0.1% of small molecules were removed. The resulting library was further refined by filtering out structurally redundant or undesirable substructures, such as flexible chains with excessive rotatable bonds and complex linear peptides. The final library contained 4876 drug-like fragments.
To evaluate the chemical space coverage of our molecular fragment library, the proportion of molecules was computed in four benchmark databases: FDA-approved drug library, HMDB44 metabolite database, ChEMBL ligand set and the ZINC45 drug-like subset. Given the massive scale of the ZINC database (ZINC20 contains over 200 million drug-like molecules), 2 million molecules were randomly sampled from the ZINC20 drug-like subset to strike a balance between computational efficiency and representativeness for coverage calculations.
To characterize fragment usage at the individual-molecule level, molecules from the four benchmark databases were decomposed using MacFrag, and two statistics were computed for each molecule: the number of library fragments contained in the molecule, and heavy-atom coverage, defined as the fraction of a molecule's heavy atoms included in matched library fragments. Molecules with no matched library fragment were recorded as uncovered.
Protein word extraction
Protein sequences were partitioned into biologically meaningful semantic units, termed “Protein Words,” through the application of protein wordwise,36 an unsupervised segmentation toolkit based on the attention mechanisms of Protein Language Models (PLMs). Unlike conventional segmentation strategies that rely on rigid k-mers or sliding windows, our strategy parsed sequences according to intrinsic residue dependencies captured by the pre-trained ESM-2 model.41
In this procedure, attention matrices were first extracted from the transformer layers of the ESM-2 model for each input sequence. These matrices, which reflect pairwise interactions between amino acid residues, were utilized to construct residue-interaction graphs where nodes represented residues and edges represented attention weights. Subsequently, the Louvain community detection algorithm was applied to these graphs to identify clusters of highly correlated residues, which were then designated as protein words.
To ensure the functional relevance of the segmented units, a filtering criterion was imposed: only segments containing 5 to 20 amino acid residues were retained. This specific length range was selected to align with the typical dimensions of functional motifs and structural domains commonly observed in nature. It should be noted that protein words defined in this manner are not restricted to contiguous substrings; instead, discontinuous residues that are spatially or functionally linked in the primary sequence were also grouped into individual semantic units, thereby enabling the capture of long-range dependencies.
To vectorize these units, the full protein sequence was fed into ESM-2 with each amino acid tokenized individually, exactly as during pre-training, yielding context-aware embeddings for every residue. Each protein word was then represented by a fixed-length vector obtained by averaging the ESM-2 embeddings of its constituent residues, analogous to standard NLP practice, where word embeddings are derived by pooling sub-word embeddings (e.g., BPE tokens67), thereby preserving the pre-trained contextual representations. This aggregation captures the biochemical context and evolutionary information embedded in each functional segment. Arithmetic averaging was chosen because it introduces no additional learnable parameters and thus leaves the pre-trained contextual representations of ESM-2 unaltered, and because a protein word is a functional unit whose biological role is contributed jointly by its constituent residues, for which equal weighting is a natural default. Consistent with this choice, protein word embeddings composed by arithmetic averaging achieved comparable or superior performance to raw residue embeddings across most test conditions in the ablation study (Fig. 2b and c).
To evaluate whether the dictionary-filtered protein words adequately cover functional binding regions, pocket residues were identified from PDBbind complex structures as residues with any heavy atom within 10 Å of the bound ligand. Each retained protein word was mapped onto the full-length sequence of the corresponding protein, and for each complex the coverage was calculated as the fraction of pocket residues included in at least one retained protein word. The same calculation was performed for non-pocket residues. Coverage distributions of pocket and non-pocket regions were compared across 2690 complexes using the two-sided Mann–Whitney U test.
Dataset annotation and splitting
A ‘privileged fragment’ for each protein is defined as the molecular fragments that appeared in >50% of its binding ligands with a binding affinity <10 µM. This yielded a binary matrix of 9661 proteins × 4876 fragments, where each entry indicated whether a fragment is privileged for a given protein. This matrix served as the supervisory signal for model training. To evaluate the generalization performance of the model, the dataset was partitioned into training, validation, and test sets using an 8 : 1 : 1 ratio. The validation and test sets were constructed under three complementary settings: novel proteins, novel ligands and novel complexes. For proteins, novelty was defined by sequence identity: MMseqs2 (ref. 46) was used to exclude any protein sharing identical sequence with the training set. For ligands, novelty was defined by Tanimoto similarity (ECFP,47 1024-bit, radius = 2), with structurally identical ligands excluded. “Novel complex” denotes protein–ligand pairs in which both partners satisfy their respective novelty criteria. All splits were generated prior to training, ensuring no data leakage during the training process.
To assess the sensitivity of PWRules to the 50% privileged-fragment threshold, the entire pipeline was retrained independently with privileged fragments defined at 30% and 70% occurrence cutoffs among binding-positive ligands, in addition to the default 50%. For each cutoff, the privileged-fragment label matrix was regenerated, the model was retrained using the identical architecture, training protocol, and data splits, and pairing rules were extracted and filtered as described above. The resulting rule libraries were evaluated with PWScore on the VSDS-vd RandomDecoy and MassiveDecoy benchmarks, and the average number of privileged fragments per protein and the total number of extracted rules were recorded for each cutoff.
To assess the robustness of PWRules under different novelty definitions, test sets were reconstructed across a range of novelty thresholds. For proteins, the MMseqs2 sequence-identity cutoff was varied from 0.3 to 1.0 in steps of 0.1; for ligands, the Tanimoto similarity cutoff (ECFP, 1024-bit, radius = 2) was set to 0.5, 0.7, or 0.9. For each threshold combination, protein–ligand pairs satisfying the corresponding novelty criterion were assembled into the novel protein, novel ligand, and novel complex test sets, and predictive performance (precision and MCC) was evaluated using the protein word–fragment pairing rules without deep learning model inference.
The PWRules framework architecture
Base model architecture
The PWRules model adopted a transformer encoder architecture for multi-label prediction of privileged fragments to capture the contextual interactions between protein words and molecular fragments. The model took protein word embeddings as input, outputting a multi-dimensional vector (length 4876), where each dimension corresponded to the predicted probability of a fragment being privileged for the input protein.
Input representation
Each protein word was represented as a fixed-length embedding vector (1 × 1280), where 1280 is consistent with the embedding dimension produced by ESM-2. A learnable classification token (CLS) was prepended to the sequence of protein words to capture global contextual information. The final hidden state of this token was used as an aggregated protein-level representation for downstream fragment prediction. The fragment space was defined as a fixed library of molecular fragments extracted from ligand SMILES strings.
Training protocol
PWRules was trained using Adam optimization with an initial learning rate of 1 × 10−3, a weight decay of 1 × 10−5, and a batch size of 256. A cosine annealing learning rate scheduler (Tmax = 20) was employed. Model parameters were initialized with fixed random seeds for reproducibility. Each training run spanned up to 600 epochs. Early stopping was applied if validation performance did not improve for 60 consecutive epochs. Model checkpoints with the highest average MCC across independent validation sets were selected as final weights. The model was trained using binary cross-entropy with logits loss (BCEWithLogitsLoss). To address missing labels (NaN), the loss values were masked, and normalization was performed only over the observed entries.
Baseline protein representation models
To assess the contribution of protein wordwise segmentation, two baseline protein representation strategies were implemented. For the residue-embedding baseline, the protein sequence was tokenized into individual amino acids, and the pre-trained ESM-2 residue embeddings were fed directly into the same Transformer encoder in place of protein word embeddings. For the 5-mer embedding baseline, each protein sequence was partitioned into overlapping fixed-length segments of five consecutive residues using a sliding window with a stride of one residue (i.e., residues 1–5, 2–6, 3–7, and so on); each 5-mer was represented by the average ESM-2 embedding of its constituent residues. Both baselines were trained and evaluated using the identical architecture, training protocol, and data splits as PWRules. Rules were further extracted from the 5-mer model through the same Integrated Gradients-based interpretability module and accuracy-based filtering, enabling direct comparison with protein word-based rules.
Interpretability module and rule extraction
Attribution analysis
The Integrated Gradients68 attribution method was used to interpret the predictions of the model, enabling the identification of protein words that contributed to predictions. As a gradient-based explainability approach, Integrated Gradients attributed a model's prediction to its input features by integrating gradients along a path from a baseline input to the actual input. This step was implemented using the Captum69 library. The attributions in PWRules were computed using a forward function by reconstructing the transformer layers, attention masks, layer normalization and the final multilayer perceptron used for prediction. Integrated Gradients were computed independently for each fragment prediction by specifying the corresponding output neuron as the attribution target. The resulting attribution tensor was condensed to a single contribution score per protein word by summing across the embedding dimension. Thus, a single contribution score per protein word was obtained which was normalized using the L2 norm. Attribution analysis was performed exclusively on positive fragment interactions via the CPU.
Rule scoring definition
The rule score is defined as the geometric mean of the model prediction score and the IG attribution score. This combined score reflects the confidence and strength of the rule, with higher scores indicating greater confidence.
Rule filtering
The accuracy of each rule was evaluated in both the training set and validation set. Rules with an accuracy below 0.5 were excluded, thereby ensuring that the remaining rules were robust and generalizable.
Prediction-only ablation
To evaluate the contribution of the IG-based interpretability module to virtual screening, a prediction-only variant was constructed in which rule extraction and rule filtering were bypassed. For each target protein, the output probabilities of the trained model for all 4876 fragments were used directly as fragment binding-confidence scores, and candidate molecules were ranked using the same PWScore formulation (the product of confidence and specificity scores summed over covered fragments) without any rule-based filtering. All other virtual screening procedures were identical to those of the IG-based pipeline.
Construction of PWScore for virtual screening
Prediction of privileged fragments
The PWScore function was developed based on the protein word–fragment rules extracted from the PWRules. To predict privileged fragments for a target protein, its amino acid sequence was first segmented into protein words using protein wordwise. These words were then scanned against the precomputed rule database to identify potential privileged fragments that might bind to the protein. The binding confidence for each fragment was calculated using a joint probability formula, which integrated the number of pairing rules associated with the fragment and their respective rule scores. The underlying principle was that a higher number of rules pointing to the same fragment, coupled with elevated rule scores, increased the reliability of the fragment's binding propensity. The confidence score is defined as follows:
Here, Sconf (f) denotes the confidence score of a specific privileged fragment f. The variable n represents the total number of rules associated with this fragment, while Ri corresponds to the rule score of the i-th rule.
Additionally, the specificity of a privileged fragment was evaluated based on its frequency of occurrence across ligands in the dataset. Fragments with higher occurrence frequencies are generally simpler and more generic but exhibit lower target specificity. To quantify this, a specificity score is introduced, computed as:
Here, Lf denotes the logarithmic frequency of fragment f. Lmin and Lmax denote the minimum and maximum logarithmic frequencies observed across all fragments in the dataset, respectively.
The foundational assumption of PWScore is that candidate molecules containing a larger number of privileged fragments with high confidence and specificity scores are more likely to bind to the target protein. Thus, the comprehensive score for each privileged fragment is defined as the product of its confidence score and specificity score:Scomp (f) = Sconf (f) × Sspec (f)
Scoring function formulation
During virtual screening, PWScore evaluates a candidate molecule by first identifying all privileged fragments within the molecule that match the target protein. These fragments are then covered in descending order of their comprehensive scores, and the scores of the covered fragments are summed to compute the total PWScore for the molecule. A higher PWScore indicates a greater probability of the molecule being active:
In this expression, PWScore (M) is the aggregate predicted activity score for a candidate molecule M. The summation is performed over Fmatched, which denotes the set of unique privileged fragments identified within the molecule. Each fragment contributes its individual comprehensive score, Scomp (f), to the total.
To prevent score inflation caused by overlapping low-score fragments, a maximum atom coverage limit is implemented. Through parameter tuning, we determined that setting the maximum coverage count to 10 per atom optimizes PWScore's performance in molecular ranking tasks.
Structural validation of pairing rules
Geometric analysis in PDB
To assess the structural plausibility of predicted protein word–fragment pairs, a geometric analysis was performed using experimentally resolved protein–ligand complexes from the PDBbind database. For each complex structure, spatial relationships between co-occurring protein words and molecular fragments were evaluated by computing centroid-based distances. The centroid of a protein word was calculated as the geometric center of the Cα atoms in its representative residues while the centroid of a molecular fragment was defined as the geometric center of the three-dimensional coordinates of its constituent heavy atoms. Euclidean distances between centroids were computed for all co-occurring protein word–fragment pairs to quantify spatial proximity and assess the structural consistency of predicted pairing rules.
Specific molecular interactions (hydrogen bonds, electrostatic contacts) between protein words and privileged fragments were identified using Schrödinger's Protein Interaction Report tool. Hydrogen bonds were detected based on the software's built-in geometric criteria for donor–acceptor pairs, while electrostatic interactions were assessed via spatial analysis of charged groups.
Virtual screening benchmarks
Baseline methods setup
For comparative evaluation, we employed two baseline virtual screening methods: Glide50 and PSICHIC.51
Glide was configured using a docking grid centered on the centroid of the reference ligand in each holo protein structure. The grid box dimensions were set to 16 Å plus 0.8 times the diameter of the co-crystallized ligand, ensuring comprehensive coverage of the binding site. Docking scores were computed using Glide's standard precision mode.
PSICHIC was implemented using the official codebase, retrained on our custom dataset to align with the study's objective. All other parameters were retained as defaults to maintain consistency with the original methodology.
PWRules was further compared with CLAPE-SMB, a protein–small molecule binding-site prediction method based on pre-trained protein language models with contrastive learning, using its official implementation with default parameters. The evaluation was performed on the PDBbind test set (n = 1091 proteins), with true pocket residues defined as residues within 10 Å of the bound ligand. For PWRules, protein words predicted to pair with privileged fragments were mapped to their constituent residue positions to yield residue-level pocket predictions. For each protein, pocket residue prediction was treated as a residue-level binary classification task and quantified using the F1 score, defined as the harmonic mean of precision (the fraction of predicted residues overlapping true pocket residues) and recall (the fraction of true pocket residues covered by the prediction). Per-protein F1 distributions were then compared between the two methods.
Evaluation metrics
Model performance was assessed using the enrichment factor, which quantifies the concentration of active molecules within a ranked subset relative to random selection. The EF at a given threshold (e.g., top 1%) is defined as:
This metric evaluates the early enrichment capability of virtual screening methods.
In addition to EF, overall ranking performance was assessed using AUROC, AUPRC, and the Pearson correlation coefficient. AUROC measures the probability that a randomly selected active molecule is ranked above a randomly selected decoy, whereas AUPRC summarizes the precision–recall trade-off across all ranking thresholds and is particularly informative on highly imbalanced datasets. The Pearson correlation coefficient measures the linear correlation between the predicted scores and the binary activity labels across all ranked compounds. All metrics were computed per protein target and averaged across targets within each benchmark.
Decoy datasets
Benchmarking utilized two decoy datasets: VSDS-vd52 RandomDecoy (active-to-decoy ratio = 1 : 20) and VSDS-vd52 MassiveDecoy (ratio = 1 : 300). To ensure consistency with the PWRules framework, an activity threshold of 10 µM was applied uniformly for defining active molecules and corresponding decoys in both datasets.
Author contributions
Jingke Chen: methodology, software, validation; Jingrui Zhong: software, data curation; Tazneen Hossain Tani: visualization; Zidong Su: software; Xiaochun Zhang: software; Boxue Tian: conceptualization, writing – original draft, writing – review & editing, supervision, project administration.
Conflicts of interest
The authors declare no competing interests.
Supplementary Material
Acknowledgments
This work was supported by Beijing Frontier Research Center for Biological Structure (No. 041500002), Tsinghua University Dushi Program (No. 20261080024), the Tsinghua-Peking University Center for Life Sciences (No. 20111770319), and Beijing Natural Science Foundation (L259027).
Data availability
Our code is available at https://github.com/TianBoxue-lab/PWRules.
Supplementary information (SI) is available. See DOI: https://doi.org/10.1039/d6sc03365b.
Notes and references
- Wang Y. Li Y. Chen J. Lai L. Chem. Soc. Rev. 2025;54:11141–11183. doi: 10.1039/d5cs00415b. [DOI] [PubMed] [Google Scholar]
- Kruger F. Fechner N. Stiefl N. J. Chem. Inf. Model. 2020;60:2888–2902. doi: 10.1021/acs.jcim.0c00204. [DOI] [PubMed] [Google Scholar]
- Chen Y. Wang Z. Wang L. Wang J. Li P. Cao D. Zeng X. Ye X. Sakurai T. J. Cheminf. 2023;15:38. doi: 10.1186/s13321-023-00702-2. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Bissantz C. Kuhn B. Stahl M. J. Med. Chem. 2010;53:5061–5084. doi: 10.1021/jm100112j. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Cons B. D. Twigg D. G. Kumar R. Chessari G. J. Med. Chem. 2022;65:7476–7488. doi: 10.1021/acs.jmedchem.2c00164. [DOI] [PubMed] [Google Scholar]
- Tyagi R., Singh A., Chaudhary K. K. and Yadav M. K., in Bioinformatics, ed. D. B. Singh and R. K. Pathak, Academic Press, 2022, pp. 269–289 [Google Scholar]
- Murray C. W. Rees D. C. Nat. Chem. 2009;1:187–192. doi: 10.1038/nchem.217. [DOI] [PubMed] [Google Scholar]
- Xu W. Kang C. J. Med. Chem. 2025;68:5000–5004. doi: 10.1021/acs.jmedchem.5c00424. [DOI] [PubMed] [Google Scholar]
- Liu F. Mailhot O. Glenn I. S. Vigneron S. F. Bassim V. Xu X. Fonseca-Valencia K. Smith M. S. Radchenko D. S. Fraser J. S. Moroz Y. S. Irwin J. J. Shoichet B. K. Nat. Chem. Biol. 2025;21:1039–1045. doi: 10.1038/s41589-024-01797-w. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Ocana A. Pandiella A. Privat C. Bravo I. Luengo-Oroz M. Amir E. Gyorffy B. Biomarker Res. 2025;13:45. doi: 10.1186/s40364-025-00758-2. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Luo Y. Liu Y. Peng J. Nat. Mach. Intell. 2023;5:1390–1401. doi: 10.1038/s42256-023-00751-0. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Noor F. Junaid M. Almalki A. H. Almaghrabi M. Ghazanfar S. Tahir ul Qamar M. Sci. Rep. 2024;14:28321. doi: 10.1038/s41598-024-79799-w. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Walters W. P. Barzilay R. Acc. Chem. Res. 2021;54:263–270. doi: 10.1021/acs.accounts.0c00699. [DOI] [PubMed] [Google Scholar]
- Zhang Y. Li S. Meng K. Sun S. J. Chem. Inf. Model. 2024;64:1456–1472. doi: 10.1021/acs.jcim.3c01841. [DOI] [PubMed] [Google Scholar]
- Zhao Y. Xing Y. Zhang Y. Wang Y. Wan M. Yi D. Wu C. Li S. Xu H. Zhang H. Liu Z. Zhou G. Li M. Wang X. Chen Z. Li R. Wu L. Zhao D. Zan P. He S. Bo X. Nat. Commun. 2025;16:6915. doi: 10.1038/s41467-025-62235-6. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Jia Y. Gao B. Tan J. Zheng J. Hong X. Zhu W. Tan H. Xiao Y. Tan L. Cai H. Huang Y. Deng Z. Wu X. Jin Y. Yuan Y. Tian J. He W. Ma W. Zhang Y. Liu L. Yan C. Zhang W. Lan Y. Science. 2026;391:eads9530. doi: 10.1126/science.ads9530. [DOI] [PubMed] [Google Scholar]
- Yuan Q. Tian C. Yang Y. eLife. 2024;13:RP93695. doi: 10.7554/eLife.93695. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Chen L. Fan Z. Chang J. Yang R. Hou H. Guo H. Zhang Y. Yang T. Zhou C. Sui Q. Chen Z. Zheng C. Hao X. Zhang K. Cui R. Zhang Z. Ma H. Ding Y. Zhang N. Lu X. Luo X. Jiang H. Zhang S. Zheng M. Nat. Commun. 2023;14:4217. doi: 10.1038/s41467-023-39856-w. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Zhao Q. Zhao H. Zheng K. Wang J. Bioinformatics. 2022;38:655–662. doi: 10.1093/bioinformatics/btab715. [DOI] [PubMed] [Google Scholar]
- Nguyen T. Le H. Quinn T. P. Nguyen T. Le T. D. Venkatesh S. Bioinformatics. 2021;37:1140–1147. doi: 10.1093/bioinformatics/btaa921. [DOI] [PubMed] [Google Scholar]
- MacAinsh M. Qin S. Zhou H.-X. eLife. 2025;14:RP107470. doi: 10.7554/eLife.107470. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Öztürk H. Özgür A. Ozkirimli E. Bioinformatics. 2018;34:i821–i829. doi: 10.1093/bioinformatics/bty593. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Chen L. Tan X. Wang D. Zhong F. Liu X. Yang T. Luo X. Chen K. Jiang H. Zheng M. Bioinformatics. 2020;36:4406–4414. doi: 10.1093/bioinformatics/btaa524. [DOI] [PubMed] [Google Scholar]
- Bai P. Miljković F. John B. Lu H. Nat. Mach. Intell. 2023;5:126–136. [Google Scholar]
- Yang Z. Zhong W. Zhao L. Yu-Chian Chen C. Chem. Sci. 2022;13:816–833. doi: 10.1039/d1sc05180f. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Yang Z. Zhong W. Lv Q. Dong T. Yu-Chian Chen C. J. Phys. Chem. Lett. 2023;14:2020–2033. doi: 10.1021/acs.jpclett.2c03906. [DOI] [PubMed] [Google Scholar]
- Huang K. Xiao C. Glass L. M. Sun J. Bioinformatics. 2021;37:830–836. doi: 10.1093/bioinformatics/btaa880. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Khodabandeh Yalabadi A., Yazdani-Jahromi M., Yousefi N., Tayebi A., Abdidizaji S. and Garibay O. O., arXiv, 2023, preprint, arXiv:2311.02326, 10.48550/arXiv.2311.02326 [DOI]
- Jencks W. P. Proc. Natl. Acad. Sci. U. S. A. 1981;78:4046–4050. doi: 10.1073/pnas.78.7.4046. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Babaoglu K. Shoichet B. K. Nat. Chem. Biol. 2006;2:720–723. doi: 10.1038/nchembio831. [DOI] [PubMed] [Google Scholar]
- Erlanson D. A. Fesik S. W. Hubbard R. E. Jahnke W. Jhoti H. Nat. Rev. Drug Discovery. 2016;15:605–619. doi: 10.1038/nrd.2016.109. [DOI] [PubMed] [Google Scholar]
- Preuer K., Klambauer G., Rippmann F., Hochreiter S. and Unterthiner T., in Explainable AI: Interpreting, Explaining and Visualizing Deep Learning, ed. W. Samek, G. Montavon, A. Vedaldi, L. K. Hansen and K.-R. Müller, Springer, Cham, 2019, pp. 331–345 [Google Scholar]
- Karimi M. Wu D. Wang Z. Shen Y. J. Chem. Inf. Model. 2021;61:46–66. doi: 10.1021/acs.jcim.0c00866. [DOI] [PMC free article] [PubMed] [Google Scholar]
- McCloskey K. Taly A. Monti F. Brenner M. P. Colwell L. J. Proc. Natl. Acad. Sci. U. S. A. 2019;116:11624–11629. doi: 10.1073/pnas.1820657116. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Wang C. Kumar G. A. Rajapakse J. C. Sci. Rep. 2025;15:179. doi: 10.1038/s41598-024-83090-3. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Chen H. Zhong J. Zhang X. Chen J. Guo L. Xiong X. Zhang X. Liu X. Xiao B. Tian B. Adv. Sci. 2026;13:e21970. doi: 10.1002/advs.202521970. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Liu Z. Su M. Han L. Liu J. Yang Q. Li Y. Wang R. Acc. Chem. Res. 2017;50:302–309. doi: 10.1021/acs.accounts.6b00491. [DOI] [PubMed] [Google Scholar]
- Liu T. Hwang L. Burley S. K. Nitsche C. I. Southan C. Walters W. P. Gilson M. K. Nucleic Acids Res. 2025;53:D1633–D1644. doi: 10.1093/nar/gkae1075. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Li X. Shen C. Zhu H. Yang Y. Wang Q. Yang J. Huang N. J. Chem. Inf. Model. 2024;64:2454–2466. doi: 10.1021/acs.jcim.3c01170. [DOI] [PubMed] [Google Scholar]
- Zdrazil B. Felix E. Hunter F. Manners E. J. Blackshaw J. Corbett S. de Veij M. Ioannidis H. Lopez D. M. Mosquera J. F. Magarinos M. P. Bosc N. Arcila R. Kizilören T. Gaulton A. Bento A. P. Adasme M. F. Monecke P. Landrum G. A. Leach A. R. Nucleic Acids Res. 2024;52:D1180–D1192. doi: 10.1093/nar/gkad1004. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Lin Z. Akin H. Rao R. Hie B. Zhu Z. Lu W. Smetanin N. Verkuil R. Kabeli O. Shmueli Y. dos Santos Costa A. Fazel-Zarandi M. Sercu T. Candido S. Rives A. Science. 2023;379:1123–1130. doi: 10.1126/science.ade2574. [DOI] [PubMed] [Google Scholar]
- Diao Y. Hu F. Shen Z. Li H. Bioinformatics. 2023;39:btad012. doi: 10.1093/bioinformatics/btad012. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Congreve M. Carr R. Murray C. Jhoti H. Drug Discovery Today. 2003;8:876–877. doi: 10.1016/s1359-6446(03)02831-9. [DOI] [PubMed] [Google Scholar]
- Wishart D. S. Guo A. Oler E. Wang F. Anjum A. Peters H. Dizon R. Sayeeda Z. Tian S. Lee B. L. Berjanskii M. Mah R. Yamamoto M. Jovel J. Torres-Calzada C. Hiebert-Giesbrecht M. Lui V. W. Varshavi D. Varshavi D. Allen D. Arndt D. Khetarpal N. Sivakumaran A. Harford K. Sanford S. Yee K. Cao X. Budinski Z. Liigand J. Zhang L. Zheng J. Mandal R. Karu N. Dambrova M. Schiöth H. B. Greiner R. Gautam V. Nucleic Acids Res. 2022;50:D622–D631. doi: 10.1093/nar/gkab1062. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Irwin J. J. Tang K. G. Young J. Dandarchuluun C. Wong B. R. Khurelbaatar M. Moroz Y. S. Mayfield J. Sayle R. A. J. Chem. Inf. Model. 2020;60:6065–6073. doi: 10.1021/acs.jcim.0c00675. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Steinegger M. Söding J. Nat. Biotechnol. 2017;35:1026–1028. doi: 10.1038/nbt.3988. [DOI] [PubMed] [Google Scholar]
- Rogers D. Hahn M. J. Chem. Inf. Model. 2010;50:742–754. doi: 10.1021/ci100050t. [DOI] [PubMed] [Google Scholar]
- Gruber R. C. Wirak G. S. Blazier A. S. Lee L. Dufault M. R. Hagan N. Chretien N. LaMorte M. Hammond T. R. Cheong A. Ryan S. K. Macklin A. Zhang M. Pande N. Havari E. Turner T. J. Chomyk A. Christie E. Trapp B. D. Ofengeim D. Nat. Commun. 2024;15:10116. doi: 10.1038/s41467-024-54430-8. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Wang J. Liu Y. Tian B. J. Cheminf. 2024;16:125. [Google Scholar]
- Friesner R. A. Banks J. L. Murphy R. B. Halgren T. A. Klicic J. J. Mainz D. T. Repasky M. P. Knoll E. H. Shelley M. Perry J. K. Shaw D. E. Francis P. Shenkin P. S. J. Med. Chem. 2004;47:1739–1749. doi: 10.1021/jm0306430. [DOI] [PubMed] [Google Scholar]
- Koh H. Y. Nguyen A. T. N. Pan S. May L. T. Webb G. I. Nat. Mach. Intell. 2024;6:673–687. [Google Scholar]
- Gu S. Shen C. Zhang X. Sun H. Cai H. Luo H. Zhao H. Liu B. Du H. Zhao Y. Fu C. Zhai S. Deng Y. Liu H. Hou T. Kang Y. Nat. Mach. Intell. 2025;7:509–520. [Google Scholar]
- Berezovsky I. N. Nussinov R. J. Mol. Biol. 2022;434:167751. doi: 10.1016/j.jmb.2022.167751. [DOI] [PubMed] [Google Scholar]
- Christopoulos A. Nat. Rev. Drug Discovery. 2002;1:198–210. doi: 10.1038/nrd746. [DOI] [PubMed] [Google Scholar]
- Meller A. Lotthammer J. M. Smith L. G. Novak B. Lee L. A. Kuhn C. C. Greenberg L. Leinwand L. A. Greenberg M. J. Bowman G. R. eLife. 2023;12:e83602. doi: 10.7554/eLife.83602. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Lockless S. W. Ranganathan R. Science. 1999;286:295–299. doi: 10.1126/science.286.5438.295. [DOI] [PubMed] [Google Scholar]
- Wade R. C. Gabdoulline R. R. Lüdemann S. K. Lounnas V. Proc. Natl. Acad. Sci. U. S. A. 1998;95:5942–5949. doi: 10.1073/pnas.95.11.5942. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Samson R. Deutch J. M. J. Chem. Phys. 1978;68:285–290. [Google Scholar]
- Hussain J. Rea C. J. Chem. Inf. Model. 2010;50:339–348. doi: 10.1021/ci900450m. [DOI] [PubMed] [Google Scholar]
- Free S. M. Wilson J. W. J. Med. Chem. 1964;7:395–399. doi: 10.1021/jm00334a001. [DOI] [PubMed] [Google Scholar]
- Ullanat V. Jing B. Sledzieski S. Berger B. Nat. Commun. 2026;17:1199. doi: 10.1038/s41467-025-67971-3. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Zhang J. Humphreys I. R. Pei J. Kim J. Choi C. Yuan R. Durham J. Liu S. Choi H.-J. Baek M. Baker D. Cong Q. Science. 2025;390:eadt1630. doi: 10.1126/science.adt1630. [DOI] [PMC free article] [PubMed] [Google Scholar]
- He Y. Fang P. Shan Y. Pan Y. Wei Y. Chen Y. Chen Y. Liu Y. Zeng Z. Zhou Z. Zhu F. Holmes E. C. Ye J. Li J. Shu Y. Shi M. Li Z. Nat. Mach. Intell. 2025;7:942–953. [Google Scholar]
- Roche R. Moussad B. Shuvo M. H. Tarafder S. Bhattacharya D. Nucleic Acids Res. 2024;52:e27. doi: 10.1093/nar/gkae039. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Koyama T. Matsumoto S. Iwata H. Kojima R. Okuno Y. J. Chem. Inf. Model. 2023;63:4552–4559. doi: 10.1021/acs.jcim.3c00269. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Blucher A. S. Choonoo G. Kulesz-Martin M. Wu G. McWeeney S. K. Trends Pharmacol. Sci. 2017;38:1085–1099. doi: 10.1016/j.tips.2017.08.006. [DOI] [PMC free article] [PubMed] [Google Scholar]
- Sennrich R., Haddow B. and Birch A., in Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, Berlin, Germany, 2016, pp. 1715–1725 [Google Scholar]
- Sundararajan M., Taly A. and Yan Q., in Proceedings of the 34th International Conference on Machine Learning, 2017, pp. 3319–3328 [Google Scholar]
- Kokhlikyan N., Miglani V., Martin M., Wang E., Alsallakh B., Reynolds J., Melnikov A., Kliushkina N., Araya C., Yan S. and Reblitz-Richardson O., arXiv, 2020, preprint, arXiv:2009.07896, 10.48550/arXiv.2009.07896 [DOI]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Supplementary Materials
Data Availability Statement
Our code is available at https://github.com/TianBoxue-lab/PWRules.
Supplementary information (SI) is available. See DOI: https://doi.org/10.1039/d6sc03365b.
