東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

An efficient method for searching co...

Wallace, Jeffrey B.

FindBook

Google Book

Amazon

博客來

An efficient method for searching compressed genomic databases.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	An efficient method for searching compressed genomic databases./
作者:	Wallace, Jeffrey B.
面頁冊數:	40 p.
附註:	Adviser: Gregory L. Vert.
Contained By:	Masters Abstracts International46-06.
標題:	Biology, Bioinformatics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1455652
ISBN:	9780549596462

An efficient method for searching compressed genomic databases.
Wallace, Jeffrey B.

An efficient method for searching compressed genomic databases. - 40 p.

Adviser: Gregory L. Vert.

Thesis (M.S.C.S.)--University of Nevada, Reno, 2008.

This thesis provides background information on existing tools for sequence alignment, presents details of our proposed method, evaluates the performance of our algorithm by comparing it with WND-BLAST, and outlines directions of future work.

ISBN: 9780549596462Subjects--Topical Terms:

1018415
Biology, Bioinformatics.

An efficient method for searching compressed genomic databases.
LDR:02265nam 2200301 a 45 001 940938
005 20110518
008 110518s2008 ||||||||||||||||| ||eng d
020 $a 9780549596462
035 $a (UMI)AAI1455652
035 $a AAI1455652
040 $a UMI $c UMI
100 1 $a Wallace, Jeffrey B. $3 1265074
245 1 3 $a An efficient method for searching compressed genomic databases.
300 $a 40 p.
500 $a Adviser: Gregory L. Vert.
500 $a Source: Masters Abstracts International, Volume: 46-06, page: 3326.
502 $a Thesis (M.S.C.S.)--University of Nevada, Reno, 2008.
520 $a This thesis provides background information on existing tools for sequence alignment, presents details of our proposed method, evaluates the performance of our algorithm by comparing it with WND-BLAST, and outlines directions of future work.
520 $a Searching for similarities between DNA sequences is a fundamental task for genomics researchers. This task is becoming increasingly difficult in the face of dramatic and sustained growth in the amount of genomic data being generated. In 2005, the genomic databases at the National Center for Biotechnology Information (NCBI) received approximately 50 million web hits per day, at peak rates of about 1,900 hits per second. As these databases become more popular, there is increased demand to make them faster and more efficient. This thesis proposes a method for compressing and searching selected genome databases using techniques appropriate for computers of virtually any size.
520 $a This search technique is expected to produce its best results with large search sequences against large DNA databases, and lends itself to parallel computation techniques with little communication overhead required. Because the compression algorithm uses a lossless binary encoding format, search results are exact---not approximate. Furthermore, searches take place on the compressed data, obviating the need for decompression prior to executing a search.
590 $a School code: 0139.
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 Nevada, Reno. $3 626634
773 0 $t Masters Abstracts International $g 46-06.
790 $a 0139
790 1 0 $a Vert, Gregory L., $e advisor
791 $a M.S.C.S.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1455652