Prediction of Contact Maps Using Support Vector Machines
2002-12-09
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Prediction of Contact Maps Using Support Vector Machines
Alternative title
Authors
Published Date
2002-12-09
Publisher
Type
Report
Abstract
Contact map prediction is of great interests for its application in fold recognition and protein 3D structure determination. In particular, we focusd on predicting non-local interactions in this paper. We employed Support Vector Machines (SVMs) as the machine learning tool and incorporated AAindex to extract correlated mutation analysis (CMA) and sequence profile (SP) features.In addition, we evaluated the effectiveness of different features for various fold classes.On average, our predictor achieved an prediction accuracy of $0.2238$ with an improvement over a random predictor of a factor $11.7$, which is better than reported studies. Our study showed that predicted secondary structure features play an important roles for the proteins containing beta structures. Models based on secondary structure features and CMA features produce different sets of predictions. Our study also suggests that models learned separately for different protein fold families may achieve better performance than a unified model.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Technical Report; 02-039
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Other identifiers
Suggested citation
Zhao, Ying; Karypis, George. (2002). Prediction of Contact Maps Using Support Vector Machines. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215541.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.