{
  "abstract": "Lead compound multi-objective optimization requires balancing mutually restrictive drug-like properties, yet conventional latent generative and evolutionary optimization methods suffer from structural-function misalignment, population structural redundancy and low search efficiency under limited evaluation budgets. This work proposes a decomposition-based evolutionary framework built on a score-informed latent space (MoDeMol), with four core innovations: (1) Contrastive fine-tuned Transformer-VAE latent space supervised by predicted dual-target activity scores to improve the alignment between latent spatial proximity and predicted target-activity profiles. (2) Hybrid population initialization combining lead latent perturbation and high-quality molecular bank screening to balance local scaffold retention and global high predicted-activity region exploration. (3) Adaptive resource allocation mechanism for dynamic subproblem computation scheduling to boost optimization efficiency when the property evaluation budget is limited. (4) Dynamic Morgan fingerprint similarity penalization to suppress structural redundancy and maintain diverse molecular scaffolds in the population. Extensive benchmarks on single-target GSK3β and dual-target GSK3β/JNK3 kinase optimization tasks demonstrate that MoDeMol outperforms MolFinder, JANUS and MOMO in success rate, Pareto hypervolume and qualified molecular yield. Quantitative latent-space analyses, qualitative visualization, scaffold tracking, and ablation experiments provide complementary evidence for the contributions of the proposed components. The proposed framework addresses representation alignment, structural redundancy, and search-resource allocation within a computational multi-target lead-optimization workflow under limited evaluation budgets.",
  "abstract_shown": true,
  "affiliations": [
    "School of Artificial Intelligence and Computer Science, Shaanxi Normal University, Xi’an 710119, China"
  ],
  "article_type": "research article",
  "arxiv": null,
  "author_total": 2,
  "authors": [
    {
      "affs": [
        0
      ],
      "name": "Chenbin Guo"
    },
    {
      "affs": [
        0
      ],
      "name": "Cai Dai",
      "orcid": "0009-0002-4417-8532"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/ezv4ee5q2pgvb.bib",
  "cited_by": 0,
  "doi": "10.3390/ijms27198818",
  "fulltext_url": "https://europepmc.org/articles/PMC13665247",
  "id": "ezv4ee5q2pgvb",
  "issns": [
    "1422-0067"
  ],
  "landing_url": "https://www.mdpi.com/1422-0067/27/19/8818",
  "language": "eng",
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "openalex",
      "1703|Computational Drug Discovery Methods"
    ]
  ],
  "openalex": "W7216516310",
  "pdf_url": "https://europepmc.org/articles/PMC13665247?pdf=render",
  "pmcid": "PMC13665247",
  "pmid": "42884060",
  "published": "2026-10-02",
  "publisher": "MDPI AG",
  "ris": "https://research.draconitic.com/paper/ezv4ee5q2pgvb.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:18:55Z",
      "native_id": "10.3390/ijms27198818",
      "source": "crossref",
      "url": "https://www.mdpi.com/1422-0067/27/19/8818"
    },
    {
      "first_seen": "2026-10-30T12:19:00Z",
      "native_id": "MED:42884060",
      "source": "europepmc",
      "url": "https://europepmc.org/article/MED/42884060"
    }
  ],
  "subjects": [
    {
      "field": "biochemistry",
      "origin": "issn:1422-0067",
      "subfield": "general"
    }
  ],
  "title": "MoDeMol: A Decomposition-Based Evolutionary Framework for Multi-Objective Molecular Optimization",
  "title_text": "MoDeMol: A Decomposition-Based Evolutionary Framework for Multi-Objective Molecular Optimization",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:19:00Z",
  "url": "https://research.draconitic.com/paper/ezv4ee5q2pgvb",
  "venue": "International Journal of Molecular Sciences",
  "versions": []
}