It consists of E. coli promoter gene sequences starting at position -50 (p-50) and ending at position +7 (p7). Each of these 57 Fields is filled by one of a, g, t, c. The task is to recognize promoters, which are genetic regions which initiate the first step in the expression of adjacent genes (transcription). There are 53 promoters and 53 non-promoter sequences.
data(promoter)A data frame with 106 observations on the following 58 variables.
One of 1/0, indicating the class (1 = promoter).
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Sequence; filled by one of a, g, t, c.
Towell, G., Shavlik, J., Noordewier, M. Refinement of approximate domain theories by knowledge-based neural networks. In Proceedings of the eighth National conference on Artificial intelligence, pages 861-866. Boston, MA, 1990.
data(promoter)
summary(promoter)
Run the code above in your browser using DataLab