<div dir="ltr">Ops, forgot to copy the list.<br><br><div class="gmail_quote">On Thu, Jul 24, 2008 at 07:54, Rafael Gustavo da Cunha Pereira Pinto <<a href="mailto:rafaelgcpp@gmail.com">rafaelgcpp@gmail.com</a>> wrote:<br>
<blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"><div dir="ltr"><br><br><br><br><div class="gmail_quote">2008/7/23 Benjamin L. Russell <<a href="mailto:DekuDekuplex@yahoo.com" target="_blank">DekuDekuplex@yahoo.com</a>>:<div class="Ih2E3d">
<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
<br>
Correct me if I'm wrong, but because the prefix should not be too<br>
long, and chemical process of modifying Endo with the prefix should<br>
not consume too much energy, this appears to be an example of<br>
constraint programming. Since constraint programming can often be<br>
carried out by constraint logic programming, I might suggest a logic<br>
programming approach for this problem.<br>
<br>
</blockquote></div></div><br clear="all"> <br> 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 <a href="http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-029.pdf" target="_blank">http://www.cs.uu.nl/research/techreps/repo/CS-2007/2007-029.pdf</a>, 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.<br>
<br> The basic idea is to disassemble, find the function calls and add prefxes that do the appropriate calls.
<br><br><br>-- <br><div class="Ih2E3d">Rafael Gustavo da Cunha Pereira Pinto<br></div>Electronic Engineer, MSc.
</div>
</blockquote></div><br><br clear="all"><br>-- <br>Rafael Gustavo da Cunha Pereira Pinto<br>Electronic Engineer, MSc.
</div>