For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
85
views
18
references
 Top references
cited by
160
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      242
      similar
       All similar
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      PINA v2.0: mining interactome modules

      research-article

      Read this article at

      ScienceOpenPublisherPMC
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The Protein Interaction Network Analysis (PINA) platform is a comprehensive web resource, which includes a database of unified protein–protein interaction data integrated from six manually curated public databases, and a set of built-in tools for network construction, filtering, analysis and visualization. The second version of PINA enhances its utility for studies of protein interactions at a network level, by including multiple collections of interaction modules identified by different clustering approaches from the whole network of protein interactions (‘interactome’) for six model organisms. All identified modules are fully annotated by enriched Gene Ontology terms, KEGG pathways, Pfam domains and the chemical and genetic perturbations collection from MSigDB. Moreover, a new tool is provided for module enrichment analysis in addition to simple query function. The interactome data are also available on the web site for further bioinformatics analysis. PINA is freely accessible at http://cbg.garvan.unsw.edu.au/pina/.

          Related collections

          Most cited references18

          • Record: found
          • Abstract: found
          • Article: not found

          Gene Ontology: tool for the unification of biology

          Michael Ashburner, Catherine A. Ball, Judith Blake … (2002)
          Genomic sequencing has made it clear that a large fraction of the genes specifying the core biological functions are shared by all eukaryotes. Knowledge of the biological role of such shared proteins in one organism can often be transferred to other organisms. The goal of the Gene Ontology Consortium is to produce a dynamic, controlled vocabulary that can be applied to all eukaryotes even as knowledge of gene and protein roles in cells is accumulating and changing. To this end, three independent ontologies accessible on the World-Wide Web (http://www.geneontology.org) are being constructed: biological process, molecular function and cellular component.
          Article 0 comments Cited 15210 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: found
            • Article: found
            Is Open Access

            The BioGRID Interaction Database: 2011 update

            Chris Stark, Bobby-Joe Breitkreutz, Andrew Chatr-aryamontri … (2010)
            The Biological General Repository for Interaction Datasets (BioGRID) is a public database that archives and disseminates genetic and protein interaction data from model organisms and humans (http://www.thebiogrid.org). BioGRID currently holds 347 966 interactions (170 162 genetic, 177 804 protein) curated from both high-throughput data sets and individual focused studies, as derived from over 23 000 publications in the primary literature. Complete coverage of the entire literature is maintained for budding yeast (Saccharomyces cerevisiae), fission yeast (Schizosaccharomyces pombe) and thale cress (Arabidopsis thaliana), and efforts to expand curation across multiple metazoan species are underway. The BioGRID houses 48 831 human protein interactions that have been curated from 10 247 publications. Current curation drives are focused on particular areas of biology to enable insights into conserved networks and pathways that are relevant to human health. The BioGRID 3.0 web interface contains new search and display features that enable rapid queries across multiple data types and sources. An automated Interaction Management System (IMS) is used to prioritize, coordinate and track curation across international sites and projects. BioGRID provides interaction data to several model organism databases, resources such as Entrez-Gene and other interaction meta-databases. The entire BioGRID 3.0 data collection may be downloaded in multiple file formats, including PSI MI XML. Source code for BioGRID 3.0 is freely available without any restrictions.
            Article 0 comments Cited 342 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Evaluation of clustering algorithms for protein-protein interaction networks

              Sylvain Brohée, Jacques van Helden (2006)
              Background Protein interactions are crucial components of all cellular processes. Recently, high-throughput methods have been developed to obtain a global description of the interactome (the whole network of protein interactions for a given organism). In 2002, the yeast interactome was estimated to contain up to 80,000 potential interactions. This estimate is based on the integration of data sets obtained by various methods (mass spectrometry, two-hybrid methods, genetic studies). High-throughput methods are known, however, to yield a non-negligible rate of false positives, and to miss a fraction of existing interactions. The interactome can be represented as a graph where nodes correspond with proteins and edges with pairwise interactions. In recent years clustering methods have been developed and applied in order to extract relevant modules from such graphs. These algorithms require the specification of parameters that may drastically affect the results. In this paper we present a comparative assessment of four algorithms: Markov Clustering (MCL), Restricted Neighborhood Search Clustering (RNSC), Super Paramagnetic Clustering (SPC), and Molecular Complex Detection (MCODE). Results A test graph was built on the basis of 220 complexes annotated in the MIPS database. To evaluate the robustness to false positives and false negatives, we derived 41 altered graphs by randomly removing edges from or adding edges to the test graph in various proportions. Each clustering algorithm was applied to these graphs with various parameter settings, and the clusters were compared with the annotated complexes. We analyzed the sensitivity of the algorithms to the parameters and determined their optimal parameter values. We also evaluated their robustness to alterations of the test graph. We then applied the four algorithms to six graphs obtained from high-throughput experiments and compared the resulting clusters with the annotated complexes. Conclusion This analysis shows that MCL is remarkably robust to graph alterations. In the tests of robustness, RNSC is more sensitive to edge deletion but less sensitive to the use of suboptimal parameter values. The other two algorithms are clearly weaker under most conditions. The analysis of high-throughput data supports the superiority of MCL for the extraction of complexes from interaction networks.
              Article 0 comments Cited 283 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and article information

                Journal
                Journal ID (nlm-ta): Nucleic Acids Res
                Journal ID (publisher-id): nar
                Journal ID (hwp): nar
                Title: Nucleic Acids Research
                Publisher: Oxford University Press
                ISSN (Print): 0305-1048
                ISSN (Electronic): 1362-4962
                Publication date Collection: January 2012
                Publication date (Print): January 2012
                Publication date (Electronic): 8 November 2011
                Publication date PMC-release: 8 November 2011
                Volume: 40
                Issue: D1 , Database issue
                Pages: D862-D865
                Affiliations
                1Cancer Research Program, 2Peter Wills Bioinformatics Centre, Garvan Institute of Medical Research, Darlinghurst, Sydney NSW 2010, 3Queensland Centre for Medical Genomics, Institute for Molecular Bioscience, The University of Queensland, Brisbane QLD 4072, Australia and 4Genome-Scale Biology Program, Institute of Biomedicine, University of Helsinki, Helsinki 00014, Finland
                Author notes
                *To whom correspondence should be addressed. Tel: +61 2 9295 8326; Fax: +61 2 9295 8321; Email: j.wu@ 123456garvan.org.au
                Article
                Publisher ID: gkr967
                DOI: 10.1093/nar/gkr967
                PMC ID: 3244997
                PubMed ID: 22067443
                SO-VID: 0a1e4b94-7a1a-4708-ba50-97dcf24e5f00
                Copyright © © The Author(s) 2011. Published by Oxford University Press.
                License:

                This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License ( http://creativecommons.org/licenses/by-nc/3.0), which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

                History
                Date received : 15 August 2011
                Date revision received : 10 October 2011
                Date accepted : 16 October 2011
                Page count
                Pages: 4
                Categories
                Subject: Articles

                ScienceOpen disciplines: Genetics
                Data availability:
                ScienceOpen disciplines: Genetics

                Comments

                Comment on this article

                scite_

                Similar content242

                See all similar

                Cited by151

                See all cited by

                Most referenced authors1,455

                See all reference authors