Minimization-aware recursive K^* ( MARK^*): a novel, provable algorithm that accelerates ensemble-based protein design and provably approximates the energy landscape
DOI10.1007/978-3-030-17083-7_7zbMATH Open1412.92245OpenAlexW2919751133MaRDI QIDQ2415249FDOQ2415249
Authors: Jonathan D. Jou, Graham T. Holt, Anna U. Lowegard, Bruce Randall Donald 
Publication date: 21 May 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-17083-7_7
Recommendations
- A Novel Minimized Dead-End Elimination Criterion and Its Application to Protein Redesign in a Hybrid Scoring and Search Algorithm for Computing Partition Functions over Molecular Ensembles
- BWM*: A novel, provable, ensemble-based dynamic programming algorithm for sparse approximations of computational protein design
- Approximate Counting with Deterministic Guarantees for Affinity Computation
- An exact algorithm for side-chain placement in protein design
- scientific article; zbMATH DE number 2081008
Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)
Cited In (2)
- BWM*: A novel, provable, ensemble-based dynamic programming algorithm for sparse approximations of computational protein design
- A Novel Minimized Dead-End Elimination Criterion and Its Application to Protein Redesign in a Hybrid Scoring and Search Algorithm for Computing Partition Functions over Molecular Ensembles
This page was built for publication: Minimization-aware recursive \(K^{*}\) (\({ MARK}^{*}\)): a novel, provable algorithm that accelerates ensemble-based protein design and provably approximates the energy landscape
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2415249)
