A critical analysis of computational protein design with sparse residue interaction graphs.
Protein design algorithms enumerate a combinatorial number of candidate structures to compute the Global Minimum Energy Conformation (GMEC). To efficiently find the GMEC, protein design algorithms must methodically reduce the conformational search space. By applying distance and energy cutoffs, the...
Main Authors: | Swati Jain, Jonathan D Jou, Ivelin S Georgiev, Bruce R Donald |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2017-03-01
|
Series: | PLoS Computational Biology |
Online Access: | http://europepmc.org/articles/PMC5391103?pdf=render |
Similar Items
-
Graph Learning-Based Ontology Sparse Vector Computing
by: Jianzhang Wu, et al.
Published: (2020-09-01) -
Computation of Graphlet Orbits for Nodes and Edges in Sparse Graphs
by: Tomaž Hočevar, et al.
Published: (2016-07-01) -
Metrics for sparse graphs
by: Bollobas, B, et al.
Published: (2007) -
Sub-Graph Based Joint Sparse Graph for Sparse Code Multiple Access Systems
by: Ke Lai, et al.
Published: (2018-01-01) -
Novel, provable algorithms for efficient ensemble-based computational protein design and their application to the redesign of the c-Raf-RBD:KRas protein-protein interface.
by: Anna U Lowegard, et al.
Published: (2020-06-01)