arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1502.07083q-bio.GN
收藏

无基因链的遗传地图最小断点线性化问题的逼近

Approximating the Minimum Breakpoint Linearization Problem for Genetic Maps without Gene Strandedness

Xin Chen

摘要:

遗传图谱线性化的研究导致了一个组合难题,称为{ \em最小断点线性化}(MBL)问题。它的目的是找到一个线性化的部分订单,达到最小的断点距离的参考总订单。之前为MBL问题开发的近似算法仅适用于基因或标记表示为有符号整数的遗传图谱。然而,目前的遗传作图技术一般不指定基因链,使基因只能表示为无符号整数。在本文中,我们研究的MBL问题,在后者更现实的情况下。因此,开发了一种近似算法,该算法实现了$(m^2+2m-1)$的比率,并在$O(n^7)$时间内运行,其中$m$是用于构建输入偏序的遗传图谱的数量,而$n$是这些图谱中不同基因的总数。

英文摘要:

The study of genetic map linearization leads to a combinatorial hard problem, called the {\em minimum breakpoint linearization} (MBL) problem. It is aimed at finding a linearization of a partial order which attains the minimum breakpoint distance to a reference total order. The approximation algorithms previously developed for the MBL problem are only applicable to genetic maps in which genes or markers are represented as signed integers. However, current genetic mapping techniques generally do not specify gene strandedness so that genes can only be represented as unsigned integers. In this paper, we study the MBL problem in the latter more realistic case. An approximation algorithm is thus developed, which achieves a ratio of $(m^2+2m-1)$ and runs in $O(n^7)$ time, where $m$ is the number of genetic maps used to construct the input partial order and $n$ the total number of distinct genes in these maps.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