Cargando…
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...
Autores principales: | Jain, Swati, Jou, Jonathan D., Georgiev, Ivelin S., Donald, Bruce R. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5391103/ https://www.ncbi.nlm.nih.gov/pubmed/28358804 http://dx.doi.org/10.1371/journal.pcbi.1005346 |
Ejemplares similares
-
Graph theory and sparse matrix computation
por: George, Alan, et al.
Publicado: (1993) -
Algorithm for backrub motions in protein design
por: Georgiev, Ivelin, et al.
Publicado: (2008) -
The Role of Local Backrub Motions in Evolved and Designed Mutations
por: Keedy, Daniel A., et al.
Publicado: (2012) -
Fast Generation of Sparse Random Kernel Graphs
por: Hagberg, Aric, et al.
Publicado: (2015) -
Sparse graphs using exchangeable random measures
por: Caron, François, et al.
Publicado: (2017)