Ops, forgot to copy the list. On Thu, Jul 24, 2008 at 07:54, Rafael Gustavo da Cunha Pereira Pinto < rafaelgcpp@gmail.com> wrote:

2008/7/23 Benjamin L. Russell :

...

Correct me if I'm wrong, but because the prefix should not be too long, and chemical process of modifying Endo with the prefix should not consume too much energy, this appears to be an example of constraint programming. Since constraint programming can often be carried out by constraint logic programming, I might suggest a logic programming approach for this problem.

The DNA is actually a representation of a turing machine (like BF language). Using brute-force and constraints would take too long. There is a report at http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-029.pdf, that shows how this DNA string was made: it is the output of a compiler for a functional programming language specially tailored for this contest. which, in turn, was written in Haskell.

The basic idea is to disassemble, find the function calls and add prefxes that do the appropriate calls.

-- Rafael Gustavo da Cunha Pereira Pinto Electronic Engineer, MSc.

-- Rafael Gustavo da Cunha Pereira Pinto Electronic Engineer, MSc.