.png){kind=icon}
返回
Merging Partially Labelled Trees: Hardness and a Declarative Programming Solution
.png){kind=icon}
OA
AI
DOI：10.1109/TCBB.2014.2307200.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Intraspecific studies often make use of haplotype networks instead of gene genealogies to represent the evolution of a set of genes. Cassens et al. [3] proposed one such network reconstruction method, based on the global maximum parsimony principle, which was later recast by the first author of the present work as the problem of finding a minimum common supergraph of a set of t partially labelled trees. Although algorithms have been proposed for solving that problem on two graphs, the complexity of the general problem on trees remains unknown. In this paper, we show that the corresponding decision problem is NP-complete for t = 3. We then propose a declarative programming approach to solving the problem to optimality in practice, as well as a heuristic approach, both based on the IDP system, and assess the performance of both methods on randomly generated data.
Keyword:
Phylogenetic networks
supergraphs
NP-hardness
SAT solver
IDP
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.4
论文数:
3.3K
被引数:
6.4K
机构
引用论文
Evaluating intraspecific Network construction methods using simulated sequence data: Do existing algorithms outperform the global maximum parsimony approach?.png)
SYSTEMATIC BIOLOGYOAAI
SYSTEMATIC BIOLOGYIF5.7
OAAI分享收藏Effects of immersion in tepid bath water on recovery from fatigue after submaximal exercise in manErgonomics
ErgonomicsIF0
PREAI
分享收藏