This may be slightly off topic, but your "longest contiguous common subsequence" problem sounds like the "longest common substring" problem. Your code uses the dynamic programming solution, which is O(M*N), but there are O(M+N) algorithms that might be faster depending on the length and "alphabet" of your input sequences.
On Monday, February 18, 2013 11:16:51 PM UTC-5, Geo wrote: > > Hello, > > I am cross-posting my Clojure question from StackOverflow. I am trying to > get an algorithm in Clojure to match Java speed and managed to get the > performance to within one order of magnitude and wondering if more is > possible. The full question is here: > > > http://stackoverflow.com/questions/14949705/clojure-performance-for-expensive-algorithms > > Thank you. > -- -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
