Human Intersectin 2 (ITSN2) binds to Eps8 protein and enhances its degradation

Participates in actin remodeling through Rac and receptor endocytosis via Rab5. Here, we used yeast two-hybrid system with Eps8 as bait to screen a human brain cDNA library. ITSN2 was identified as the novel binding factor of Eps8. The interaction between ITSN2 and Eps8 was demonstrated by the in vivo co-immunoprecipitation and colocalization assays and the in vitro GST pull-down assays. Furthermore, we mapped the interaction domains to the region between amino acids 260-306 of Eps8 and the coiled-coil domain of ITSN2. In addition, protein stability assays and immunofluorescence analysis showed ITSN2 overexpression induced the degradation of Eps8 proteins, which was markedly alleviated with the lysosome inhibitor NH4Cl treatment. Taken together, our results suggested ITSN2 interacts with Eps8 and stimulates the degradation of Eps8 proteins. [BMB reports 2012; 45(3): 183-188].     

Comparative interactomics analysis of protein family interaction networks using PSIMAP (protein structural interactome map)

MOTIVATION: Many genomes have been completely sequenced. However, detecting and analyzing their protein-protein interactions by experimental methods such as co-immunoprecipitation, tandem affinity purification and Y2H is not as fast as genome sequencing. Therefore, a computational prediction method based on the known protein structural interactions will be useful to analyze large-scale protein-protein interaction rules within and among complete genomes. RESULTS: We confirmed that all the predicted protein family interactomes (the full set of protein family interactions within a proteome) of 146 species are scale-free networks, and they share a small core network comprising 36 protein families related to indispensable cellular functions. We found two fundamental differences among prokaryotic and eukaryotic interactomes: (1) eukarya had significantly more hub families than archaea and bacteria and (2) certain special hub families determined the topology of the eukaryotic interactomes. Our comparative analysis suggests that a very small number of expansive protein families led to the evolution of interactomes and seemed to have played a key role in species diversification. SUPPLEMENTARY INFORMATION: http://interactomics.org.     

Global protein function prediction from protein-protein interaction networks

Determining protein function is one of the most challenging problems of the post-genomic era. The availability of entire genome sequences and of high-throughput capabilities to determine gene coexpression patterns has shifted the research focus from the study of single proteins or small complexes to that of the entire proteome. In this context, the search for reliable methods for assigning protein function is of primary importance. There are various approaches available for deducing the function of proteins of unknown function using information derived from sequence similarity or clustering patterns of co-regulated genes, phylogenetic profiles, protein-protein interactions (refs. 5-8 and Samanta, M.P. and Liang, S., unpublished data), and protein complexes. Here we propose the assignment of proteins to functional classes on the basis of their network of physical interactions as determined by minimizing the number of protein interactions among different functional categories. Function assignment is proteome-wide and is determined by the global connectivity pattern of the protein network. The approach results in multiple functional assignments, a consequence of the existence of multiple equivalent solutions. We apply the method to analyze the yeast Saccharomyces cerevisiae protein-protein interaction network. The robustness of the approach is tested in a system containing a high percentage of unclassified proteins and also in cases of deletion and insertion of specific protein interactions.     

The function of communities in protein interaction networks at multiple scales

Background  

If biology is modular then clusters, or communities, of proteins derived using only protein interaction network structure should define protein modules with similar biological roles. We investigate the link between biological modules and network communities in yeast and its relationship to the scale at which we probe the network.     

Inferring protein function by domain context similarities in protein-protein interaction networks

Background  

Genome sequencing projects generate massive amounts of sequence data but there are still many proteins whose functions remain unknown. The availability of large scale protein-protein interaction data sets makes it possible to develop new function prediction methods based on protein-protein interaction (PPI) networks. Although several existing methods combine multiple information resources, there is no study that integrates protein domain information and PPI networks to predict protein functions.     

An automated method for finding molecular complexes in large protein interaction networks

Background  

