|
|
||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
1 School of Computer Science, University of Waterloo;
2 Toyota Technological Institute at Chicago
(RECEIVED May 20, 2008; ACCEPTED July 22, 2008)
We design a simple position-specific hidden Markov model to predict protein structure. Our new framework naturally repeats itself to converge to a final target, conglomerating fragment assembly, clustering, target selection, refinement, and consensus, all in one process. Our initial implementation of this theory converges to within 6 Angstrom of the native structures for 100% decoys on all 6 standard benchmark proteins used in ROSETTA which achieved only 14% to 94% for the same data. The qualities of the best decoys and the final decoys our theory converges to are also notably better.
Keywords: Protein Structure/Folding; Computational Analysis of Protein Structure; Hidden Markov Model; Iteration; Primal_Dual; Sampling
3 E-mail: mli{at}cs.uwaterloo.ca
![]()
CiteULike
Connotea
Del.icio.us
Digg
Reddit
Technorati What's this?
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH |