完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Wu, Bang Ye | |
| dc.date.accessioned | 2009-08-23T04:47:23Z | |
| dc.date.accessioned | 2020-05-29T06:16:24Z | - |
| dc.date.available | 2009-08-23T04:47:23Z | |
| dc.date.available | 2020-05-29T06:16:24Z | - |
| dc.date.issued | 2006-10-16T06:13:28Z | |
| dc.date.submitted | 2001-12-20 | |
| dc.identifier.uri | http://dspace.fcu.edu.tw/handle/2377/1625 | - |
| dc.description.abstract | We investigated the problem of constructing the maximum consensus tree from rooted triples. We showed the NP-hardness of the problem and developed exact and heuristic algorithms. The exact algorithm is based on the dynamic programming strategy . The heuristic algorithms were tested and their performances are shown by comparing with the optimal solutions. The experimental results show that the worst and average case relative error ratios are 1.214 and 1.075 respectively, which are much better than the previously best approximation ratio of the problem. | |
| dc.description.sponsorship | 中國文化大學,台北市 | |
| dc.format.extent | 8p. | |
| dc.format.extent | 197553 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2001 NCS會議 | |
| dc.subject | computational biology | |
| dc.subject | evolutionary trees | |
| dc.subject | algorithms | |
| dc.subject | dynamic programming | |
| dc.subject | NP-hardness | |
| dc.subject.other | Interconnection networks | |
| dc.title | Constructing the maximum consensus tree from rooted triples | |
| dc.title.alternative | 以三者之間的係建立最大一致性的種族樹 | |
| 分類: | 2001年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ncs002001000005.pdf | 192.92 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。