Recent advances in proteomics technologies such as two-hybrid, phage display and mass spectrometry have enabled us to create a detailed map of biomolecular interaction networks. Initial mapping efforts have already produced a wealth of data. As the size of the interaction set increases, databases and computational methods will be required to store, visualize and analyze the information in order to effectively aid in knowledge discovery.     

The commonality of protein interaction networks determined in neurodegenerative disorders (NDDs)

MOTIVATION: Neurodegenerative disorders (NDDs) are progressive and fatal disorders, which are commonly characterized by the intracellular or extracellular presence of abnormal protein aggregates. The identification and verification of proteins interacting with causative gene products are effective ways to understand their physiological and pathological functions. The objective of this research is to better understand common molecular pathogenic mechanisms in NDDs by employing protein-protein interaction networks, the domain characteristics commonly identified in NDDs and correlation among NDDs based on domain information. RESULTS: By reviewing published literatures in PubMed, we created pathway maps in Kyoto Encyclopedia of Genes and Genomes (KEGG) for the protein-protein interactions in six NDDs: Alzheimer's disease (AD), Parkinson's disease (PD), amyotrophic lateral sclerosis (ALS), Huntington's disease (HD), dentatorubral-pallidoluysian atrophy (DRPLA) and prion disease (PRION). We also collected data on 201 interacting proteins and 13 compounds with 282 interactions from the literature. We found 19 proteins common to these six NDDs. These common proteins were mainly involved in the apoptosis and MAPK signaling pathways. We expanded the interaction network by adding protein interaction data from the Human Protein Reference Database and gene expression data from the Human Gene Expression Index Database. We then carried out domain analysis on the extended network and found the characteristic domains, such as 14-3-3 protein, phosphotyrosine interaction domain and caspase domain, for the common proteins. Moreover, we found a relatively high correlation between AD, PD, HD and PRION, but not ALS or DRPLA, in terms of the protein domain distributions. AVAILABILITY: http://www.genome.jp/kegg/pathway/hsa/hsa01510.html (KEGG pathway maps for NDDs).     

Understanding gene essentiality by finely characterizing hubs in the yeast protein interaction network

The centrality-lethality rule, i.e., high-degree proteins or hubs tend to be more essential than low-degree proteins in the yeast protein interaction network, reveals that a protein’s central position indicates its important function, but whether and why hubs tend to be more essential have been heavily debated. Here, we integrated gene expression and functional module data to classify hubs into four types: non-co-expressed non-co-cluster hubs, non-co-expressed co-cluster hubs, co-expressed non-co-cluster hubs and co-expressed co-cluster hubs. We found that all the four hub types are more essential than non-hubs, but they also show different enrichments in essential proteins. Non-co-expressed non-co-cluster hubs play key role in organizing different modules formed by the other three hub types, but they are less important to the survival of the yeast cell. Among the four hub types, co-expressed co-cluster hubs, which likely correspond to the core components of stable protein complexes, are the most essential. These results demonstrated that our classification of hubs into four types could better improve the understanding of gene essentiality.     

Identification and classification of hubs in brain networks

Brain regions in the mammalian cerebral cortex are linked by a complex network of fiber bundles. These inter-regional networks have previously been analyzed in terms of their node degree, structural motif, path length and clustering coefficient distributions. In this paper we focus on the identification and classification of hub regions, which are thought to play pivotal roles in the coordination of information flow. We identify hubs and characterize their network contributions by examining motif fingerprints and centrality indices for all regions within the cerebral cortices of both the cat and the macaque. Motif fingerprints capture the statistics of local connection patterns, while measures of centrality identify regions that lie on many of the shortest paths between parts of the network. Within both cat and macaque networks, we find that a combination of degree, motif participation, betweenness centrality and closeness centrality allows for reliable identification of hub regions, many of which have previously been functionally classified as polysensory or multimodal. We then classify hubs as either provincial (intra-cluster) hubs or connector (inter-cluster) hubs, and proceed to show that lesioning hubs of each type from the network produces opposite effects on the small-world index. Our study presents an approach to the identification and classification of putative hub regions in brain networks on the basis of multiple network attributes and charts potential links between the structural embedding of such regions and their functional roles.     

