Have you considered sorting different permutations of your strings and then perform binary search on them?
This paper talks about the technique: http://portal.acm.org/citation.cfm?id=1242592 On May 30, 9:55 pm, joshua-choi <rbysam...@gmail.com> wrote: > Let's say that I have a set of strings, each three English letters > long. > > How can I determine which strings differ only at one location (e.g. > "xxe" and "xbe")? > > Right now, I'm writing a loop that sequentially compares every string > to every other string. I think that there's a better way, but I don't > know where to start. -- 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
