Protein domain annotation with predicted domain-domain interaction networks

This paper presents a framework for annotating protein domains with predicted domain-domain interaction networks. Specially, domain annotation is formalized as a multi-class classification problem in this work. The numerical experiments on InterPro domains show promising results, which proves the efficiency of our proposed methods.     

Metagenomic annotation networks: construction and applications

The derivation and comparison of biological interaction networks are vital for understanding the functional capacity and hierarchical organization of integrated microbial communities. In the current work we present metagenomic annotation networks as a novel taxonomy-free approach for understanding the functional architecture of metagenomes. Specifically, metagenomic operon predictions are exploited to derive functional interactions that are translated and categorized according to their associated functional annotations. The result is a collection of discrete networks of weighted annotation linkages. These networks are subsequently examined for the occurrence of annotation modules that portray the functional and organizational characteristics of various microbial communities. A variety of network perspectives and annotation categories are applied to recover a diverse range of modules with different degrees of annotative cohesiveness. Applications to biocatalyst discovery and human health issues are discussed, as well as the limitations of the current implementation.     

Enhanced functional information from predicted protein networks

Experimentally derived genome-wide protein interaction networks have been useful in the elucidation of functional information that is not evident from examining individual proteins but determination of these networks is complex and time consuming. To address this problem, several computational methods for predicting protein networks in novel genomes have been developed. A recent publication by Date and Marcotte describes the use of phylogenetic profiling for elucidating novel pathways in proteomes that have not been experimentally characterized. This method, in combination with other computational methods for generating protein-interaction networks, might help identify novel functional pathways and enhance functional annotation of individual proteins.     

Ontological visualization of protein-protein interactions

Background  

Cellular processes require the interaction of many proteins across several cellular compartments. Determining the collective network of such interactions is an important aspect of understanding the role and regulation of individual proteins. The Gene Ontology (GO) is used by model organism databases and other bioinformatics resources to provide functional annotation of proteins. The annotation process provides a mechanism to document the binding of one protein with another. We have constructed protein interaction networks for mouse proteins utilizing the information encoded in the GO annotations. The work reported here presents a methodology for integrating and visualizing information on protein-protein interactions.     

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.     

An explanation of contextual modulation by short-range isotropic connections and orientation map geometry in the primary visual cortex

Recent experimental studies on the primary visual cortex have revealed complicated nonclassical neuronal activities. Contextual modulation on orientation-contrast is one typical example of nonclassical neuronal behavior. This modulation by surrounding stimuli in a nonclassical receptive field is mainly thought to be mediated by short- and long-range horizontal connections within the primary visual cortex. Short-range connections are circularly symmetrical and relatively independent of orientation preferences, while long-range connections are patchy, asymmetrical, and orientation specific. Although this modulation can be explained by long-range specific connections qualitatively, recent studies suggest that long-range connections alone may be insufficient with respect to the balance between two types of connections. Here, in order to clarify the role of short-range connections in the process of contextual modulation, we propose a model of the primary visual cortex with isotropic short-range connections and a geometric orientation map. Computational simulations using the model have demonstrated that contextual modulation can be explained by short-range connections alone. This is due to the interaction between the spatial periodicity of orientation domains and the excitatory-inhibitory regions arising from the propagation of activities.Acknowledgement We gratefully acknowledge useful conversations with Hiromichi, Sato. The present work was partly supported by Grant-in-Aid for Scientific Research on Priority Areas (C) Advanced Brain Science Project from the Japanese Ministry of Education, Science, Sports, and Culture.     

DIG--a system for gene annotation and functional discovery

SUMMARY: We describe a database and information discovery system named DIG (Duke Integrated Genomics) designed to facilitate the process of gene annotation and the discovery of functional context. The DIG system collects and organizes gene annotation and functional information, and includes tools that support an understanding of genes in a functional context by providing a framework for integrating and visualizing gene expression, protein interaction and literature-based interaction networks.     

A classification scoring schema to validate protein interactors

