2013 | OriginalPaper | Chapter
Protein Folding in 2D-Triangular Lattice Revisited
(Extended Abstract)
Authors : A. S. M. Shohidull Islam, M. Sohel Rahman
Published in: Combinatorial Algorithms
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.