Is there an efficient method to find all "continuous" substrings of a string. For example, in the word "green", I'd like to parse out:
g, r, e, e, n, gr, re, ee, en, gre, ree, and so on... A for loop with a substr command works, but the program is taking forever to run. I'm doing this for about 20,000 strings with max(string) = 50 and min(string) = 1 for all strings in the set. I'm comparing these parsed substrings to another string and flagging any matches. Thanks, Chris. -------------------------------------------------------------------- Chris Staskewicz http://www.ZyGob.com/cjs http://www.math.utah.edu/~cjs -------------------------------------------------------------------- _______________________________________________ Boston-pm mailing list [EMAIL PROTECTED] http://mail.pm.org/mailman/listinfo/boston-pm
