The NP-hardness Property of the Copy-Number Tree Problem
碩士 === 東海大學 === 應用數學系 === 107 === El-Kebir et al. established the copy-number tree problem and proved it to be NP-hard. We found that the proof is not exactly correct. Thus, we have made some changes to this problem and discuss its NP-hardness property.
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24fffu |