KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Computational Bioscience Research Center (CBRC)
Permanent link to this recordhttp://hdl.handle.net/10754/325469
MetadataShow full item record
AbstractBackground: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
CitationWang J, Bensmail H, Gao X (2012) Multiple graph regularized protein domain ranking. BMC Bioinformatics 13: 307. doi:10.1186/1471-2105-13-307.
PubMed Central IDPMC3583823
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
- Automatic classification of protein structures relying on similarities between alignments.
- Authors: Santini G, Soldano H, Pothier J
- Issue date: 2012 Sep 14
- ProClust: improved clustering of protein sequences with an extended graph-based approach.
- Authors: Pipenbacher P, Schliep A, Schneckener S, Schönhuth A, Schomburg D, Schrader R
- Issue date: 2002
- CGC: A Flexible and Robust Approach to Integrating Co-Regularized Multi-Domain Graph for Clustering.
- Authors: Cheng W, Guo Z, Zhang X, Wang W
- Issue date: 2016 Jul
- AliWABA: alignment on the web through an A-Bruijn approach.
- Authors: Jones NC, Zhi D, Raphael BJ
- Issue date: 2006 Jul 1
- Detection of distant structural similarities in a set of proteins using a fast graph-based method.
- Authors: Koch I, Lengauer T
- Issue date: 1997
Showing items related by title, author, creator and subject.
A multi-directional rapidly exploring random graph (mRRG) for protein foldingNath, Shuvra Kanti; Thomas, Shawna; Ekenna, Chinwe; Amato, Nancy M. (Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine - BCB '12, Association for Computing Machinery (ACM), 2012) [Conference Paper]Modeling large-scale protein motions, such as those involved in folding and binding interactions, is crucial to better understanding not only how proteins move and interact with other molecules but also how proteins misfold, thus causing many devastating diseases. Robotic motion planning algorithms, such as Rapidly Exploring Random Trees (RRTs), have been successful in simulating protein folding pathways. Here, we propose a new multi-directional Rapidly Exploring Random Graph (mRRG) specifically tailored for proteins. Unlike traditional RRGs which only expand a parent conformation in a single direction, our strategy expands the parent conformation in multiple directions to generate new samples. Resulting samples are connected to the parent conformation and its nearest neighbors. By leveraging multiple directions, mRRG can model the protein motion landscape with reduced computational time compared to several other robotics-based methods for small to moderate-sized proteins. Our results on several proteins agree with experimental hydrogen out-exchange, pulse-labeling, and F-value analysis. We also show that mRRG covers the conformation space better as compared to the other computation methods. Copyright © 2012 ACM.
A Review of Graph and Network Complexity from an Algorithmic Information PerspectiveZenil, Hector; Kiani, Narsis; Tegnér, Jesper (Entropy, MDPI AG, 2018-07-25) [Article]Information-theoretic-based measures have been useful in quantifying network complexity. Here we briefly survey and contrast (algorithmic) information-theoretic methods which have been used to characterize graphs and networks. We illustrate the strengths and limitations of Shannon’s entropy, lossless compressibility and algorithmic complexity when used to identify aspects and properties of complex networks. We review the fragility of computable measures on the one hand and the invariant properties of algorithmic measures on the other demonstrating how current approaches to algorithmic complexity are misguided and suffer of similar limitations than traditional statistical approaches such as Shannon entropy. Finally, we review some current definitions of algorithmic complexity which are used in analyzing labelled and unlabelled graphs. This analysis opens up several new opportunities to advance beyond traditional measures.