Minimization-aware recursive \(K^{*}\) (\({ MARK}^{*}\)): a novel, provable algorithm that accelerates ensemble-based protein design and provably approximates the energy landscape (Q2415249)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Minimization-aware recursive K^* ( MARK^*): a novel, provable algorithm that accelerates ensemble-based protein design and provably approximates the energy landscape |
scientific article; zbMATH DE number 7057167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimization-aware recursive \(K^{*}\) (\({ MARK}^{*}\)): a novel, provable algorithm that accelerates ensemble-based protein design and provably approximates the energy landscape |
scientific article; zbMATH DE number 7057167 |
Statements
Minimization-aware recursive \(K^{*}\) (\({ MARK}^{*}\)): a novel, provable algorithm that accelerates ensemble-based protein design and provably approximates the energy landscape (English)
0 references
21 May 2019
0 references
0.7826470732688904
0 references
0.776748776435852
0 references
0.7429919242858887
0 references
0.7071993947029114
0 references
