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

Heuristics01:21

Heuristics

908
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
908
Optimization Problems01:26

Optimization Problems

194
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
194
The Availability Heuristic01:08

The Availability Heuristic

7.3K
A heuristic is a general problem-solving framework (Tversky & Kahneman, 1974). You can think of these as mental shortcuts that are used to solve problems. Different types of heuristics are used in different types of situations, and the impulse to use a heuristic occurs when one of five conditions is met (Pratkanis, 1989):
7.3K
The Representativeness Heuristic02:13

The Representativeness Heuristic

17.1K
The representative heuristic describes a biased way of thinking, in which you unintentionally stereotype someone or something. For example, you may assume that your professors spend their free time reading books and engaging in intellectual conversation, because the idea of them spending their time playing volleyball or visiting an amusement park does not fit in with your stereotypes of professors.
17.1K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

411
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...
411
Problem-Solving01:29

Problem-Solving

666
Effective problem-solving consists of two steps: 1. identifying the problem and 2. selecting the appropriate problem-solving strategy (i.e., a plan of action used to find a solution). Humans use four problem-solving strategies:
666

You might also read

Related Articles

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

Sort by
Same author

Diet and temperature interactively impact brown adipose tissue gene regulation controlled by DNA methylation.

Molecular metabolism·2026
Same author

Associations between lifestyle, malnutrition, and health risks in a comprehensive population-based analysis.

Scientific reports·2025
Same author

Inhibition of adipocyte lipolysis by vaspin impairs thermoregulation in vivo.

Nature communications·2025
Same author

Sparse dictionary learning neural networks for ECG signal denoising.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2025
Same author

Explainable Spike Detection Algorithm on C-fiber Microneurography Data using Weighted Hermite Variable Projection Neural Networks.

Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference·2025
Same author

Replacement of chromosome 3D with Thinopyrum chromosome 3St led to increased drought tolerance during the flowering stage in wheat.

Plant cell reports·2025
Same journal

PSDTA: An Approach to Drug-Target Binding Affinity Prediction by Integrating Physicochemical and Structural Information to Reduce Feature Redundancy.

Journal of chemical information and modeling·2026
Same journal

M-JEPA: Predictive Self-Supervised Learning for Molecular Graphs with Scaffold-Shift Evaluation on Tox21.

Journal of chemical information and modeling·2026
Same journal

Advancing Biochemical Molecule Registration, Representation and Search for New Drug Modalities.

Journal of chemical information and modeling·2026
Same journal

A Unified Molecular Graph and Protein Language Model Framework for Predicting Human Drug-Hormone Receptor Interactions with Structure-Aware Validation.

Journal of chemical information and modeling·2026
Same journal

Intricate Role of Cholesterol in Membrane Fusion.

Journal of chemical information and modeling·2026
Same journal

tmGNN-XAI: An Explainable Graph Neural Network Tool for Predicting Electronic Properties of Transition Metal Complexes from SMILES.

Journal of chemical information and modeling·2026
See all related articles

Related Experiment Video

Updated: Apr 15, 2026

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids
08:21

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids

Published on: April 13, 2022

3.2K

Efficient heuristics for maximum common substructure search.

Péter Englert1, Péter Kovács2

  • 1†Department of Algorithms and Applications, Eötvös Loránd University, Budapest 1117, Hungary.

Journal of Chemical Information and Modeling
|April 14, 2015
PubMed
Summary
This summary is machine-generated.

Developing faster and more accurate maximum common substructure (MCS) algorithms is crucial for cheminformatics. New heuristics significantly enhance the efficiency and relevance of MCS search, improving applications like drug discovery.

More Related Videos

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.8K
Hierarchical and Programmable One-Pot Oligosaccharide Synthesis
09:56

Hierarchical and Programmable One-Pot Oligosaccharide Synthesis

Published on: September 6, 2019

7.3K

Related Experiment Videos

Last Updated: Apr 15, 2026

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids
08:21

Curation of Computational Chemical Libraries Demonstrated with Alpha-Amino Acids

Published on: April 13, 2022

3.2K
Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
12:11

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry

Published on: April 8, 2020

8.8K
Hierarchical and Programmable One-Pot Oligosaccharide Synthesis
09:56

Hierarchical and Programmable One-Pot Oligosaccharide Synthesis

Published on: September 6, 2019

7.3K

Area of Science:

  • Cheminformatics
  • Computational Chemistry
  • Bioinformatics

Background:

  • Maximum common substructure (MCS) search is vital for cheminformatics tasks like similarity searching and lead optimization.
  • Existing heuristic algorithms face challenges in balancing speed and accuracy for practical applications.
  • The quality of MCS depends on size and topological features of atom mappings.

Purpose of the Study:

  • To introduce novel heuristic methods for enhancing maximum common substructure (MCS) search algorithms.
  • To improve the efficiency and relevance of atom mappings in MCS.
  • To present experimental results comparing new implementations with existing solutions.

Main Methods:

  • Implementation of two state-of-the-art heuristic algorithms for MCS search.
  • Development of effective heuristics to optimize algorithm performance and atom mapping relevance.
  • Thorough evaluation and comparison against established methods like KCOMBU and Indigo.

Main Results:

  • The developed heuristics significantly improve the performance of MCS algorithms.
  • Enhanced efficiency and relevance of atom mappings were observed.
  • New implementations demonstrate superior applicability compared to existing solutions.

Conclusions:

  • The applied heuristic methods offer substantial improvements for maximum common substructure search.
  • These advancements address the need for faster and more accurate cheminformatics tools.
  • The findings are expected to benefit various applications, including drug discovery and molecular analysis.