Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

408
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
408
Ligand Binding and Linkage00:49

Ligand Binding and Linkage

6.0K
Allosteric proteins have more than one ligand binding site; the binding of a ligand to any of these sites influences the binding of ligands to the other sites. When a protein is allosteric, its binding sites are called coupled or linked.  In the case of enzymes, the site that binds to the substrate is known as the active site and the other site is known as the regulatory site. When a ligand binds to the regulatory site, this leads to conformational changes in the protein that can influence...
6.0K
Predicting Molecular Geometry02:27

Predicting Molecular Geometry

47.2K
VSEPR Theory for Determination of Electron Pair Geometries
47.2K
Ligand Binding Sites02:40

Ligand Binding Sites

15.9K
Proteins are dynamic macromolecules that carry out a wide variety of essential processes; however, the activities of most proteins depend on their interactions with other molecules or ions, known as ligands.
Protein-ligand interactions are quite specific; even though numerous potential ligands surround a cellular protein at any given time, only a particular ligand can bind to that protein. Moreover, a ligand binds only to a dedicated area on the surface of the protein, known as the...
15.9K
Methods of Medium Optimization01:28

Methods of Medium Optimization

63
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
63
Conserved Binding Sites01:49

Conserved Binding Sites

5.3K
Many proteins’ biological role depends on their interactions with their ligands, small molecules that bind to specific locations on the protein known as ligand-binding sites. Ligand-binding sites are often conserved among homologous proteins as these sites are critical for protein function.
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally...
5.3K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Multi-objective consensus optimization for gene regulatory networks inference: A preference-based approach.

Computational biology and chemistry·2025
Same author

Multifaceted evolution focused on maximal exploitation of domain knowledge for the consensus inference of Gene Regulatory Networks.

Computers in biology and medicine·2025
Same author

Exhaustive biclustering driven by self-learning evolutionary approach for biomedical data.

Computer methods and programs in biomedicine·2025
Same author

Multi-objective context-guided consensus of a massive array of techniques for the inference of Gene Regulatory Networks.

Computers in biology and medicine·2024
Same author

GENECI: A novel evolutionary machine learning consensus-based approach for the inference of gene regulatory networks.

Computers in biology and medicine·2023
Same author

Ensemble-based genetic algorithm explainer with automized image segmentation: A case study on melanoma detection dataset.

Computers in biology and medicine·2023

Related Experiment Video

Updated: Apr 11, 2026

Incorporating Target Protein Structure Flexibility and Dynamics in Computational Drug Discovery Using Ensemble-Based Docking Analysis
08:49

Incorporating Target Protein Structure Flexibility and Dynamics in Computational Drug Discovery Using Ensemble-Based Docking Analysis

Published on: June 20, 2025

1.6K

Solving molecular docking problems with multi-objective metaheuristics.

María Jesús García-Godoy1, Esteban López-Camacho2, José García-Nieto3

  • 1Khaos Research Group, Departament of Computer Sciences, University of Málaga (UMA), ETSI Informática, Campus de Teatinos, Málaga 29071, Spain. mjgarciag@lcc.uma.es.

Molecules (Basel, Switzerland)
|June 5, 2015
PubMed
Summary
This summary is machine-generated.

This study compares multi-objective optimization algorithms for molecular docking, finding they offer promising results for drug discovery by optimizing binding energies. These advanced methods show effectiveness in identifying molecular interactions.

Keywords:
algorithm comparisonmolecular dockingmulti-objective optimizationnature-inspired metaheuristics

More Related Videos

Application of I TASSER, trRosetta, UCSF Chimera, HADDOCK server, and HEX loria for De Novo and In Silico Design of Proteins
05:08

Application of I TASSER, trRosetta, UCSF Chimera, HADDOCK server, and HEX loria for De Novo and In Silico Design of Proteins

Published on: July 8, 2025

1.3K
Quantitative Structure-Activity Relationship, Activity Prediction, and Molecular Dynamics of Non-nucleotide Reverse Transcriptase Inhibitors
10:29

Quantitative Structure-Activity Relationship, Activity Prediction, and Molecular Dynamics of Non-nucleotide Reverse Transcriptase Inhibitors

Published on: May 9, 2025

2.7K

Related Experiment Videos

Last Updated: Apr 11, 2026

Incorporating Target Protein Structure Flexibility and Dynamics in Computational Drug Discovery Using Ensemble-Based Docking Analysis
08:49

Incorporating Target Protein Structure Flexibility and Dynamics in Computational Drug Discovery Using Ensemble-Based Docking Analysis

Published on: June 20, 2025

1.6K
Application of I TASSER, trRosetta, UCSF Chimera, HADDOCK server, and HEX loria for De Novo and In Silico Design of Proteins
05:08

Application of I TASSER, trRosetta, UCSF Chimera, HADDOCK server, and HEX loria for De Novo and In Silico Design of Proteins

Published on: July 8, 2025

1.3K
Quantitative Structure-Activity Relationship, Activity Prediction, and Molecular Dynamics of Non-nucleotide Reverse Transcriptase Inhibitors
10:29

Quantitative Structure-Activity Relationship, Activity Prediction, and Molecular Dynamics of Non-nucleotide Reverse Transcriptase Inhibitors

Published on: May 9, 2025

2.7K

Area of Science:

  • Computational chemistry
  • Bioinformatics
  • Optimization algorithms

Background:

  • Molecular docking is a critical optimization problem, typically addressed with single-objective functions focused on minimum binding energy.
  • Existing literature lacks comprehensive comparisons of multi-objective approaches for molecular docking.
  • There is a need to evaluate diverse multi-objective algorithms for their performance in complex molecular docking scenarios.

Purpose of the Study:

  • To compare, for the first time, a suite of representative multi-objective optimization algorithms applied to molecular docking.
  • To evaluate algorithms based on optimizing both intermolecular and intramolecular energies.
  • To assess the performance of these algorithms against a reference mono-objective method.

Main Methods:

  • Application of multiple multi-objective optimization algorithms: NSGA-II variants, SMPSO, GDE3, MOEA/D, and SMS-EMOA.
  • Optimization focused on minimizing intermolecular and intramolecular energies simultaneously.
  • Performance assessment using quality indicators for convergence and diversity of Pareto fronts.
  • Comparison with the Lamarckian Genetic Algorithm (LGA) from AutoDock.

Main Results:

  • Multi-objective approaches demonstrated promising results in analyzing ligand binding sites and molecular interactions.
  • Computed solutions showed favorable convergence and diversity compared to the mono-objective baseline.
  • A case study on aeroplysinin-1 highlighted the effectiveness of the multi-objective strategy in drug discovery.

Conclusions:

  • Multi-objective optimization presents a powerful paradigm for tackling complex molecular docking problems.
  • The compared algorithms show potential for advancing drug discovery through improved identification of molecular interactions.
  • This study provides a foundational comparison for selecting appropriate multi-objective algorithms in computational chemistry.