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 Experiment Videos

Effective optimization algorithms for fragment-assembly based protein structure prediction.

Kevin W DeRonne1, George Karypis

  • 1Department of Computer Science & Engineering, Digital Technology Center, Army HPC Research Center, University of Minnesota, Minneapolis, MN 55455, USA. deronne@cs.umn.edu

Computational Systems Bioinformatics. Computational Systems Bioinformatics Conference
|March 21, 2007
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

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

Sort by
Same author

PropMolFlow: property-guided molecule generation with geometry-complete flow matching.

Nature computational science·2026
Same author

TraverseNet: Unifying Space and Time in Message Passing for Traffic Forecasting.

IEEE transactions on neural networks and learning systems·2022
Same author

A knowledge graph of clinical trials ([Formula: see text]).

Scientific reports·2022
Same author

Benchmarking Accuracy and Generalizability of Four Graph Neural Networks Using Large In Vitro ADME Datasets from Different Chemical Spaces.

Molecular informatics·2022
Same author

DGL-LifeSci: An Open-Source Toolkit for Deep Learning on Graphs in Life Science.

ACS omega·2021
Same author

Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning.

IEEE transactions on neural networks and learning systems·2021

Deterministic algorithms like Hill-climbing offer improved protein structure prediction by optimizing scoring functions. These methods outperform traditional stochastic techniques, enhancing the accuracy of new fold prediction and reducing root mean squared deviation (RMSD).

Area of Science:

  • Computational biology
  • Structural bioinformatics
  • Biophysics

Background:

  • Accurate protein structure prediction is crucial for understanding biological function.
  • Current methods struggle with the vast conformational space of protein sequences.
  • Stochastic optimization techniques like Simulated Annealing are traditionally used.

Purpose of the Study:

  • To investigate deterministic algorithms for optimizing scoring functions in protein structure prediction.
  • To evaluate the efficacy of the Greedy and Hill-climbing algorithms for new fold prediction.
  • To compare these deterministic methods against traditional stochastic approaches.

Main Methods:

  • Application of the Greedy algorithm, a deterministic optimization technique.

Related Experiment Videos

  • Implementation of the Hill-climbing algorithm, incorporating local minima escape.
  • Comparative analysis using Simulated Annealing on a dataset of 276 proteins.

    • Main Results:

    • Hill-climbing algorithms demonstrated superior performance in optimizing scoring functions.
    • Consistent outperformance of Hill-climbing over Simulated Annealing in minimizing root mean squared deviation (RMSD).
    • Deterministic approaches showed promise in navigating the complex protein structure space.

    Conclusions:

    • Deterministic algorithms, particularly Hill-climbing, present a viable and effective alternative for protein new fold prediction.
    • These methods offer improved accuracy in optimizing protein structures compared to existing stochastic techniques.
    • Further development of deterministic optimization strategies could advance the field of structural bioinformatics.