* [Caml-list] Dynamic Programming
@ 2003-04-03 14:24 Daniel Andor
0 siblings, 0 replies; only message in thread
From: Daniel Andor @ 2003-04-03 14:24 UTC (permalink / raw)
To: caml-list; +Cc: ocaml_beginners
Hi,
I'm wondering about implementation of dynamic programming algorithms in
OCaml -- essentially, how does it relate to recursion? Does anyone have a
small example or good explanation?
At the moment I'm trying to implement Neville's algorithm, but of course
there are many other practical examples from bioinformatics etc.
There's an interesting webpage about dynamic programming in Haskell (which
is lazy):
http://www.csse.monash.edu.au/~lloyd/tildeStrings/Alignment/92.IPL.html
How would that approach translate to OCaml without losing all efficiency?
Thanks,
Daniel.
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2003-04-03 14:24 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2003-04-03 14:24 [Caml-list] Dynamic Programming Daniel Andor
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).