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

Argos P, Abagyan R

Open source

DOI
10.1016/0097-8485(94)85017-8
Published
1994 Sep
Container
Computers & chemistry
Publisher
Not recorded
Open access
unknown

Credibility signals

limited evidence Score 43/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 = {Argos P and Abagyan R},
  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  - Argos P
AU  - Abagyan R
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

P, A., & R, A. (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