Numerical Comparisons of Three Recently Proposed Algorithms in the Protein Folding Problem

Simple item page
dc.creatorHansmann, Ulrich H. E.
dc.creatorOkamoto, Yuko
dc.date1997-10-18
dc.date.accessioned2026-07-07T05:55:55Z
dc.date.available2026-07-07T05:55:55Z
dc.descriptionWe compare numerically the effectiveness of three recently proposed algorithms, multicanonical simulations, simulations in a 1/k-ensemble, and simulated tempering for the protein folding problem. For this we perform simulations with high statistics for one of the simplest peptides, Met-enkephalin. While the performances of all three approaches is much better than traditional methods, we find that the differences among the three are only marginal.
dc.descriptionLatex, no figures include, for reprints send e-mail to authors
dc.identifierhttps://arxiv.org/abs/physics/9710019
dc.identifierhttp://arxiv.org/abs/physics/9710019
dc.identifierJ. Comput. Chem. 18 (1997) 920 -933
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/87421
dc.subjectChemical Physics
dc.subjectCondensed Matter
dc.subjectBiological Physics
dc.subjectComputational Physics
dc.subjectQuantitative Biology
dc.titleNumerical Comparisons of Three Recently Proposed Algorithms in the Protein Folding Problem
dc.typetext

Files

Collections

arXiv