The protein folding problem: Finding a few minimums in a near infinite space

Patrick Argos, Ruben Abagyan

Open source

DOI
10.1016/0097-8485(94)85017-8
Published
1994-09
Container
Computers & Chemistry
Publisher
Elsevier BV
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1016/0097-8485-94-85017-8,
  title = {The protein folding problem: Finding a few minimums in a near infinite space},
  author = {Patrick Argos and Ruben Abagyan},
  year = {1994},
  journal = {Computers \& Chemistry},
  doi = {10.1016/0097-8485(94)85017-8},
  url = {https://doi.org/10.1016/0097-8485(94)85017-8}
}

RIS

TY  - JOUR
TI  - The protein folding problem: Finding a few minimums in a near infinite space
AU  - Patrick Argos
AU  - Ruben Abagyan
PY  - 1994
JO  - Computers & Chemistry
DO  - 10.1016/0097-8485(94)85017-8
UR  - https://doi.org/10.1016/0097-8485(94)85017-8
ER  - 

APA

Argos, P., & Abagyan, R. (1994). The protein folding problem: Finding a few minimums in a near infinite space. Computers & Chemistry. https://doi.org/10.1016/0097-8485(94)85017-8

Source records