An effective exact algorithm and a new upper bound for the ... - PubMed
pubmed.ncbi.nlm.nih.gov › ...
We present a twofold result. First, we devise a new upper bound for the number of contacts achievable by an HP sequence, and show that it is in several cases ...
Jul 30, 2013 · We present a twofold result. First, we devise a new upper bound for the number of contacts achievable by an HP sequence, and show that it is in ...
Different approaches have been proposed to model this problem, and this research explores the prediction of optimal structures using the well studied simplified ...
Different approaches have been proposed to model this problem, and this research explores the prediction of optimal structures using the well studied simplified ...
An Effective Exact Algorithm and a New Upper Bound for the Number of Contacts in the Hydrophobic-Polar Two-Dimensional Lattice Model. Giaquinta, Emanuele ...
An Effective Exact Algorithm and a New Upper Bound for the Number of Contacts in the Hydrophobic-Polar Two-Dimensional Lattice Model ; Journal of Computational ...
We present a twofold result. First, we devise a new upper bound for the number of contacts achievable by an HP sequence, and show that it is in several cases ...
An effective exact algorithm and a new upper bound for the number of contacts in the hydrophobic-polar 2D-lattice model ...
Missing: Two- Dimensional
A new mathematical formulation of the hydrophobic-hydrophilic model is presented, which can provide an upper bound using linear relaxation of the ...
An Effective Exact Algorithm and a New Upper Bound for the Number of Contacts in the Hydrophobic-Polar Two-Dimensional Lattice Model ; 20 · 8 · 593-609 · 17 · 1066- ...