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 complex prediction via improved verification methods using constrained domain-domain matching.

Yang Zhao1, Morihiro Hayashida, Jose C Nacher

  • 1Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto, Japan. tyoyo@kuicr.kyoto-u.ac.jp

International Journal of Bioinformatics Research and Applications
|September 11, 2012
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

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

This study introduces an improved integer programming method for identifying protein complexes in protein-protein interaction networks, outperforming previous approaches. The new method enhances accuracy by ensuring candidate complexes remain cohesive, a crucial step in functional genomics.

Area of Science:

  • Computational Biology
  • Functional Genomics
  • Bioinformatics

Background:

  • Identifying protein complexes is vital for understanding cellular functions within protein-protein interaction networks.
  • Previous methods, like Ozawa et al.'s, utilized structural constraints but could be improved.

Purpose of the Study:

  • To develop an enhanced integer programming-based method for verifying protein complexes.
  • To improve the accuracy and robustness of protein complex identification in biological networks.

Main Methods:

  • An integer programming approach was refined by incorporating principles to prevent the fragmentation of candidate complexes.
  • Combination methods utilizing maximal components and extreme sets were integrated.
  • The computational complexity of protein complex verification problems was proven to be NP-hard.

Related Experiment Videos

Main Results:

  • The proposed methods demonstrated superior performance compared to the existing method by Ozawa et al. in computational experiments.
  • The integer programming approach effectively addresses the complexity of protein complex identification.

Conclusions:

  • The developed integer programming-based method offers a more effective solution for protein complex verification.
  • The NP-hard nature of the problem justifies the use of advanced computational techniques like integer programming.