• Genomics & Informatics
• /
• v.1 no.1
• /
• pp.7-19
• /
• 2003

The latest measure of the relative evolutionary age of protein structure families was applied (based on taxonomic diversity) using the protein structural interactome map (PSIMAP). It confirms that, in general, protein domains, which are hubs in this interaction network, are older than protein domains with fewer interaction partners. We apply a hypothesis of 'biological network evolution' to explain the positive correlation between interaction and age. It agrees to the previous suggestions that proteins have acquired an increasing number of interaction partners over time via the stepwise addition of new interactions. This hypothesis is shown to be consistent with the scale-free interaction network topologies proposed by other groups. Closely co-evolved structural interaction and the dynamics of network evolution are used to explain the highly conserved core of protein interaction pathways, which exist across all divisions of life.

• The Journal of the Korea Contents Association
• /
• v.9 no.5
• /
• pp.332-336
• /
• 2009

Functional prediction of unannotated proteins is one of the most important tasks in yeast genomics. Analysis of a protein-protein interaction network leads to a better understanding of the functions of unannotated proteins. A number of researches have been performed for the functional prediction of unannotated proteins from a protein-protein interaction network. A chi-square method is one of the existing methods for the functional prediction of unannotated proteins from a protein-protein interaction network. But, the method does not consider the topology of network. In this paper, we propose a novel method that is able to predict specific molecular functions for unannotated proteins from a protein-protein interaction network. To do this, we investigated all protein interaction DBs of yeast in the public sites such as MIPS, DIP, and SGD. For the prediction of unannotated proteins, we employed a modified chi-square measure based on neighborhood counting and we assess the prediction accuracy of protein function from a protein-protein interaction network.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2002.06a
• /
• pp.5-23
• /
• 2002

Motivation: Protein-protein interaction plays a critical role in the biological processes. The identification of interacting proteins by bioinformatical methods can provide new lead In the functional studies of uncharacterized proteins without performing extensive experiments. Results: Protein-protein interactions are predicted by a computational algorithm based on the weighted scoring system for domain interactions between interacting protein pairs. Here we propose potential interaction domain (PID) pairs can be extracted from a data set of experimentally identified interacting protein pairs. where one protein contains a domain and its interacting protein contains the other. Every combinations of PID are summarized in a matrix table termed the PID matrix, and this matrix has proposed to be used for prediction of interactions. The database of interacting proteins (DIP) has used as a source of interacting protein pairs and InterPro, an integrated database of protein families, domains and functional sites, has used for defining domains in interacting pairs. A statistical scoring system. named "PID matrix score" has designed and applied as a measure of interaction probability between domains. Cross-validation has been performed with subsets of DIP data to evaluate the prediction accuracy of PID matrix. The prediction system gives about 50% of sensitivity and 98% of specificity, Based on the PID matrix, we develop a system providing several interaction information-finding services in the Internet. The system, named PreDIN (Prediction-oriented Database of Interaction Network) provides interacting domain finding services and interacting protein finding services. It is demonstrated that mapping of the genome-wide interaction network can be achieved by using the PreDIN system. This system can be also used as a new tool for functional prediction of unknown proteins.

• Genomics & Informatics
• /
• v.5 no.3
• /
• pp.133-136
• /
• 2007

The Gene Set network viewer (GSnet) visualizes the functional enrichment of a given gene set with a protein interaction network and is implemented as a plug-in for the Cytoscape platform. The functional enrichment of a given gene set is calculated using a hypergeometric test based on the Gene Ontology annotation. The protein interaction network is estimated using public data. Set operations allow a complex protein interaction network to be decomposed into a functionally-enriched module of interest. GSnet provides a new framework for gene set analysis by integrating a priori knowledge of a biological network with functional enrichment analysis.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.13
• /
• pp.5325-5330
• /
• 2014

Background: Chronic myelocytic leukemia is a disease that threatens both adults and children. Great progress has been achieved in treatment but protein-protein interaction networks underlining chronic myelocytic leukemia are less known. Objective: To develop a protein-protein interaction network for chronic myelocytic leukemia based on gene expression and to predict biological pathways underlying molecular complexes in the network. Materials and Methods: Genes involved in chronic myelocytic leukemia were selected from OMIM database. Literature mining was performed by Agilent Literature Search plugin and a protein-protein interaction network of chronic myelocytic leukemia was established by Cytoscape. The molecular complexes in the network were detected by Clusterviz plugin and pathway enrichment of molecular complexes were performed by DAVID online. Results and Discussion: There are seventy-nine chronic myelocytic leukemia genes in the Mendelian Inheritance In Man Database. The protein-protein interaction network of chronic myelocytic leukemia contained 638 nodes, 1830 edges and perhaps 5 molecular complexes. Among them, complex 1 is involved in pathways that are related to cytokine secretion, cytokine-receptor binding, cytokine receptor signaling, while complex 3 is related to biological behavior of tumors which can provide the bioinformatic foundation for further understanding the mechanisms of chronic myelocytic leukemia.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.265-271
• /
• 2004

