東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Towards protein function annotations...

University of Kansas., Electrical Engineering & Computer Science.

FindBook

Google Book

Amazon

博客來

Towards protein function annotations for matching remote homologs.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Towards protein function annotations for matching remote homologs./
作者:	Lei, Seak Fei.
面頁冊數:	105 p.
附註:	Adviser: Jun Huan.
Contained By:	Masters Abstracts International46-06.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1453964
ISBN:	9780549604037

Towards protein function annotations for matching remote homologs.
Lei, Seak Fei.

Towards protein function annotations for matching remote homologs. - 105 p.

Adviser: Jun Huan.

Thesis (M.S.)--University of Kansas, 2008.

Motivation. Identifying functional homologs from their protein structures is an important problem in biology. One way to approach this is to discover their common local structures (i.e. motif) among protein families. Unfortunately, most of the motif models are inadequate to characterize the structural diversities, especially when the proteins are distantly related. In this study, we first introduce a statistical model, together with a semi-supervised refinement method, to perform post-processing on the motif obtained from a motif discovery algorithm or from motif database. Our model makes use of Markov Random Fields (MRF), which provide a large search space to optimize the motif while preserving the dependencies among neighbor elements. The resulting model not only can better represent the underlying patterns for different protein families, but also can enable the power of functional annotation from a set of unknown proteins using probability approximations. In addition, we develop two filter approaches (three methods) to further eliminate the false positives introduced by any motif models. By considering the local environment around the active sites of each family, the filters reject proteins to match with the model without similar environment profiles.

ISBN: 9780549604037Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Towards protein function annotations for matching remote homologs.
LDR:02767nmm 2200313 a 45 001 886377
005 20101007
008 101007s2008 ||||||||||||||||| ||eng d
020 $a 9780549604037
035 $a (UMI)AAI1453964
035 $a AAI1453964
040 $a UMI $c UMI
100 1 $a Lei, Seak Fei. $3 1058069
245 1 0 $a Towards protein function annotations for matching remote homologs.
300 $a 105 p.
500 $a Adviser: Jun Huan.
500 $a Source: Masters Abstracts International, Volume: 46-06, page: 3315.
502 $a Thesis (M.S.)--University of Kansas, 2008.
520 $a Motivation. Identifying functional homologs from their protein structures is an important problem in biology. One way to approach this is to discover their common local structures (i.e. motif) among protein families. Unfortunately, most of the motif models are inadequate to characterize the structural diversities, especially when the proteins are distantly related. In this study, we first introduce a statistical model, together with a semi-supervised refinement method, to perform post-processing on the motif obtained from a motif discovery algorithm or from motif database. Our model makes use of Markov Random Fields (MRF), which provide a large search space to optimize the motif while preserving the dependencies among neighbor elements. The resulting model not only can better represent the underlying patterns for different protein families, but also can enable the power of functional annotation from a set of unknown proteins using probability approximations. In addition, we develop two filter approaches (three methods) to further eliminate the false positives introduced by any motif models. By considering the local environment around the active sites of each family, the filters reject proteins to match with the model without similar environment profiles.
520 $a Results. Our experimental results, as evaluated in five sets of enzyme families with less than 40% sequence identity, demonstrated that our methods can obtain more remote homologs that could not be detected by traditional sequence-based methods. At the same time, our method could reduce large amount of random matches which were originally introduced by the motif representations. On average, our methods could improve about 13% of the functional annotation ability (measured by their AUCs). In certain experiments, our improvement went even up to 70%.
590 $a School code: 0099.
650 4 $a Biology, Bioinformatics. $3 1018415
650 4 $a Computer Science. $3 626642
690 $a 0715
690 $a 0984
710 2 $a University of Kansas. $b Electrical Engineering & Computer Science. $3 1018713
773 0 $t Masters Abstracts International $g 46-06.
790 $a 0099
790 1 0 $a Agah, Arvin $e committee member
790 1 0 $a Chen, Xue-wen $e committee member
790 1 0 $a Huan, Jun, $e advisor
791 $a M.S.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1453964