New fixed-parameter algorithms for the minimum quartet inconsistency problem

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/120037

請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/120037

題名:	New fixed-parameter algorithms for the minimum quartet inconsistency problem
作者:	Chang, Maw-Shang;Lin, Chuang-Chieh;Rossmanith, Peter
關鍵詞:	Evolutionary tree;Quartet topology;Leaf-labeled tree;Minimum quartet inconsistency problem;Fixed-parameter algorithm;Depth-bounded search tree
日期:	2009-01-27
上傳時間:	2021-03-05 12:12:48 (UTC+8)
摘要:	Let S be a set of n taxa. Given a parameter k and a set of quartet topologies Q over S such that there is exactly one topology for every subset of four taxa, the parameterized Minimum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at most k quartet topologies. The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O(4k n+n 4). In this paper, first we present an O(3.0446k n+n 4) fixed-parameter algorithm and an O(2.0162k n 3+n 5) fixed-parameter algorithm for the parameterized MQI problem. Finally, we give an O *((1+ε)k) fixed-parameter algorithm, where ε>0 is an arbitrarily small constant.
關聯:	Theory of Computing Systems 47, pp.342–367
DOI:	10.1007/s00224-009-9165-y
顯示於類別:	[資訊工程學系暨研究所] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	45	檢視/開啟

在機構典藏中所有的資料項目都受到原著作權保護.

TAIR相關文章