3
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Graph-Based Community Detection for Decoy Selection in Template-Free Protein Structure Prediction

      research-article

      Read this article at

      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

          Significant efforts in wet and dry laboratories are devoted to resolving molecular structures. In particular, computational methods can now compute thousands of tertiary structures that populate the structure space of a protein molecule of interest. These advances are now allowing us to turn our attention to analysis methodologies that are able to organize the computed structures in order to highlight functionally relevant structural states. In this paper, we propose a methodology that leverages community detection methods, designed originally to detect communities in social networks, to organize computationally probed protein structure spaces. We report a principled comparison of such methods along several metrics on proteins of diverse folds and lengths. We present a rigorous evaluation in the context of decoy selection in template-free protein structure prediction. The results make the case that network-based community detection methods warrant further investigation to advance analysis of protein structure spaces for automated selection of functionally relevant structures.

          Related collections

          Most cited references28

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

          ROSETTA3: an object-oriented software suite for the simulation and design of macromolecules.

          We have recently completed a full re-architecturing of the ROSETTA molecular modeling program, generalizing and expanding its existing functionality. The new architecture enables the rapid prototyping of novel protocols by providing easy-to-use interfaces to powerful tools for molecular modeling. The source code of this rearchitecturing has been released as ROSETTA3 and is freely available for academic use. At the time of its release, it contained 470,000 lines of code. Counting currently unpublished protocols at the time of this writing, the source includes 1,285,000 lines. Its rapid growth is a testament to its ease of use. This chapter describes the requirements for our new architecture, justifies the design decisions, sketches out central classes, and highlights a few of the common tasks that the new software can perform. © 2011 Elsevier Inc. All rights reserved.
            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Finding community structure in networks using the eigenvectors of matrices.

            We consider the problem of detecting communities or modules in networks, groups of vertices with a higher-than-average density of edges connecting them. Previous work indicates that a robust approach to this problem is the maximization of the benefit function known as "modularity" over possible divisions of a network. Here we show that this maximization process can be written in terms of the eigenspectrum of a matrix we call the modularity matrix, which plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations. This result leads us to a number of possible algorithms for detecting community structure, as well as several other results, including a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong. The algorithms and measures proposed are illustrated with applications to a variety of real-world complex networks.
              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Ab initio protein structure assembly using continuous structure fragments and optimized knowledge-based force field.

              Ab initio protein folding is one of the major unsolved problems in computational biology owing to the difficulties in force field design and conformational search. We developed a novel program, QUARK, for template-free protein structure prediction. Query sequences are first broken into fragments of 1-20 residues where multiple fragment structures are retrieved at each position from unrelated experimental structures. Full-length structure models are then assembled from fragments using replica-exchange Monte Carlo simulations, which are guided by a composite knowledge-based force field. A number of novel energy terms and Monte Carlo movements are introduced and the particular contributions to enhancing the efficiency of both force field and search engine are analyzed in detail. QUARK prediction procedure is depicted and tested on the structure modeling of 145 nonhomologous proteins. Although no global templates are used and all fragments from experimental structures with template modeling score >0.5 are excluded, QUARK can successfully construct 3D models of correct folds in one-third cases of short proteins up to 100 residues. In the ninth community-wide Critical Assessment of protein Structure Prediction experiment, QUARK server outperformed the second and third best servers by 18 and 47% based on the cumulative Z-score of global distance test-total scores in the FM category. Although ab initio protein folding remains a significant challenge, these data demonstrate new progress toward the solution of the most important problem in the field. Copyright © 2012 Wiley Periodicals, Inc.
                Bookmark

                Author and article information

                Journal
                Molecules
                Molecules
                molecules
                Molecules
                MDPI
                1420-3049
                28 February 2019
                March 2019
                : 24
                : 5
                : 854
                Affiliations
                [1 ]Department of Computer Science, George Mason University, Fairfax, VA 22030, USA; kkabir@ 123456gmu.edu (K.L.K.); lhassan1@ 123456gmu.edu (L.H.); nakhter3@ 123456gmu.edu (N.A.)
                [2 ]Department of Information Sciences and Technology, George Mason University, Fairfax, VA 22030, USA; zrajabi@ 123456gmu.edu
                [3 ]Department of Bioengineering, George Mason University, Fairfax, VA 22030, USA
                [4 ]School of Systems Biology, George Mason University, Fairfax, VA 22030, USA
                Author notes
                [* ]Correspondence: amarda@ 123456gmu.edu ; Tel.: +1-703-993-4135
                [†]

                Current address: 4400 University Drive, MS 4A5, Fairfax, VA 22030, USA.

                Author information
                https://orcid.org/0000-0003-4021-6618
                Article
                molecules-24-00854
                10.3390/molecules24050854
                6429114
                30823390
                6a1f6f7f-f395-4e21-b6b5-7658fad5237c
                © 2019 by the authors.

                Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license ( http://creativecommons.org/licenses/by/4.0/).

                History
                : 13 January 2019
                : 22 February 2019
                Categories
                Article

                protein structure space,nearest-neighbor graph,community detection,decoy selection,template-free protein structure prediction

                Comments

                Comment on this article