[Haskell-beginners] Fast tree manipulation
stephen.tetley at gmail.com
Wed Feb 3 09:42:58 EST 2010
On 3 February 2010 12:47, Gabi <bugspynet at gmail.com> wrote:
> An efficient GP system would fail if the tree manipulation operators
> (crossover, mutation) are slow.
Impeccably true, by definition.
There might some information to be gleaned from following the links here:
... but otherwise I can't find anything Haskell related by a quick search.
While its not directly related, Robert Giegerich has done a lot of
work with dynamic programming for Haskell for bio informatics and
checking his work might interesting at least for 'methodology'. A
paraphrase of the conclusion from his paper a decade ago was that
Haskell was invaluable for prototyping but C was essential for speed.
Haskell (GHC) has got a lot faster in the decade since, but it seems
for absolute speed his research group currently use a 'domain-specific
compiler' written in Haskell that generates C. This line of 'off
shore' optimization is a recurring theme in Haskell and has been
explored by Conal Elliott and others for graphics.
 "An Algebraic Dynamic Programming Approach to the Analysis of
Recombinant DNA Sequences"
More information about the Beginners