國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Comparing and modeling protein struc...

Kolodny, Rachel.

Comparing and modeling protein structure.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Comparing and modeling protein structure.
作者:	Kolodny, Rachel.
面頁冊數:	120 p.
附註:	Advisers: Michael Levitt; Leonidas J. Guibas.
附註:	Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4668.
Contained By:	Dissertation Abstracts International65-09B.
標題:	Computer Science.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3145555
ISBN:	0496045067

Comparing and modeling protein structure.
Kolodny, Rachel.

Comparing and modeling protein structure. - 120 p.

Advisers: Michael Levitt; Leonidas J. Guibas.

Thesis (Ph.D.)--Stanford University, 2004.

In the second part, we present and use an efficient model of protein structure. Our model concatenates elements from libraries of commonly observed protein backbone fragments into structures that approximate protein well. There are no additional degrees of freedom so a string of fragment labels fully defines a three-dimensional structure; the set of all strings defines the set of structures (of a given length). By varying the size of the library and the length of its fragments, we generate structure sets of different resolution. With larger libraries, the approximations are better, but we get good fits to real proteins with less than five states per residue. We also describe uses for these libraries in protein structure prediction and loop modeling.

ISBN: 0496045067Subjects--Topical Terms:

212513
Computer Science.

Comparing and modeling protein structure.
LDR:03314nmm _2200301 _450 001 162885
005 20051017073533.5
008 090528s2004 eng d
020 $a 0496045067
035 $a 00149386
040 $a UnM $c UnM
100 0 $a Kolodny, Rachel. $3 228031
245 1 0 $a Comparing and modeling protein structure.
300 $a 120 p.
500 $a Advisers: Michael Levitt; Leonidas J. Guibas.
500 $a Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4668.
502 $a Thesis (Ph.D.)--Stanford University, 2004.
520 # $a In the second part, we present and use an efficient model of protein structure. Our model concatenates elements from libraries of commonly observed protein backbone fragments into structures that approximate protein well. There are no additional degrees of freedom so a string of fragment labels fully defines a three-dimensional structure; the set of all strings defines the set of structures (of a given length). By varying the size of the library and the length of its fragments, we generate structure sets of different resolution. With larger libraries, the approximations are better, but we get good fits to real proteins with less than five states per residue. We also describe uses for these libraries in protein structure prediction and loop modeling.
520 # $a Proteins are remarkably versatile macromolecules involved in essentially all biological processes. The detailed three-dimensional structure of a protein encodes its function. A fundamental computational challenge in the study of proteins is the comparison and modeling of protein structure. Structural similarities of proteins can hint at distant evolutionary relationships that are impossible to discern from protein sequences alone. Consequently structural comparison, or alignment, is an important tool for classifying known structures and analyzing their relationships. Efficient models are crucial for structure prediction; in particular, for the generation of decoy sets (ab initio protein folding) and loop conformations (homology modeling).
520 # $a The first part of this work focuses on protein structural alignment, namely, the comparison of two structures. We formalize this problem as the optimization of a geometric similarity score over the space of rigid body transformations. This leads to an approximate polynomial time alignment algorithm. Our result is theoretical, rather than practical: it proves that contrary to previous belief the problem is not NP-hard. We also present a large-scale comparison of six publicly available structural alignment heuristics and evaluate the quality of their solutions using several geometric measures. We find that our geometric measure can identify a good match, providing a method of analysis that augments the traditional use of ROC curves and their need for a classification gold standard.
590 $a School code: 0212.
650 # 0 $a Computer Science. $3 212513
650 # 0 $a Biophysics, General. $3 226901
690 $a 0786
690 $a 0984
710 0 # $a Stanford University. $3 212607
773 0 # $g 65-09B. $t Dissertation Abstracts International
790 $a 0212
790 1 0 $a Guibas, Leonidas J., $e advisor
790 1 0 $a Levitt, Michael, $e advisor
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://libsw.nuk.edu.tw:81/login?url=http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3145555 $z http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3145555