完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Tseng, Kuo-Tsung | |
| dc.contributor.author | Yang, Chang-Biau | |
| dc.contributor.author | Huang, Kuo-Si | |
| dc.contributor.author | Peng, Yung-Hsing | |
| dc.date.accessioned | 2009-08-23T04:42:43Z | |
| dc.date.accessioned | 2020-05-25T06:53:44Z | - |
| dc.date.available | 2009-08-23T04:42:43Z | |
| dc.date.available | 2020-05-25T06:53:44Z | - |
| dc.date.issued | 2007-02-01T02:44:17Z | |
| dc.date.submitted | 2006-12-04 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/3673 | - |
| dc.description.abstract | In this paper, we improve the idea of the near-optimal alignments. Though the near optimal alignments increase the possibility to find the correct alignment, too many of them may confuse the biologists. So we present the filter scheme for the near-optimal alignments. An easy method to trace the nearoptimal alignments and an algorithm to filter those alignments are proposed.1 The time complexity of our algorithm is O(dmn) in the worst case, where d is the maximum distance between the near-optimal alignments and the optimal alignment, and m, n are the lengths of the input sequences, respectively. | |
| dc.description.sponsorship | 元智大學,中壢市 | |
| dc.format.extent | 6p. | |
| dc.format.extent | 365394 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2006 ICS會議 | |
| dc.subject | computational biology | |
| dc.subject | longest common subsequence | |
| dc.subject | biosequence alignment | |
| dc.subject | near-optimal alignments | |
| dc.subject.other | Computational Algorithm | |
| dc.title | Near-optimal Block Alignments | |
| 分類: | 2006年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002006000211.pdf | 356.83 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。