Network compression as a quality measure for protein interaction networks

With the advent of large-scale protein interaction studies, there is much debate about data quality. Can different noise levels in the measurements be assessed by analyzing network structure? Because proteomic regulation is inherently co-operative, modular and redundant, it is inherently compressible when represented as a network. Here we propose that network compression can be used to compare false positive and false negative noise levels in protein interaction networks. We validate this hypothesis by first confirming the detrimental effect of false positives and false negatives. Second, we show that gold standard networks are more compressible. Third, we show that compressibility correlates with co-expression, co-localization, and shared function. Fourth, we also observe correlation with better protein tagging methods, physiological expression in contrast to over-expression of tagged proteins, and smart pooling approaches for yeast two-hybrid screens. Overall, this new measure is a proxy for both sensitivity and specificity and gives complementary information to standard measures such as average degree and clustering coefficients.     

Bioinformatics of large-scale protein interaction networks

We survey recent techniques for construction and prediction of large-scale protein interaction networks, focusing on computational processing steps. Special emphasis is placed on critical assessment of data completeness and reliability of the various approaches. Once built, protein interaction networks can be used for functional annotation or to generate higher-level biological hypotheses on pathways.     

Modular organization of protein interaction networks

MOTIVATION: Accumulating evidence suggests that biological systems are composed of interacting, separable, functional modules. Identifying these modules is essential to understand the organization of biological systems. RESULT: In this paper, we present a framework to identify modules within biological networks. In this approach, the concept of degree is extended from the single vertex to the sub-graph, and a formal definition of module in a network is used. A new agglomerative algorithm was developed to identify modules from the network by combining the new module definition with the relative edge order generated by the Girvan-Newman (G-N) algorithm. A JAVA program, MoNet, was developed to implement the algorithm. Applying MoNet to the yeast core protein interaction network from the database of interacting proteins (DIP) identified 86 simple modules with sizes larger than three proteins. The modules obtained are significantly enriched in proteins with related biological process Gene Ontology terms. A comparison between the MoNet modules and modules defined by Radicchi et al. (2004) indicates that MoNet modules show stronger co-clustering of related genes and are more robust to ties in betweenness values. Further, the MoNet output retains the adjacent relationships between modules and allows the construction of an interaction web of modules providing insight regarding the relationships between different functional modules. Thus, MoNet provides an objective approach to understand the organization and interactions of biological processes in cellular systems. AVAILABILITY: MoNet is available upon request from the authors.     

Comparative analysis of protein interaction networks

Recent advances in proteomics and computational biology have lead to a flood of protein interaction data and resulting interaction networks (e.g. (Gavin et al., 2002)). Here I first analyse the status and quality of parts lists (genes and proteins), then comparatively assess large-scale protein interaction data (von Mering et al., 2002) and finally try to identify biological meaningful units (e.g. pathways, cellular processes) within interaction networks that are derived from the conservation of gene neighborhood (Snel et al., 2002). Possible extensions of gene neighborhood analysis to eukaryotes (von Mering and Bork, 2002) will be discussed.     

Modular organization of protein interaction networks

Bioinformatics (2007) 23(2),     

Complexity management in visualizing protein interaction networks

MOTIVATION: Protein-protein interaction networks often consist of thousands of nodes or more. This severely limits the utility of many graph drawing tools because they become too slow for an interactive analysis of the networks and because they produce cluttered drawings with many edge crossings. RESULTS: A new layout algorithm with complexity management operations in visualizing a large-scale protein interaction network was developed and implemented in a program called InterViewer3. InterViewer3 simplifies a complex network by collapsing a group of nodes with the same interacting partners into a composite node and by replacing a clique with a star-shaped subgraph. The experimental results demonstrated that InterViewer3 is one order of magnitude faster than the other drawing programs and that its complexity management is successful.