Related Experiment Video
Updated: Jun 25, 2026

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
Published on: October 19, 2021
Querying pathways in protein interaction networks based on hidden Markov models.
Xiaoning Qian1, Sing-Hoi Sze, Byung-Jun Yoon
1Department of Electrical & Computer Engineering, Texas A&M University, College Station, TX 77843-3128, USA.
This study introduces an efficient hidden Markov model (HMM) framework for identifying homologous pathways in protein interaction networks. The method accurately finds biologically significant paths, outperforming previous approaches in speed and accuracy.
Area of Science:
- Systems Biology
- Bioinformatics
- Computational Biology
Background:
- High-throughput protein interaction data allows systematic study of cellular networks.
- Comparing networks across organisms aids understanding of regulatory mechanisms.
- Identifying conserved pathways is crucial for functional insights.
Purpose of the Study:
- To develop an efficient computational framework for finding homologous pathways in biological networks.
- To enable accurate comparison of protein interaction networks across different species.
- To improve the identification of functionally conserved pathways.
Main Methods:
- Utilized hidden Markov models (HMMs) for pathway homology detection.
- Developed an algorithm to find top k matching paths with insertions/deletions.
- Achieved polynomial time complexity, linear with query size.
Main Results:
- Successfully identified biologically significant pathways in protein interaction networks (DIP database).
- Retrieved pathways showed higher similarity to curated pathways (KEGG database) than previous methods.
- Demonstrated efficient searching of long protein paths (>10 proteins) in minutes.
Conclusions:
- The HMM-based framework provides an efficient and accurate method for homologous pathway identification.
- The approach facilitates cross-species network comparisons and enhances understanding of cellular functions.
- The algorithm's polynomial complexity enables analysis of large-scale biological networks.
Related Concept Videos
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Protein-protein Interfaces
Protein-Protein Interfaces
Interactions Between Signaling Pathways
Convergence and divergence, and cross-talk between signaling pathways
Two distinct signaling pathways can converge on a single functional unit, which may either be a single protein or a complex of proteins. The response is either functionally distinct or synergistic between the two pathways but different from the response...
Protein Complexes with Interchangeable Parts
The SCF ubiquitin ligase is a protein complex of five individual proteins. This complex attaches ubiquitin to other target proteins to mark them for degradation. In order to...
