On the protein folding problem in 2D-triangular lattices

In this paper, we present a novel approximation algorithm to solve the protein folding problem in HP model. Our algorithm is polynomial in terms of the length of the given HP string. The expected approximation ratio of our algorithm is [Formula: see text] for n ≥ 6, where n(2) is the total number of...

Descripción completa

Detalles Bibliográficos
Autores principales: Md Sohidull Islam, Abu Sayed, Rahman, Mohammad Sohel
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2013
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4175104/
https://www.ncbi.nlm.nih.gov/pubmed/24279437
http://dx.doi.org/10.1186/1748-7188-8-30
Descripción
Sumario:In this paper, we present a novel approximation algorithm to solve the protein folding problem in HP model. Our algorithm is polynomial in terms of the length of the given HP string. The expected approximation ratio of our algorithm is [Formula: see text] for n ≥ 6, where n(2) is the total number of H’s in a given HP string. The expected approximation ratio tends to reach 1 for large values of n. Hence our algorithm is expected to perform very well for larger HP strings.

Ejemplares similares