Protein motif discovery with linear genetic programming

Authors:
Rolv Seehuus
Affiliations:
Norwegian University of Science and Technology, Norway
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Year:
2005

Citing 3
Cited 2

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications

Genetic programming: an introduction: on the automatic evolution of computer programs and its applications
The evolution of stochastic regular motifs for protein sequences

New Generation Computing
A recursive MISD architecture for pattern matching

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Population variation in genetic programming

Information Sciences: an International Journal
Dynamic population variation in genetic programming

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

There have been published some studies of genetic programming as a way to discover motifs in proteins and other biological data. These studies have been small, and often used domain knowledge to improve search. In this paper we present a genetic programming algorithm, that does not use domain knowledge, with results on 44 different protein families. We demonstrate that our list-based representation, given a fixed amount of processing resources, is able to discover meaningful motifs with good classification performance. Sometimes comparable to or even surpassing that of motifs found in a database of manually created motifs. We also investigate introduction of gaps in our algorithm, and it seems that this give a small increase in classification accuracy and recall, but with reduced precision.