首页 | 本学科首页   官方微博 | 高级检索  
   检索      

FAMCS: Finding All Maximal Common Substructures in Proteins
作者姓名:Yao Z  Xiao J  Tung AK  Sung WK
作者单位:Department of Computer Science, National University of Singapore, Singapore 117543.
摘    要:Finding the common substructures shared by two proteins is considered as one of the central issues in computational biology because of its usefulness in understanding the structure-function relationship and application in drug and vaccine design. In this paper, we propose a novel algorithm called FAMCS (Finding All Maximal Common Substructures) for the common substructure identification problem. Our method works initially at the protein secondary structural element (SSE) level and starts with the identification of all structurally similar SSE pairs. These SSE pairs are then merged into sets using a modified Apriori algorithm, which will test the similarity of various sets of SSE pairs incrementally until all the maximal sets of SSE pairs that deemed to be similar are found. The maximal common substructures of the two proteins will be formed from these maximal sets. A refinement algorithm is also proposed to fine tune the alignment from the SSE level to the residue level. Comparison of FAMCS with other methods on various proteins shows that FAMCS can address all four requirements and infer interesting biological discoveries.

关 键 词:蛋白质  生物学  蛋白基础  药物研究  疫苗设计

FAMCS: finding all maximal common substructures in proteins
Yao Z,Xiao J,Tung AK,Sung WK.FAMCS: finding all maximal common substructures in proteins[J].Genomics Proteomics & Bioinformatics,2005,3(2):107-119.
Authors:Yao Zhen  Xiao Juan  Tung Anthony K H  Sung Wing Kin
Institution:Department of Computer Science, National University of Singapore. yaozhen@alumni.nus.edu.sg
Abstract:Finding the common substructures shared by two proteins is considered as one of the central issues in computational biology because of its usefulness in understanding the structure-function relationship and application in drug and vaccine design. In this paper, we propose a novel algorithm called FAMCS (Finding All Maximal Common Substructures) for the common substructure identification problem. Our method works initially at the protein secondary structural element (SSE) level and starts with the identification of all structurally similar SSE pairs. These SSE pairs are then merged into sets using a modified Apriori algorithm, which will test the similarity of various sets of SSE pairs incrementally until all the maximal sets of SSE pairs that deemed to be similar are found. The maximal common substructures of the two proteins will be formed from these maximal sets. A refinement algorithm is also proposed to fine tune the alignment from the SSE level to the residue level. Comparison of FAMCS with other methods on various proteins shows that FAMCS can address all four requirements and infer interesting biological discoveries.
Keywords:
本文献已被 维普 万方数据 PubMed 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号