arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1307.5547cs.DS
收藏

探测区间图的线性时间识别

Linear-Time Recognition of Probe Interval Graphs

Ross M. McConnell, Yahav Nussbaum

摘要:

线上一组区间的区间图由每个区间的一个顶点和每个相交区间对的一条边组成。探针间隔图是由基因组学的应用激发的变体,其中间隔被划分为两组:探针和非探针。如果两个顶点相交并且其中至少有一个是探针,则图在两个顶点之间有一条边。我们给出了一个线性时间算法来确定一个给定的图和划分的顶点到探针和非探针是一个探针区间图。如果是,我们给出一个间隔布局来证明这一点。我们还可以确定区间的布局是否在相同的时间范围内受到唯一约束。作为该算法的一部分,我们解决了在线性时间的召唤探针矩阵问题,开发算法操作PQ树,并给出结果,涉及PQ树的不同子矩阵的召唤矩阵。

英文摘要:

The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where the intervals are partitioned into two sets: probes and non-probes. The graph has an edge between two vertices if they intersect and at least one of them is a probe. We give a linear-time algorithm for determining whether a given graph and partition of vertices into probes and non-probes is a probe interval graph. If it is, we give a layout of intervals that proves this. We can also determine whether the layout of the intervals is uniquely constrained within the same time bound. As part of the algorithm, we solve the consecutive-ones probe matrix problem in linear time, develop algorithms for operating on PQ trees, and give results that relate PQ trees for different submatrices of a consecutive-ones matrix.

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

↑