From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time

被引：0
|
作者：
V. Berry
Z. S. Peng
H. F. Ting
机构：
[1] Université de Montpellier II–C.N.R.S.,Departement Informatique, L.I.R.M.M.
[2] The University of Hong Kong,Department of Computer Science
来源：
Algorithmica | 2008年 / 50卷
关键词：
Maximum agreement subtrees; Constrained maximum agreement subtrees; Consensus; Reduction; Bioinformatics; Evolutionary trees;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We propose and study the Maximum Constrained Agreement Subtree (MCAST) problem, which is a variant of the classical Maximum Agreement Subtree (MAST) problem. Our problem allows users to apply their domain knowledge to control the construction of the agreement subtrees in order to get better results. We show that the MCAST problem can be reduced to the MAST problem in linear time and thus we have algorithms for MCAST with running times matching the fastest known algorithms for MAST.
引用
收藏
页码：369 / 385
页数：16
相关论文
共 50 条
12345