Comparing three stochastic search algorithms for computational protein design: Monte Carlo, replica exchange Monte Carlo, and a multistart, steepest-descent heuristic.
Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/jcc/MignonS16
%A Mignon, David
%A Simonson, Thomas
%D 2016
%J J. Comput. Chem.
%K dblp
%N 19
%P 1781-1793
%T Comparing three stochastic search algorithms for computational protein design: Monte Carlo, replica exchange Monte Carlo, and a multistart, steepest-descent heuristic.
%U http://dblp.uni-trier.de/db/journals/jcc/jcc37.html#MignonS16
%V 37
@article{journals/jcc/MignonS16,
added-at = {2020-04-01T00:00:00.000+0200},
author = {Mignon, David and Simonson, Thomas},
biburl = {https://www.bibsonomy.org/bibtex/2672651c656c809566114f6cf85a822c6/dblp},
ee = {https://www.wikidata.org/entity/Q50642617},
interhash = {a8b0ada4b63946b594344d1d3a93be31},
intrahash = {672651c656c809566114f6cf85a822c6},
journal = {J. Comput. Chem.},
keywords = {dblp},
number = 19,
pages = {1781-1793},
timestamp = {2020-04-02T11:42:22.000+0200},
title = {Comparing three stochastic search algorithms for computational protein design: Monte Carlo, replica exchange Monte Carlo, and a multistart, steepest-descent heuristic.},
url = {http://dblp.uni-trier.de/db/journals/jcc/jcc37.html#MignonS16},
volume = 37,
year = 2016
}
