Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Biomedical Engineering / 醫學工程學系
  4. Discovery of Recurrent Structural Motifs for Approximating Three-Dimensional Protein Structures
 
  • Details

Discovery of Recurrent Structural Motifs for Approximating Three-Dimensional Protein Structures

Resource
Journal of the Chinese Chemical Society 51: 1107-1114
Journal
Journal of the Chinese Chemical Society
Pages
1107-1114
Date Issued
2004
Date
2004
Author(s)
Soong, Ta-Tsen
Hwang, Ming-Jing
Chen, Chung-Ming  
DOI
10.1002/jccs.200400164
URI
http://ntur.lib.ntu.edu.tw//handle/246246/132707
https://www.scopus.com/inward/record.uri?eid=2-s2.0-33746057791&doi=10.1002%2fjccs.200400164&partnerID=40&md5=eb0562cbbdcfddb8335cba4c75b3ab1f
Abstract
The scope of conformation space that protein molecules can adopt is a problem of significant interest. Previous studies by other groups have shown that there are stereochemical constraints that confine local protein structures to a limited range of conformations. Furthermore, the results of many groups have demonstrated that the sequence-to-structure relationship remains detectable to some extent on a local level. By studying the conformational space of local protein structures, we may obtain more information concerning the constraints on local structural space and the sequence-to-structure mapping, hence facilitate ab initio structure prediction. In this study, we propose a novel algorithm that automatically discovers recurrent pentamer structures in proteins. The algorithm starts by applying Expectation-Maximization (EM) clustering to the distances between non-adjacent backbone Cα atoms in a large set of pentamer fragments. A rough partition of the conformation space can thus be derived. In the second stage, by applying a split-and-merge algorithm, we can obtain a finite number of clusters and guarantee the homogeneity and distinctiveness of each one. Each cluster of protein structures is represented by a centroid structure. The results show that, with 40 major representative structures, we can approximate most of the protein fragments with an error of 0.378 Å. With only 20 types of structures, the fragment structures can still be modeled at 0.44 Å, which is comparable to or better than the performance of previous methods. We term the representatives "building blocks." On the global level, we demonstrate that by concatenating different combinations of building blocks, we can model whole protein structures at high resolution: a resolution of 2.54 Å can be achieved simply by using 10 types of building blocks. This finding suggests that the study of molecular structures can be hugely simplified using this reduced representation.
Subjects
Clustering; Expectation-Maximization (EM); Local structural alphabets; Protein structure prediction; Structural approximation
Type
journal article
File(s)
Loading...
Thumbnail Image
Name

15.pdf

Size

527.34 KB

Format

Adobe PDF

Checksum

(MD5):a5ff78ff14e487ac747be10f73808c1c

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science