The interaction network of protein -protein plays an important role to understand the various biological functions of cells. Currently, the high -throughput experimental techniques (two -dimensional gel electrophoresis, mass spectroscopy, yeast two -hybrid assay) provide us with the vast amount of data for protein-protein interaction at the proteome scale. In order to recognize the role of each protein in their network, the efficient bioinformatical and computational analysis methods are required. We propose a systematic and mathematical method which can analyze the protein -protein interaction network rigorously and enable us to capture the biological and physical essence of a topological character and stability of protein -protein network, and sensitivity of each protein along the biological pathway of their network. We set up a Laplacian matrix of spectral graph theory based on the protein-protein network of yeast proteome, and perform an eigenvalue analysis and apply a perturbation method on a Laplacian matrix, which result in recognizing the center of protein cluster, the identity of hub proteins around it and their relative sensitivities. Identifying the topology of protein -protein network via a Laplacian matrix, we can recognize the important relation between the biological pathway of yeast proteome and the formalism of master equation. The results of our systematic and mathematical analysis agree well with the experimental findings of yeast proteome. The biological function and meaning of each protein cluster can be explained easily. Our rigorous analysis method is robust for understanding various kinds of networks whether they are biological, social, economical...etc

• The Journal of the Korea Contents Association
• /
• v.9 no.4
• /
• pp.114-120
• /
• 2009

In this study, we employed the idea that disease-related proteins tend to be work as an important factor for architecture of the disease network. We initially obtained 43 atopy-related proteins from the Online Mendelian Inheritance in Man (OMIM) and then constructed atopy-related protein interaction network. The protein network can be derived the map of the relationship between different disease proteins, denoted disease interaction network. We demonstrate that the associations between diseases are directly correlated to their underlying protein-protein interaction networks. From constructed the disease-protein bipartite network, we derived three diseasomal proteins, CCR5, CCL11, and IL/4R. Although we use the relatively small subnetwork, an atopy-related disease network, it is sufficient that the discovery of protein interaction networks assigned by diseases will provide insight into the underlying molecular mechanisms and biological processes in complex human disease system.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.259-271
• /
• 2008

We propose a protein function finding algorithm that is able to predict specific molecular function for unannotated proteins through domain analysis from protein-protein network. To do this, we first construct protein-protein interaction(PPI) network in Saccharomyces cerevisiae from MIPS databases. The PPI network(proteins; 3,637, interactions; 10,391) shows the characteristics of a scale-free network and a hierarchical network that proteins with a number of interactions occur in small and the inherent modularity of protein clusters. Protein-protein interaction databases obtained from a Y2H(Yeast Two Hybrid) screen or a composite data set include random false positives. To filter the database, we reconstruct the PPI networks based on the cellular localization. And then we analyze Hub proteins and the network structure in the reconstructed network and define structural modules from the network. We analyze protein domains from the structural modules and derive functional modules from them. From the derived functional modules with high certainty, we find tentative functions for unannotated proteins.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.74-81
• /
• 2008

Protein interaction network contains a small number of highly connected protein, denoted hub and many destitutely connected proteins. Recently, several studies described that a hub protein is more likely to be essential than a non-hub protein. This phenomenon called as a centrality-lethality rule. This nile is widely credited to exhibit the importance of hub proteins in the complex network and the significance of network architecture as well. To confirm whether the rule is accurate, we Investigated all protein interaction DBs of yeast in the public sites such as Uetz, Ito, MIPS, DIP, SGB, and BioGRID. Interestingly, the protein network shows that the rule is correct in lower scale DBs (e.g., Uetz, Ito, and DIP) but is not correct in higher scale DBs (e.g., SGD and BioGRID). We are now analyzing the features of networks obtained from the SGD and BioGRD and comparing those of network from the DIP.

• The KIPS Transactions:PartB
• /
• v.13B no.1 s.104
• /
• pp.1-6
• /
• 2006

The prediction of protein function basically make use of a protein-protein interaction map based on the concept of guilt-by-association. The method however cannot determine the functions of proteins in case that the target protein does not interact with proteins with known functions directly. This paper studies protein function prediction considering the given problem as a K-class classification problem and proposes a predictive approach utilizing a modular neural network. The proposed method uses interaction data and protein related attributes as well. The experimental results demonstrate that the proposed approach can predict the functional roles of Yeast proteins whose interaction knowledge is not known and shows better performance than the graph-based models that use protein interaction data.