Full cyclic coordinate descent: solving the protein loop closure problem in C<it>α </it>space
<p>Abstract</p> <p>Background</p> <p>Various forms of the so-called <it>loop closure problem </it>are crucial to protein structure prediction methods. Given an N- and a C-terminal end, the problem consists of finding a suitable segment of a certain length th...
Main Authors: | Hamelryck Thomas, Boomsma Wouter |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2005-06-01
|
Series: | BMC Bioinformatics |
Online Access: | http://www.biomedcentral.com/1471-2105/6/159 |
Similar Items
-
When cyclic coordinate descent outperforms randomized coordinate descent
by: Gurbuzbalaban, Mert, et al.
Published: (2019) -
Adaptive Sparse Cyclic Coordinate Descent for Sparse Frequency Estimation
by: Yuneisy E. Garcia Guzman, et al.
Published: (2021-04-01) -
Sparse Random Feature Algorithm as Coordinate Descent in Hilbert Space
by: Ting-Wei Lin, et al.
Published: (2014) -
Recursive descent optimization of structured loops
by: Ross, Keenan Olin
Published: (2006) -
Mechanical evaluation of space closure loops in Orthodontics
by: Eduardo Uggeri Rodrigues, et al.
Published: (2011-02-01)