完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Wu, Bang Ye | |
| dc.date.accessioned | 2009-08-23T04:46:38Z | |
| dc.date.accessioned | 2020-05-29T06:16:38Z | - |
| dc.date.available | 2009-08-23T04:46:38Z | |
| dc.date.available | 2020-05-29T06:16:38Z | - |
| dc.date.issued | 2006-10-16T05:54:50Z | |
| dc.date.submitted | 2001-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/1583 | - |
| dc.description.abstract | For a given unrooted tree and observed distances among the species, we developed a fast algorithm for rooting the tree such that the size of the rooted ultrametric tree is minimum. The time complexity of the algorithm is O(n2), while a naive algorithm will take O(n3) time. | |
| dc.description.sponsorship | 中國文化大學,台北市 | |
| dc.format.extent | 4p. | |
| dc.format.extent | 170979 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2001 NCS會議 | |
| dc.subject | algorithms | |
| dc.subject | computational biology | |
| dc.subject | ultrametric trees | |
| dc.subject.other | Interconnection networks | |
| dc.title | A fast algorithm for rooting a tree to minimeze the ultrametric size | |
| dc.title.alternative | 以最小ultrametric size 決定樹根之快速演算法 | |
| 分類: | 2001年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs002001000004.pdf | 166.97 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。