存在一棵带结树的一个简洁的充要条件。
A concise necessary and sufficient condition for the existence of a galled-tree.
作者信息
Song Yun S
机构信息
Department of Computer Science, University of California at Davis, Davis, CA 95616, USA.
出版信息
IEEE/ACM Trans Comput Biol Bioinform. 2006 Apr-Jun;3(2):186-91. doi: 10.1109/TCBB.2006.15.
PMID:17048404
Abstract
Galled-trees are a special class of graphical representation of evolutionary history that has proven amenable to efficient, polynomial-time algorithms. The goal of this paper is to construct a concise necessary and sufficient condition for the existence of a galled-tree for M, a set of binary sequences that purportedly have evolved in the presence of recombination. Both root-known and root-unknown cases are considered here.
摘要
有结树是进化历史的一种特殊图形表示，已被证明适用于高效的多项式时间算法。本文的目标是为M构建一个简洁的充要条件，其中M是一组据称在存在重组的情况下进化而来的二元序列。这里同时考虑根已知和根未知的情况。
Zotero 插件