The evolution of stochastic regular motifs for protein sequences

  • Authors:
  • Brian J. Ross

  • Affiliations:
  • Brock University, Dept. of Computer Science, St. Catharines, Ontario, Canada

  • Venue:
  • New Generation Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Stochastic regular motifs are evolved for protein sequences using genetic programming. The motif language, SRE-DNA, is a stochastic regular expression language suitable for denoting biosequences. Three restricted versions of SRE-DNA are used as target languages for evolved motifs. The genetic programming experiments are implemented in DCTG-GP, which is a genetic programming system that uses logic-based attribute grammars to define the target language for evolved programs. Earlier preliminary work tested SRE-DNA's viablility as a representation language for aligned protein sequences. This work establishes that SRE-DNA is also suitable for evolving motifs for unaligned sets of sequences.