東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Implementation of a dynamic programm...

Wang, Bin.

FindBook

Google Book

Amazon

博客來

Implementation of a dynamic programming algorithm for DNA sequence alignment on the Cell Matrix(TM) architecture.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Implementation of a dynamic programming algorithm for DNA sequence alignment on the Cell Matrix(TM) architecture./
作者:	Wang, Bin.
面頁冊數:	37 p.
附註:	Source: Masters Abstracts International, Volume: 40-05, page: 1263.
Contained By:	Masters Abstracts International40-05.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1408277
ISBN:	0493565515

Implementation of a dynamic programming algorithm for DNA sequence alignment on the Cell Matrix(TM) architecture.
Wang, Bin.

Implementation of a dynamic programming algorithm for DNA sequence alignment on the Cell Matrix(TM) architecture. - 37 p.

Source: Masters Abstracts International, Volume: 40-05, page: 1263.

Thesis (M.S.)--Utah State University, 2002.

DNA sequence alignment is an important tool for modern molecular biology. The algorithm used by most sequence alignment tools is the dynamic programming algorithm introduced by Needleman and Wunsch in 1970. This algorithm has a time complexity of O(n<super>2</super>), where n is the length of the input sequence. This dynamic programming algorithm has been implemented on a new parallel computing architecture called Cell Matrix™. The approach taken in this work was to configure a block of Cell Matrix cells as a custom processor to perform the comparison and scoring function in the dynamic programming algorithm. The custom processors were then configured into a 2D array that closely matched the dynamic programming algorithm and allowed them to function in parallel. For an appropriately large Cell Matrix, the implementation in this thesis achieves a time complexity of O(n) in finding the optimal alignment score for two DNA sequences.

ISBN: 0493565515Subjects--Topical Terms:

626642
Computer Science.

Implementation of a dynamic programming algorithm for DNA sequence alignment on the Cell Matrix(TM) architecture.
LDR:01855nmm 2200277 4500 001 1810504
005 20040311141527.5
008 130610s2002 eng d
020 $a 0493565515
035 $a (UnM)AAI1408277
035 $a AAI1408277
040 $a UnM $c UnM
100 1 $a Wang, Bin. $3 1900114
245 1 0 $a Implementation of a dynamic programming algorithm for DNA sequence alignment on the Cell Matrix(TM) architecture.
300 $a 37 p.
500 $a Source: Masters Abstracts International, Volume: 40-05, page: 1263.
500 $a Major Professor: Donald H. Cooley.
502 $a Thesis (M.S.)--Utah State University, 2002.
520 $a DNA sequence alignment is an important tool for modern molecular biology. The algorithm used by most sequence alignment tools is the dynamic programming algorithm introduced by Needleman and Wunsch in 1970. This algorithm has a time complexity of O(n<super>2</super>), where n is the length of the input sequence. This dynamic programming algorithm has been implemented on a new parallel computing architecture called Cell Matrix™. The approach taken in this work was to configure a block of Cell Matrix cells as a custom processor to perform the comparison and scoring function in the dynamic programming algorithm. The custom processors were then configured into a 2D array that closely matched the dynamic programming algorithm and allowed them to function in parallel. For an appropriately large Cell Matrix, the implementation in this thesis achieves a time complexity of O(n) in finding the optimal alignment score for two DNA sequences.
590 $a School code: 0241.
650 4 $a Computer Science. $3 626642
650 4 $a Biology, Molecular. $3 1017719
690 $a 0984
690 $a 0307
710 2 0 $a Utah State University. $3 960049
773 0 $t Masters Abstracts International $g 40-05.
790 1 0 $a Cooley, Donald H., $e advisor
790 $a 0241
791 $a M.S.
792 $a 2002
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1408277