Author:
Ashby Cody,Johnson Daniel,Walker Karl,Kanj Iyad A,Xia Ge,Huang Xiuzhen
Abstract
Abstract
Background
Protein structure comparison and classification is an effective method for exploring protein structure-function relations. This problem is computationally challenging. Many different computational approaches for protein structure comparison apply the secondary structure elements (SSEs) representation of protein structures.
Results
We study the complexity of the protein structure comparison problem based on a mixed-graph model with respect to different computational frameworks. We develop an effective approach for protein structure comparison based on a novel independent set enumeration algorithm. Our approach (named: ePC, e fficient e numeration-based P rotein structure C omparison) is tested for general purpose protein structure comparison as well as for specific protein examples. Compared with other graph-based approaches for protein structure comparison, the theoretical running-time O(1.47
rn
n
2) of our approach ePC is significantly better, where n is the smaller number of SSEs of the two proteins, r is a parameter of small value.
Conclusion
Through the enumeration algorithm, our approach can identify different substructures from a list of high-scoring solutions of biological interest. Our approach is flexible to conduct protein structure comparison with the SSEs in sequential and non-sequential order as well. Supplementary data of additional testing and the source of ePC will be available at http://bioinformatics.astate.edu/.
Publisher
Springer Science and Business Media LLC
Reference29 articles.
1. Holm L, Sander C: Protein structure comparison by alignment of distance matrices. J of Molecular Biology. 1993, 233: 123-138. 10.1006/jmbi.1993.1489.
2. Goldman D, Istrail S, Papadimitriou CH: Algorithmic Aspects of Protein Structure Similarity. FOCS. 1999, 512-522.
3. Song Y, Liu C, Huang X, Malmberg RL, Xu Y, Cai L: Efficient parameterized algorithms for biopolymer structuresequence alignment. IEEE/ACM Trans Comput Biology Bioinform. 2006, 3 (4): 423-432.
4. Chen J, Kanj I, Meng J, Xia G, Zhang F: On the effective enumerability of NP problems. Proceedings of the 2nd InternationalWorkshop on Parameterized and Exact Computation, volume 4169 of Lecture Notes in Computer Science. 2006, 215-226.
5. Zhang ZH, Bharatham K, Sherman WA, Mihalek I: deconSTRUCT: general purpose protein database search on the substructure level. Nucleic Acids Research. 2010, 38 (Web Server): W590-W594. 10.1093/nar/gkq489.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献