BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design

DOI10.1007/978-3-319-16706-0_16zbMath1355.92004OpenAlexW2249703070MaRDI QIDQ2814583

Swati Jain, Jonathan D. Jou, Ivelin Georgiev, Bruce Randall Donald

Publication date: 22 June 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc4904165

zbMATH Keywords

branch-width minimizationglobal minimum energy conformationsparse energy functions

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design

Cites Work

• Safe separators for treewidth
• BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design
• Tour Merging via Branch-Decomposition
• Fast and accurate algorithms for protein side-chain packing

This page was built for publication: BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design