Faster placement of hydrogens in protein structures by dynamic programming
暂无分享,去创建一个
[1] J. Richardson,et al. Asparagine and glutamine: using hydrogen atom contacts in the choice of side-chain amide orientation. , 1999, Journal of molecular biology.
[2] Jack Snoeyink,et al. An Adaptive Dynamic Programming Algorithm for the Side Chain Placement Problem , 2004, Pacific Symposium on Biocomputing.
[3] Carl Branden. Introduction to Protein Structure Second Edition , 2009 .
[4] Stefan Arnborg,et al. Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..
[5] Hans L. Bodlaender,et al. A Tourist Guide through Treewidth , 1993, Acta Cybern..
[6] Ian W. Davis,et al. Structure validation by Cα geometry: ϕ,ψ and Cβ deviation , 2003, Proteins.
[7] Marc De Maeyer,et al. The Dead-End Elimination Theorem: , 2000 .
[8] Detlef Seese,et al. Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.
[9] C. Branden,et al. Introduction to protein structure , 1991 .
[10] Russell L. Malmberg,et al. Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment , 2005, WABI.
[11] S. Arnborg,et al. Characterization and recognition of partial 3-trees , 1986 .
[12] D. Richardson,et al. Exploring steric constraints on protein mutations using MAGE/PROBE , 2000, Protein science : a publication of the Protein Society.
[13] M. Zalis,et al. Visualizing and quantifying molecular goodness-of-fit: small-probe contact dots with explicit hydrogen atoms. , 1999, Journal of molecular biology.
[14] Johan Desmet,et al. The dead-end elimination theorem and its use in protein side-chain positioning , 1992, Nature.
[15] Hans L. Bodlaender,et al. Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.