A hybrid metaheuristic algorithm for efficient de novo drug design using SELFIES and adaptive search strategies

The discovery of drug-like molecules is a fundamental challenge in computational chemistry because the chemical space contains an enormous number of possible molecular structures. Although deep learning has achieved remarkable success in de novo molecular design, its reliance on large training datasets and high computational costs limits its efficiency and practical applicability. This study aims to develop an efficient training-free framework for de novo drug design by integrating swarm intelligence, evolutionary optimization, and the robust SELF-referencIng Embedded Strings (SELFIES) molecular representation. In specific, we propose SIB-SOMO-SELFIES, a hybrid metaheuristic algorithm that combines the “guided-by-the-best” search strategy of Particle Swarm Optimization with the crossover and mutation mechanisms of Genetic Algorithms. The proposed framework enhances molecular optimization through SELFIES-aware mutation operators, an improved MIX crossover strategy, adaptive probability updating, similarity penalties, and complementary VARY and Random Jump operations to balance exploration and exploitation. Performance was evaluated through computational molecular optimization simulations using the Quantitative Estimation of Drug-likeness (QED) as the optimization objective, and benchmarked against representative SELFIES-based methods including SIB-SOMO, GA-D, SELFIES-VAE, SELFIES-LSTM-HC, SELFIES-REINVENT, and Pasithea. Simulation results demonstrate that the proposed framework efficiently explores the chemical space while maintaining rapid convergence and high optimization stability. The proposed algorithm was evaluated through computational molecular optimization experiments using QED as the objective function. The results show that the hybrid PSO-GA framework efficiently explores the molecular search space and consistently identifies molecular candidates with high predicted drug-likeness as assessed by QED. The proposed method generates molecules with QED scores exceeding 0.948 while maintaining computational efficiency. These findings support the computational potential of the proposed hybrid metaheuristic framework for de novo molecular design without requiring large-scale model training; however, the generated candidates have not yet been validated through experimental synthesis or biological assays.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2026-09-24
DOI
https://doi.org/10.1038/s41598-026-69048-7
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

A hybrid metaheuristic algorithm for efficient de novo drug design using SELFIES and adaptive search strategies

Hsin‐Ping Liu, Frederick Kin Hing Phoa, Shen-Ching Feng
Scientific Reports
Computational Drug Discovery Methods
article

A hybrid metaheuristic algorithm for efficient de novo drug design using SELFIES and adaptive search strategies

Hsin‐Ping Liu, Frederick Kin Hing Phoa, Shen-Ching Feng
article en

Abstract

The discovery of drug-like molecules is a fundamental challenge in computational chemistry because the chemical space contains an enormous number of possible molecular structures. Although deep learning has achieved remarkable success in de novo molecular design, its reliance on large training datasets and high computational costs limits its efficiency and practical applicability. This study aims to develop an efficient training-free framework for de novo drug design by integrating swarm intelligence, evolutionary optimization, and the robust SELF-referencIng Embedded Strings (SELFIES) molecular representation. In specific, we propose SIB-SOMO-SELFIES, a hybrid metaheuristic algorithm that combines the “guided-by-the-best” search strategy of Particle Swarm Optimization with the crossover and mutation mechanisms of Genetic Algorithms. The proposed framework enhances molecular optimization through SELFIES-aware mutation operators, an improved MIX crossover strategy, adaptive probability updating, similarity penalties, and complementary VARY and Random Jump operations to balance exploration and exploitation. Performance was evaluated through computational molecular optimization simulations using the Quantitative Estimation of Drug-likeness (QED) as the optimization objective, and benchmarked against representative SELFIES-based methods including SIB-SOMO, GA-D, SELFIES-VAE, SELFIES-LSTM-HC, SELFIES-REINVENT, and Pasithea. Simulation results demonstrate that the proposed framework efficiently explores the chemical space while maintaining rapid convergence and high optimization stability. The proposed algorithm was evaluated through computational molecular optimization experiments using QED as the objective function. The results show that the hybrid PSO-GA framework efficiently explores the molecular search space and consistently identifies molecular candidates with high predicted drug-likeness as assessed by QED. The proposed method generates molecules with QED scores exceeding 0.948 while maintaining computational efficiency. These findings support the computational potential of the proposed hybrid metaheuristic framework for de novo molecular design without requiring large-scale model training; however, the generated candidates have not yet been validated through experimental synthesis or biological assays.

Scientific Reports
National Taiwan University (TW), University of Chicago (US), Institute of Statistical Science, Academia Sinica (TW)
Openalex Percentile: Top 9%
Computational Drug Discovery Methods
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.