Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Multi-directional Width-Bounded Geometric Separator and Protein Folding
verfasst von : Bin Fu, Sorinel A Oprisan, Lizhe Xu
Erschienen in: Algorithms and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves 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 less than or equal to 1.02074
$\sqrt{n}$
points, and
G
–
A
has two disconnected subgraphs with less than or equal to
${2 \over 3}n$
nodes on each of them. We also derive 0.7555
$\sqrt{n}$
lower bound for such a separator on grid graph. The previous upper bound record for the grid graph
$2 \over 3$
-separator is 1.129
$\sqrt{n}$
[6].