完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Hsu, F. R. | |
dc.contributor.author | Sue, Shu Ying | |
dc.date.accessioned | 2009-08-23T04:42:39Z | |
dc.date.accessioned | 2020-05-25T06:53:22Z | - |
dc.date.available | 2009-08-23T04:42:39Z | |
dc.date.available | 2020-05-25T06:53:22Z | - |
dc.date.issued | 2007-02-01T03:03:30Z | |
dc.date.submitted | 2006-12-04 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/3676 | - |
dc.description.abstract | The development of computer and information technology facilitates many researches of biology that employ computer software. In this paper, we provide a method that can align the ESTs to the genome. Yet, the human genome contains repetitive sequences that hold one-tenth of the human genome. And in the past, most of the associated researches cannot handle those repetitive sequences well, and even cannot deal with those sequences. Hence, our research hopes to handle both those repetitive and unique sequences in the genome to make all ESTs can be aligned to the correct regions. In this way, we can employ the results to have an advance research and analysis. We provide different strategies that can save time and get results within an acceptable correctness to align a single EST and the entire ESTs in dbEST to the genome. We consider the low frequency and high density index problem to provide the EST to locate to the genome. And then, we propose a heuristic algorithm and employ MUGUP to check our research with different test sets of ESTs. | |
dc.description.sponsorship | 元智大學,中壢市 | |
dc.format.extent | 5p. | |
dc.format.extent | 388813 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 2006 ICS會議 | |
dc.subject.other | Computational Algorithm | |
dc.title | Aligning ESTs to Genome Using Low Frequency High Density Index | |
分類: | 2006年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics002006000214.pdf | 379.7 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。