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

Efficient algorithms for detecting signaling pathways in protein interaction networks.

Jacob Scott1, Trey Ideker, Richard M Karp

  • 1Computer Science Division, University of California, Berkeley, 94720, USA.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|April 7, 2006
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

Multifactorial sheltering in peristromal niches shapes in vivo responses of lung cancers to targeted therapies.

Nature communications·2026
Same author

An optimization framework for hierarchical clustering.

Bioinformatics advances·2026
Same author

CLO26-123: Genomic Adjusted Radiation Dose (GARD) Predicts Optimal Radiation Dose for Overall Survival in Triple-Negative Breast Cancer.

Journal of the National Comprehensive Cancer Network : JNCCN·2026
Same author

YIA26-001: Collateral Sensitivities Emerge During the Evolution of Chemoresistance to Map Chemotherapy in Osteosarcoma.

Journal of the National Comprehensive Cancer Network : JNCCN·2026
Same author

CLO26-123: Genomic Adjusted Radiation Dose (GARD) Predicts Optimal Radiation Dose for Overall Survival in Triple-Negative Breast Cancer.

Journal of the National Comprehensive Cancer Network : JNCCN·2026
Same author

YIA26-001: Collateral Sensitivities Emerge During the Evolution of Chemoresistance to Map Chemotherapy in Osteosarcoma.

Journal of the National Comprehensive Cancer Network : JNCCN·2026
Same journal

Mosquito Species and Gender Identification System Based on Artificial Intelligence and Image Processing Methods.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

Identifying significant substructures in large protein networks is crucial. This study introduces efficient algorithms to find protein pathways, reconstructing known pathways and discovering new ones in yeast networks.

Area of Science:

  • Computational biology
  • Bioinformatics
  • Systems biology

Background:

  • Interpreting large-scale protein network data requires identifying significant substructures.
  • This process is computationally intensive.
  • Existing methods for graph analysis are not optimized for biological networks.

Purpose of the Study:

  • To adapt and extend efficient graph algorithms for finding paths and trees.
  • To apply these algorithms to identify pathways in protein interaction networks.
  • To develop linear-time algorithms for finding paths and trees under biological constraints.

Main Methods:

  • Adaptation and extension of graph algorithms for path and tree finding.
  • Development of linear-time algorithms for biological network analysis.

Related Experiment Videos

  • Application to the yeast protein-protein interaction network.

    • Main Results:

    • Successful reconstruction of known signaling pathways.
    • Identification of functionally enriched paths and trees in an unsupervised manner.
    • Demonstrated efficiency: paths of length 8 computed in minutes, length 10 in hours.

    Conclusions:

    • The developed methodology efficiently identifies significant substructures in protein networks.
    • The algorithm enables unsupervised discovery of biologically relevant pathways.
    • This approach significantly advances the analysis of large-scale protein interaction data.