Search bioRxiv⌕ Search

Biology subjects

Refahi, M. S.

Publications and source records attributed to Refahi, M. S..

3 recordsLinked to original sources

Nevermore: Target-Conditioned Protein-Ligand Representation Learning for Multi-Objective Lead Optimization with Database-Grounded Retrieval

Target-conditioned molecular design requires optimizing binding affinity to a proposed therapeutic protein target while balancing competing developability constraints (e.g., absorption, distribution, metabolism, excretion, and toxicity; ADMET). Yet many computational pipelines either optimize a single objective or rely on fully de novo generation that can be difficult to control and interpret. We present Nevermore, a target-conditioned, database-grounded framework that combines a geometry-aware protein-ligand affinity oracle with Pareto-aware multi-objective search over an explicit molecular feature space. A central design choice is to optimize in count-based Morgan fingerprint space, where each feature corresponds to a chemically meaningful substructure count, enabling discrete, interpretable "bucket-level" edits. Nevermore learns target-conditioned scores by aligning protein and ligand representations under contrastive objectives and using a similarity-based prediction head; the resulting affinity oracle improves over previously reported benchmark baselines, providing a stronger scoring signal for downstream optimization. Nevermore then steers candidate selection by proposing sparse fingerprint edits, re-ranking candidates under multiple objectives, and projecting edited fingerprints back to valid molecules via nearest-neighbor retrieval from a large compound library. This yields efficient screening without exhaustive enumeration and provides transparent attributions that connect optimization steps to concrete chemical motifs. We evaluate Nevermore on two target case studies (Menin and SARS-CoV-2 Mpro). Across targets, the closed-loop search consistently retrieves candidate sets with improved affinity-property trade-offs compared with random sampling and similarity-only retrieval baselines, while maintaining explicit control and interpretability through discrete feature-space edits. These results support database-grounded, feature-space steering as a practical route to target-conditioned multi-objective lead refinement without relying on fully de novo generation.

bioinformatics↗

iSeqsSearch: Incremental Protein Search for iBlast/iMMSeqs2/iDiamond

BackgroundThe advancement of sequencing technology has led to a rapid increase in the amount of DNA and protein sequence data; consequently, the size of genomic and proteomic databases is constantly growing. As a result, database searches need to be continually updated to account for the new data being added. Continually re-searching the entire existing dataset, however, wastes resources. Incremental database search can address this problem. MethodsOne recently introduced incremental search method is iBlast, which wraps the BLAST sequence search method with an algorithm to reuse previously processed data and thereby increase search efficiency. The iBlast wrapper, however, must be generalized to support more performant DNA/protein sequence search methods that have been developed, namely MMseqs2 and Diamond. Moreover, the previously published iBlast wrapper has to be revised to be more robust and usable by the general community. ResultsiMMseqs2 and iDiamond, which apply the incremental approach, obtain results nearly identical to those achieved using only MMseqs2 and Diamond. Notably, when comparing ranking comparison methods such as the Pearson correlation, we observe a high concordance of over 0.9, indicating similar results. Moreover, in some cases, our incremental approach applying iBlast merge function and using m8 formats including the new m8e format provides more hits compared to the conventional MMseqs2 and Diamond. ConclusionThe incremental approach using iMMseqs2 and iDiamond demonstrates efficiency in terms of reusing previously processed data while maintaining high accuracy and concordance in search results. This method can reduce resource waste in continually growing genomic and proteomic database searches. The sample codes are made available at GitHub: https://github.com/EESI/Incremental-Protein-Search.

bioinformatics↗

A novel fusion based on the evolutionary features for protein fold recognition using support vector machines

Protein fold recognition plays a crucial role in discovering three-dimensional structure of proteins and protein functions. Several approaches have been employed for the prediction of protein folds. Some of these approaches are based on extracting features from protein sequences and using a strong classifier. Feature extraction techniques generally utilize syntactical-based information, evolutionary-based information and physiochemical-based information to extract features. In recent years, Finding an efficient technique for integrating discriminate features have been received advancing attention. In this study, we integrate Auto-Cross-Covariance (ACC) and Separated dimer (SD) evolutionary feature extraction methods. The results features are scored by Information gain (IG) to define and select several discriminated features. According to three benchmark datasets, DD, RDD and EDD, the results of the support vector machine (SVM) show more than 6% improvement in accuracy on these benchmark datasets.

bioinformatics↗