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
From MaRDI portal
Publication:3596320
DOI10.1007/11732990_44zbMATH Open1302.92101OpenAlexW2152662598MaRDI QIDQ3596320FDOQ3596320
Authors: Ivelin Georgiev, Ryan H. Lilien, Bruce Randall Donald 
Publication date: 30 August 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11732990_44
Recommendations
- Minimization-aware recursive \(K^{*}\) (\({ MARK}^{*}\)): a novel, provable algorithm that accelerates ensemble-based protein design and provably approximates the energy landscape
- Computational protein design as an optimization problem
- Approximate Counting with Deterministic Guarantees for Affinity Computation
- BWM*: A novel, provable, ensemble-based dynamic programming algorithm for sparse approximations of computational protein design
- An exact algorithm for side-chain placement in protein design
Cited In (3)
- Self-consistent ensemble optimization and its implementation for mutation analysis in proteins
- Minimization-aware recursive \(K^{*}\) (\({ MARK}^{*}\)): a novel, provable algorithm that accelerates ensemble-based protein design and provably approximates the energy landscape
- Computational protein design as an optimization problem
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596320)
