A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Proposes a method for algorithmic learning of transmembrane domains based on elementary formal systems. An elementary formal system (EFS) is a kind of a logic program consisting of if-then rules. With this framework, the authors have implemented the algorithm for identifying transmembrane domains in amino acid sequences. Because of the limitations on computational resources, they restrict candidate hypotheses to EFSs defined by collections of regular patterns. From 70 transmembrane sequences and a similar amount of negative examples which are not transmembrane sequences, the algorithm has produced several reasonable hypotheses of small size. Experiments with the database PIR show that one of them recognizes 95% of 689 transmembrane sequences and 95% of 19256 negative examples which consist of non-transmembrane sequences of length around 30 randomly chosen from PIR.Keywords
This publication has 17 references indexed in Scilit:
- Automatic generation of primary sequence patterns from sets of related protein sequences.Proceedings of the National Academy of Sciences, 1990
- INDUCTIVE INFERENCE FROM POSITIVE DATA IS POWERFULPublished by Elsevier ,1990
- On learning sets and functionsMachine Learning, 1989
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Protein secondary structure prediction with a neural network.Proceedings of the National Academy of Sciences, 1989
- On learning Boolean functionsPublished by Association for Computing Machinery (ACM) ,1987
- IDENTIFYING NONPOLAR TRANSBILAYER HELICES IN AMINO ACID SEQUENCES OF MEMBRANE PROTEINSAnnual Review of Biophysics, 1986
- Induction of decision treesMachine Learning, 1986
- A conformational preference parameter to predict helices in integral membrane proteinsBiochimica et Biophysica Acta (BBA) - Protein Structure and Molecular Enzymology, 1986
- Polynomial time inference of extended regular pattern languagesPublished by Springer Nature ,1983