Hypothetical protein [HP] annotation poses a great challenge especially when the protein is putatively linked or mapped to another protein. With protein interaction networks (PIN) prevailing, many visualizers still remain unsupported to the HP annotation. Through this work, we propose a six-point classification system to validate protein interactions based on diverse features. The HP data-set was used as a training data-set to find putative functional interaction partners to the remaining proteins that are waiting to be interacting. A Total Reliability Score (TRS) was calculated based on the six-point classification which was evaluated using machine learning algorithm on a single node. We found that multilayer perceptron of neural network yielded 81.08% of accuracy in modelling TRS whereas feature selection algorithms confirmed that all classification features are implementable. Furthermore statistical results using variance and co-variance analyses confirmed the usefulness of these classification metrics. It has been evaluated that of all the classification features, subcellular location (sorting signals) makes higher impact in predicting the function of HPs.     

Discovering functional interaction patterns in protein-protein interaction networks

Background  

In recent years, a considerable amount of research effort has been directed to the analysis of biological networks with the availability of genome-scale networks of genes and/or proteins of an increasing number of organisms. A protein-protein interaction (PPI) network is a particular biological network which represents physical interactions between pairs of proteins of an organism. Major research on PPI networks has focused on understanding the topological organization of PPI networks, evolution of PPI networks and identification of conserved subnetworks across different species, discovery of modules of interaction, use of PPI networks for functional annotation of uncharacterized proteins, and improvement of the accuracy of currently available networks.     

Comparison of topological clustering within protein networks using edge metrics that evaluate full sequence,full structure,and active site microenvironment similarity

The development of accurate protein function annotation methods has emerged as a major unsolved biological problem. Protein similarity networks, one approach to function annotation via annotation transfer, group proteins into similarity-based clusters. An underlying assumption is that the edge metric used to identify such clusters correlates with functional information. In this contribution, this assumption is evaluated by observing topologies in similarity networks using three different edge metrics: sequence (BLAST), structure (TM-Align), and active site similarity (active site profiling, implemented in DASP). Network topologies for four well-studied protein superfamilies (enolase, peroxiredoxin (Prx), glutathione transferase (GST), and crotonase) were compared with curated functional hierarchies and structure. As expected, network topology differs, depending on edge metric; comparison of topologies provides valuable information on structure/function relationships. Subnetworks based on active site similarity correlate with known functional hierarchies at a single edge threshold more often than sequence- or structure-based networks. Sequence- and structure-based networks are useful for identifying sequence and domain similarities and differences; therefore, it is important to consider the clustering goal before deciding appropriate edge metric. Further, conserved active site residues identified in enolase and GST active site subnetworks correspond with published functionally important residues. Extension of this analysis yields predictions of functionally determinant residues for GST subgroups. These results support the hypothesis that active site similarity-based networks reveal clusters that share functional details and lay the foundation for capturing functionally relevant hierarchies using an approach that is both automatable and can deliver greater precision in function annotation than current similarity-based methods.     

A domain level interaction network of amyloid precursor protein and Aβ of Alzheimer's disease

The primary constituent of the amyloid plaque, β‐amyloid (Aβ), is thought to be the causal “toxic moiety” of Alzheimer's disease. However, despite much work focused on both Aβ and its parent protein, amyloid precursor protein (APP), the functional roles of APP and its cleavage products remain to be fully elucidated. Protein–protein interaction networks can provide insight into protein function, however, high‐throughput data often report false positives and are in frequent disagreement with low‐throughput experiments. Moreover, the complexity of the CNS is likely to be under represented in such databases. Therefore, we curated the published work characterizing both APP and Aβ to create a protein interaction network of APP and its proteolytic cleavage products, with annotation, where possible, to the level of APP binding domain and isoform. This is the first time that an interactome has been refined to domain level, essential for the interpretation of APP due to the presence of multiple isoforms and processed fragments. Gene ontology and network analysis were used to identify potentially novel functional relationships among interacting proteins.     

Functional evaluation of domain-domain interactions and human protein interaction networks

