Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Protein Folding in 2D-Triangular Lattice Revisited
(Extended Abstract)
verfasst von : A. S. M. Shohidull Islam, M. Sohel Rahman
Erschienen in: Combinatorial Algorithms
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
In this paper, we present a novel approximation algorithm to solve the protein folding problem in the H-P model. Our algorithm is polynomial in terms of the length of the given H-P string. The expected approximation ratio of our algorithm is
$1- \dfrac{2\log n }{n-1}$
for
n
≥ 6, where
n
2
is the total number of H in a given H-P string. The expected approximation ratio tends to 1 for large values of
n
. Hence our algorithm is expected to perform very well for larger H-P strings.