教師資料查詢 | 類別: 會議論文 | 教師: 呂明達 MING-DA LU (瀏覽個人網頁)

標題:A Comprehensive System for Identifying Internal Repeat Substructures of Proteins
學年98
學期2
發表日期2010/02/15
作品名稱A Comprehensive System for Identifying Internal Repeat Substructures of Proteins
作品名稱(其他語言)
著者Kao, Hua-ying; Shih, Tsang-huang; Pai, Tun-wen; Lu, Ming-da; Hsu, Hui-huang
作品所屬單位淡江大學資訊工程學系
出版者IEEE Computer Society
會議名稱
會議地點Krakow, Poland
摘要Repetitive substructures within a protein play an important role in understanding protein folding and stability, biological function, and genome evolution. About 25% of all proteins contain repeat structures for eukaryote species and most of them do not have the resolved structural information yet. Therefore, this study aimed to design a comprehensive system for identifying internal repeats either from a protein sequence or structural information. In this study, we have curated a set of internal repeat units as a benchmark dataset for performing both sequence and structural alignment with respect to the query sequence or structure. Except for the traditional BLAST algorithms on amino acid sequence or the optimal structural superposition approaches on structures, a novel method employing the predicted secondary structure element information for internal repeat identification was proposed. Sequences were firstly transformed into Length Encoded Secondary Structure (LESS) profiles and followed by autocorrelation analyses. From the primary experimental results, the developed Internal Repeat Identification System (IRIS) can successfully identify internal repeats from those known protein structures, and the web system is freely available at http://iris.cs.ntou.edu.tw/.
關鍵字Length Encoded Secondary Structure;internal repeat unit;secondary structure element;sequence alignment; solenoid;structure alignment
語言英文
收錄於
會議性質國際
校內研討會地點
研討會時間20100215~20100218
通訊作者
國別波蘭
公開徵稿Y
出版型式
出處Proceedings of the Fourth International Conference on Complex, Intelligent and Software Intensive Systems (CISIS 2010), pp.689-693
相關連結
Google+ 推薦功能,讓全世界都能看到您的推薦!