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

Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach.

K C Dukka Bahadur1, Etsuji Tomita, Jun'ichi Suzuki

  • 1Graduate School of Informatics & Bioinformatics Center Kyoto University, Kyoto, 611-0001, Japan. dukka@kuicr.kyoto-u.ac.jp

Journal of Bioinformatics and Computational Biology
|March 8, 2005
PubMed
Summary

This study introduces a novel deterministic algorithm for protein side-chain packing, a computationally challenging problem in bioinformatics. The new method guarantees optimal solutions and shows improved efficiency and accuracy compared to existing approaches.

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

On the Number of Control Nodes in Boolean Networks With Degree Constraints.

IEEE transactions on cybernetics·2026
Same author

DiCleavePlus: A Transformer-Based Model to Detect Human Dicer Cleavage Sites Within Cleavage Patterns.

Genes to cells : devoted to molecular & cellular mechanisms·2025
Same author

Toward Environment-Sensitive Molecular Inference via Mixed Integer Linear Programming.

ACS omega·2025
Same author

Enhancing epidemic forecasting with a physics-informed spatial identity neural network.

PloS one·2025
Same author

Cycle-configuration descriptors: a novel graph-theoretic approach to enhancing molecular inference.

Journal of cheminformatics·2025
Same author

A dynamic programming algorithm for generating chemical isomers based on frequency vectors.

Scientific reports·2025

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Structural Biology

Background:

  • Protein side-chain packing is crucial for homology modeling, protein design, and docking.
  • The protein side-chain packing problem is computationally NP-hard, necessitating efficient algorithms.
  • Existing methods often rely on heuristic approaches, which may not guarantee optimal solutions.

Purpose of the Study:

  • To develop a novel, deterministic algorithm for solving the protein side-chain packing problem.
  • To improve the efficiency and accuracy of predicting side-chain conformations.
  • To provide a guaranteed optimal solution for protein side-chain packing.

Main Methods:

  • Reduction of the protein side-chain packing problem to a graph representation.

Related Experiment Videos

  • Application of a maximum edge-weight clique algorithm to the reduced graph.
  • Utilizing a deterministic algorithm for guaranteed optimal solution finding.

    • Main Results:

    • The novel approach successfully predicted side-chain conformations for a set of proteins.
    • Results were favorably comparable or superior to existing methods.
    • Significant improvements in efficiency and accuracy were observed, even for large proteins (up to 494 residues).

    Conclusions:

    • The developed maximum clique-based algorithm offers a deterministic and optimal solution for protein side-chain packing.
    • This approach enhances prediction accuracy and efficiency, particularly for larger protein structures.
    • The method holds promise for advancing various bioinformatics applications, including protein design and docking.