Multi-directional Width-Bounded Geometric Separator and Protein Folding
نویسندگان
چکیده
We introduce the concept of multi-directional width-bounded geometric separators and obtain an improved separator for grid graphs. This yields an improved exact algorithm for the protein folding problem in the HP-model. For a grid graph G with n grid points P , there exists a separator A ⊆ P such that A has at most 1.02074 √ n points, and G−A has two disconnected subgraphs each with at most 2 3 n nodes. This improves the previous upper bound of 1.129 √ n . We also derive a 0.7555 √ n lower bound for such a separator in grid graphs.
منابع مشابه
Theory and Application of Width Bounded Geometric Separator
We introduce the notion of the width bounded geometric separator and develop the techniques for the existence of the width bounded separator in any d-dimensional Euclidean space. The separator is applied in obtaining 2 √ n) time exact algorithms for a class of NPcomplete geometric problems, whose previous algorithms take n √ n) time [2,5,1]. One of those problems is the well known disk covering...
متن کاملTheory and application of width bounded geometric separators
We introduce the notion of the width bounded geometric separator and develop the techniques for the existence of the width bounded separator in any fixed ddimensional Euclidean space. The separator is applied in obtaining 2O( √ n) time exact algorithms for a class of NP-complete geometric problems, whose previous algorithms take nO( √ n) time . One of those problems is the well known disk cover...
متن کاملA PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of 6 various radii on the plane, find a subset of discs to maximize the area covered by exactly one 7 disc. This problem originates from the application in digital halftoning, with the best known 8 approximation factor being 5.83 (Asano et al., 2004). We show that if the maximum radius 9 is no more than a constant...
متن کاملGeometric Separators and Their Applications to Protein Folding in the HP-Model
We develop a new method for deriving a geometric separator for a set of grid points. Our separator has a linear structure, which can effectively partition a grid graph. For example, we prove that for a grid graph G with a set of n points P in a two-dimensional grid, there is a separator with at most 1.129 √ n points in P that partitions G into two disconnected grid graphs each with at most 2n 3...
متن کاملSublinear Time Width-Bounded Separators and Their Application to the Protein Side-Chain Packing Problem
Given d > 2 and a set of n grid points Q in <, we design a randomized algorithm that finds a w-wide separator, which is determined by a hyper-plane, in O(n 2 d log n) sublinear time such that Q has at most ( d d+1 + o(1))n points one either side of the hyper-plane, and at most cdwn d−1 d points within w 2 distance to the hyper-plane, where cd is a constant for fixed d. In particular, c3 = 1.209...
متن کامل