完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chang, Jia-Ming | |
dc.contributor.author | Tang, Chuan Yi | |
dc.contributor.author | Chang, Chao-Ling | |
dc.date.accessioned | 2009-08-23T04:41:20Z | |
dc.date.accessioned | 2020-05-25T06:38:05Z | - |
dc.date.available | 2009-08-23T04:41:20Z | |
dc.date.available | 2020-05-25T06:38:05Z | - |
dc.date.issued | 2006-10-16T04:00:02Z | |
dc.date.submitted | 2002-12-18 | |
dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1511 | - |
dc.description.abstract | For evaluating the quality of a evolution tree reconstructed by computer, the neighboring relations consist with original distances are very important. However, the neighboring relations are not equally important. In this paper, from a relative point of view, we propose an estimating criterion that neighboring relations with respect to compact sets, those neighboring relations are more important. We estimate the evolution tree with considering whether those relations are consist or not. In the last part of the paper, we estimate some famous programs of constructing evolution tree with using the criterion on real data. | |
dc.description.sponsorship | 東華大學,花蓮縣 | |
dc.format.extent | 13p. | |
dc.format.extent | 486069 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | zh_TW | |
dc.relation.ispartofseries | 2002 ICS會議 | |
dc.subject | computational biology | |
dc.subject | compact set | |
dc.subject | evolution tree | |
dc.subject | heuristic algorithm | |
dc.title | Compact Set Neighboring Relation and Its Application in the Evaluating the Evolution Tree | |
分類: | 2002年 ICS 國際計算機會議 |
文件中的檔案:
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
ce07ics002002000171.PDF | 474.68 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。