東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Analysis and applications of conserv...

Ie, Tze Way Eugene.

FindBook

Google Book

Amazon

博客來

Analysis and applications of conserved sequence patterns in proteins.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Analysis and applications of conserved sequence patterns in proteins./
作者:	Ie, Tze Way Eugene.
面頁冊數:	118 p.
附註:	Source: Dissertation Abstracts International, Volume: 68-04, Section: B, page: 2446.
Contained By:	Dissertation Abstracts International68-04B.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3264605
ISBN:	9780549015796

Analysis and applications of conserved sequence patterns in proteins.
Ie, Tze Way Eugene.

Analysis and applications of conserved sequence patterns in proteins. - 118 p.

Source: Dissertation Abstracts International, Volume: 68-04, Section: B, page: 2446.

Thesis (Ph.D.)--University of California, San Diego, 2007.

Modern sequencing initiatives have uncovered a large number of protein sequence data. The exponential growth of these databases are not matched by the rate at which we are annotating them. Reliable structural and functional annotations for protein sequences are limited, and computational methods have been steadily developed to bridge this knowledge gap. This dissertation develops a number of computational techniques for analyzing protein and genomic sequences. They are based heavily on the use of statistics and modern machine learning algorithms.

ISBN: 9780549015796Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

Analysis and applications of conserved sequence patterns in proteins.
LDR:03357nmm 2200373 4500 001 1835891
005 20080107105545.5
008 130610s2007 eng d
020 $a 9780549015796
035 $a (UMI)AAI3264605
035 $a AAI3264605
040 $a UMI $c UMI
100 1 $a Ie, Tze Way Eugene. $3 1924511
245 1 0 $a Analysis and applications of conserved sequence patterns in proteins.
300 $a 118 p.
500 $a Source: Dissertation Abstracts International, Volume: 68-04, Section: B, page: 2446.
500 $a Adviser: Yoav Freund.
502 $a Thesis (Ph.D.)--University of California, San Diego, 2007.
520 $a Modern sequencing initiatives have uncovered a large number of protein sequence data. The exponential growth of these databases are not matched by the rate at which we are annotating them. Reliable structural and functional annotations for protein sequences are limited, and computational methods have been steadily developed to bridge this knowledge gap. This dissertation develops a number of computational techniques for analyzing protein and genomic sequences. They are based heavily on the use of statistics and modern machine learning algorithms.
520 $a First, we introduce an application of support vector machines and structured output codes for the problem of discriminating protein sequences into one of many protein structural groups. Although our method works with any type of base binary classifiers, we found that it works best when the base classifiers leverage unlabeled protein sequences. The need to quickly identify similar protein sequences motivates our next contribution, an indexed-based approach to protein search.
520 $a We develop a novel indexed-based framework to protein sequence search. The search index is based on robust statistical models of conserved sequence patterns. The user of our system can essentially plug in any existing protein motif libraries to increase the coverage of the index. Furthermore, the framework can systematically refine any bootstrapped profile patterns using large amounts of unannotated sequence data available today. We further supplement the system with a novel random projections-based algorithm for finding motifs that are prevalent across many protein sequences.
520 $a Finally, we outline a new computational problem of finding protein coding regions in microbial genome fragments. This is of particular interest to recent explorations in metagenomics where the microbial communities under scrutiny are increasingly complex. Highly complex metagenomes usually observe lower sequence redundancy for the same amount of sequencing, rendering fragment assembly as an infeasible pre-processing step. We develop a novel evidence integration approach for finding genes on metagenomics fragments requiring no fragment assembly.
590 $a School code: 0033.
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 California, San Diego. $b Computer Science and Engineering. $3 1018473
773 0 $t Dissertation Abstracts International $g 68-04B.
790 1 0 $a Freund, Yoav, $e advisor
790 1 0 $a Dasgupta, Sanjoy $e committee member
790 1 0 $a Elkan, Charles $e committee member
790 1 0 $a Gaasterland, Terry $e committee member
790 1 0 $a Papadopoulos, Philip $e committee member
790 1 0 $a Pevzner, Pavel $e committee member
790 $a 0033
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3264605