刘培霞, 姜海涛, 朱大铭. PQ-树断点距离中心问题的复杂性和精确算法[J]. 计算机研究与发展, 2016, 53(3): 644-650.
 引用本文: 刘培霞, 姜海涛, 朱大铭. PQ-树断点距离中心问题的复杂性和精确算法[J]. 计算机研究与发展, 2016, 53(3): 644-650.
LiuPeixia, JiangHaitao, ZhuDaming. Complexity and Algorithm for Minimum Breakpoint Median from PQ-trees[J]. Journal of Computer Research and Development, 2016, 53(3): 644-650.
 Citation: LiuPeixia, JiangHaitao, ZhuDaming. Complexity and Algorithm for Minimum Breakpoint Median from PQ-trees[J]. Journal of Computer Research and Development, 2016, 53(3): 644-650.

## Complexity and Algorithm for Minimum Breakpoint Median from PQ-trees

• 摘要: PQ-树是一种树状数据结构，用来表示元素排列集合.虽然消逝物种完整基因组序列具有不确定性，但是根据同源物种可以确定部分基因的相对位置，所以可以利用PQ-树来存储消逝物种的基因组.在生物学中，进化树用来表示物种之间的进化关系.当构建生物进化树时，叶子结点表示现存物种，其基因组用排列表示；内部结点为祖先物种，其基因组用PQ-树表示.为了确定物种间的进化关系，需要确定PQ-树可以产生的排列与已知排列之间的距离.以断点距离为标准，研究了p-PQ-树断点中心问题，即从给定PQ-树中产生一个排列，使之与给定的p个排列的断点距离之和最小.证明当p≥2时，p-PQ-树断点中心问题是NP-完全的.当p=1时，p-PQ-树断点中心问题是参数化可计算的，针对1-PQ-树断点中心问题，提出了时间复杂度为O(3\+Kn)的参数化算法，其中K为最优解的断点距离.

Abstract: A PQ-tree is a tree-based data structure which can represent large sets of permutations. Although the uncertainty of complete ancestral genomes is known, the homologous species provide information to determine the relative locations of partial genomes, whereby the PQ-tree can be designed to efficiently store ancestral genomes. In evolutionary biology, phylogenetic trees represent the evolutionary relationships between species. In the construction of phylogenetic trees, the leaves of the trees represent current species whose genomes are annotated by permutations, and the internal nodes represent ancestral genomes whose genomes are annotated by PO-trees. In order to determine the evolutionary relationships between different species, it is necessary to quantify the distances between the known permutations and the permutations in the constructed PQ-trees. Based on the measurement of breakpoint distance, we investigate p-Minimum Breakpoint Median from the PQ-tree. Given a PQ-tree and the corresponding p permutations, the goal is to identify a permutation generated by the PQ-tree that holds the minimum breakpoint distances relative to the p permutations. Our study shows that when p≥2, the p-Minimum Breakpoint Median problem from PQ-tree is NP-complete. Moreover, when p=1, the problem is fixed parameters tractable. To solve the 1-Minimum Breakpoint Median from PQ-trees, we propose a Fixed-Parameter Tractable algorithm whose computation complexity is O(3\+Kn) where K is the optimized breakpoint distance.

/

• 分享
• 用微信扫码二维码

分享至好友和朋友圈