This paper explores the idea of using Genetic Programming (GP) to evolve Java Virtual Machine (JVM) byte code to solve a sample symbolic regression problem. The evolutionary process is done completely in memory using a standard Java environment.

New developments are presented in the framework of the model introduced bythe authors in References [1, 2] and in which nucleotides as well ascodons are classified in crystal bases of the quantum group U(q)(sl(2) ⊕ sl (2)) in the limit q → 0. An operator whichgives the correspondence between the amino-acids and the codons isobtained for any known genetic code. The free energy released by basepa...

(a) The nature of the problem Genes are made of nucleic acid. Enzymes are made of protein. The amino acid sequence of a particular protein is synthesized under instruction from a particular piece of nucleic acid. Each protein is made of one or more polypeptide chains, synthesized by condensing together amino acids, head to tail, with the elimination of water. A typical polypeptide chain is seve...