基因複製樹問題的NP-hardness性質

THUIR > College of Science > Department of Applied Mathematics > Theses and Dissertations > Item 310901/31879

Please use this identifier to cite or link to this item: http://140.128.103.80:8080/handle/310901/31879

Title:	基因複製樹問題的NP-hardness性質
Other Titles:	The NP-hardness Property of the Copy-Number Tree Problem
Authors:	楊宗頤 YANG, TSUNG-YI
Contributors:	謝維華 HSIEH, WEI-HUA 應用數學系
Keywords:	癌;基因組重新排列;基因複製向量;演化樹;最簡約假設;NP-hard Cancer;Genome rearrangement;Copy number profile;Phylogeny;Maximum parsimony;NP-hard
Date:	2019
Issue Date:	2019-12-16T07:05:09Z (UTC)
Abstract:	El-Kebir et al. 建立基因複製樹問題，並證明其為NP-hard。我們發現該證明並不正確。我們對該問題做了若干修改，並探討其NP-hardness性質。 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.
Appears in Collections:	[Department of Applied Mathematics] Theses and Dissertations

Files in This Item:

File	Size	Format
107THU00507005-001.pdf	942Kb	Adobe PDF	134	View/Open