KAUST Grant NumberKUS-C1-016-04
Permanent link to this recordhttp://hdl.handle.net/10754/598583
MetadataShow full item record
AbstractCopyright © 2014 ACM. Predicting protein structures and simulating protein folding are two of the most important problems in computational biology today. Simulation methods rely on a scoring function to distinguish the native structure (the most energetically stable) from non-native structures. Decoy databases are collections of non-native structures used to test and verify these functions. We present a method to evaluate and improve the quality of decoy databases by adding novel structures and removing redundant structures. We test our approach on 17 different decoy databases of varying size and type and show significant improvement across a variety of metrics. We also test our improved databases on a popular modern scoring function and show that they contain a greater number of native-like structures than the original databases, thereby producing a more rigorous database for testing scoring functions.
CitationLindsey A, Yeh H-Y (Cindy), Wu C-P, Thomas S, Amato NM (2014) Improving decoy databases for protein folding algorithms. Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics - BCB ’14. Available: http://dx.doi.org/10.1145/2649387.2660839.
SponsorsThis work is supported in part by NSF awards CRI-0551685,CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266 by THECBNHARP award 000512-0097-2009, by Chevron, IBM, Intel,Oracle/Sun and by Award KUS-C1-016-04, made by KingAbdullah University of Science and Technology (KAUST).
JournalProceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics - BCB '14