MOTIVATION: Large amounts of protein and domain interaction data are being produced by experimental high-throughput techniques and computational approaches. To gain insight into the value of the provided data, we used our new similarity measure based on the Gene Ontology (GO) to evaluate the molecular functions and biological processes of interacting proteins or domains. The applied measure particularly addresses the frequent annotation of proteins or domains with multiple GO terms. RESULTS: Using our similarity measure, we compare predicted domain-domain and human protein-protein interactions with experimentally derived interactions. The results show that our similarity measure is of significant benefit in quality assessment and confidence ranking of domain and protein networks. We also derive useful confidence score thresholds for dividing domain interaction predictions into subsets of low and high confidence. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.     

Genome-scale microbial in silico models: the constraints-based approach

Genome sequencing and annotation has enabled the reconstruction of genome-scale metabolic networks. The phenotypic functions that these networks allow for can be defined and studied using constraints-based models and in silico simulation. Several useful predictions have been obtained from such in silico models, including substrate preference, consequences of gene deletions, optimal growth patterns, outcomes of adaptive evolution and shifts in expression profiles. The success rate of these predictions is typically in the order of 70-90% depending on the organism studied and the type of prediction being made. These results are useful as a basis for iterative model building and for several practical applications.     

A computational model of a class of gene networks with positive and negative controls

This article proposes a computational framework for modelling the logical behavior of a class of gene networks. We characterize the basic behavior of genes in terms of a state-and-transition structure, and model the individual genes as language-generating automata. We consider positive and negative controls as the interaction mechanisms among the genes, and treat such controls as constraints (also expressed in automata) imposed on the behavior of the gene network. By computing the intersection of the languages generated by the gene models and the constraints, we obtain the complete set of pathways in a gene network. Implications and possible improvement of this work are discussed.     

Design and implementation of three incoherent feed-forward motif based biological concentration sensors

Synthetic biology is a useful tool to investigate the dynamics of small biological networks and to assess our capacity to predict their behavior from computational models. In this work we report the construction of three different synthetic networks in Escherichia coli based upon the incoherent feed-forward loop architecture. The steady state behavior of the networks was investigated experimentally and computationally under different mutational regimes in a population based assay. Our data shows that the three incoherent feed-forward networks, using three different macromolecular inhibitory elements, reproduce the behavior predicted from our computational model. We also demonstrate that specific biological motifs can be designed to generate similar behavior using different components. In addition we show how it is possible to tune the behavior of the networks in a predicable manner by applying suitable mutations to the inhibitory elements. Brian Aufderheide provided material support.     

Functional annotation from predicted protein interaction networks

MOTIVATION: Progress in large-scale experimental determination of protein-protein interaction networks for several organisms has resulted in innovative methods of functional inference based on network connectivity. However, the amount of effort and resources required for the elucidation of experimental protein interaction networks is prohibitive. Previously we, and others, have developed techniques to predict protein interactions for novel genomes using computational methods and data generated from other genomes. RESULTS: We evaluated the performance of a network-based functional annotation method that makes use of our predicted protein interaction networks. We show that this approach performs equally well on experimentally derived and predicted interaction networks, for both manually and computationally assigned annotations. We applied the method to predicted protein interaction networks for over 50 organisms from all domains of life, providing annotations for many previously unannotated proteins and verifying existing low-confidence annotations. AVAILABILITY: Functional predictions for over 50 organisms are available at http://bioverse.compbio.washington.edu and datasets used for analysis at http://data.compbio.washington.edu/misc/downloads/nannotation_data/. SUPPLEMENTARY INFORMATION: A supplemental appendix gives additional details not in the main text. (http://data.compbio.washington.edu/misc/downloads/nannotation_data/supplement.pdf).     

Bioverse: Functional,structural and contextual annotation of proteins and proteomes

Functional annotation is routinely performed for large-scale genomics projects and databases. Researchers working on more specific problems, for instance on an individual pathway or complex, also need to be able to quickly, completely and accurately annotate sequences. The Bioverse sequence annotation server (http://bioverse.compbio.washington.edu) provides a web-based interface to allow users to submit protein sequences to the Bioverse framework. Sequences are functionally and structurally annotated and potential contextual annotations are provided. Researchers can also submit candidate genomes for annotation of all proteins encoded by the genome (proteome).