完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Wei, Hsin-Wen | |
| dc.contributor.author | Lu, Wan-Chen | |
| dc.contributor.author | Huang, Pei-Chi | |
| dc.contributor.author | Shih, Wei-Kuan | |
| dc.contributor.author | Kao, Ming-Yang | |
| dc.contributor.author | Hsu, Tsan-sheng | |
| dc.date.accessioned | 2009-08-23T04:51:03Z | |
| dc.date.accessioned | 2020-05-29T06:38:39Z | - |
| dc.date.available | 2009-08-23T04:51:03Z | |
| dc.date.available | 2020-05-29T06:38:39Z | - |
| dc.date.issued | 2008-07-21T02:07:43Z | |
| dc.date.submitted | 2007-11-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/10712 | - |
| dc.description.abstract | This paper investigates the problem of testing whether a set of code words satisfies certain biologically motivated Hamming distance constraints. The paper provides three general techniques to speed up the testing of the constraints, namely, the Enumeration, Table Lookup, and Encoding methods, with applications to the design of DNA words. | |
| dc.description.sponsorship | 亞洲大學資訊學院, 台中縣霧峰鄉 | |
| dc.format.extent | 12p. | |
| dc.relation.ispartofseries | 2007 NCS會議 | |
| dc.subject | Hamming distance constraints | |
| dc.subject | code word verification | |
| dc.subject | DNA verification | |
| dc.subject.other | Algorithms | |
| dc.title | Testing Whether a Set of Code Words Satisfies a Given Set of Constraints | |
| 分類: | 2007年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| CE07NCS002007000078.pdf | 227.33 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。