Cargando…
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...
Autores principales: | Md Sohidull Islam, Abu Sayed, Rahman, Mohammad Sohel |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
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 |
Ejemplares similares
-
RNA folding on the 3D triangular lattice
por: Gillespie, Joel, et al.
Publicado: (2009) -
Protein folding in HP model on hexagonal lattices with diagonals
por: Shaw, Dipan Lal, et al.
Publicado: (2014) -
Fast Tree Search for A Triangular Lattice Model of Protein Folding
por: Li, Xiaomei, et al.
Publicado: (2004) -
Sharp [Formula: see text] Law for the Minimizers of the Edge-Isoperimetric Problem on the Triangular Lattice
por: Davoli, Elisa, et al.
Publicado: (2016) -
Spin-lattice decoupling in a triangular-lattice quantum spin liquid
por: Isono, Takayuki, et al.
Publicado: (2018)