By Topic

Using logic for protein structure prediction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
S. Muggleton ; Turing Inst., Glasgow, UK ; R. D. King ; M. J. E. Sternberg

The prediction of protein secondary structure from a primary sequence is one of the most important unsolved problems in molecular biology. This paper shows that the use of a machine learning algorithm (Golem) which allows relational descriptions leads to improved performance. Golem takes, as input, examples and background knowledge described as Prolog facts. It produces, as output, Prolog rules which are a generalisation of the examples. Golem was applied to learning secondary structure prediction rules for alpha domain type proteins (a subset of the Protein Data Bank rich in helical secondary structure and nearly devoid of beta sheet). Golem learned a small set of rules predicting which residues are part of α-helices based on their positional relationships and chemical and physical properties. This representations is more easily understood by molecular biologists. Performance of the learned rules was 81% (+/-2%)

Published in:

System Sciences, 1992. Proceedings of the Twenty-Fifth Hawaii International Conference on  (Volume:i )

Date of Conference:

7-10 Jan 1992