Re: How to parse string to substrings based on character occurence in the string

What's more important?

That the subsequences contain as many * as possible?
That they are as long as possible? (Or short?)
Must the all subsequences recombine to form the original string?
Eg. If there is a 50 char section without a *, do you make the subsequences longer to cover it, or omit a bit of the string from the set of substrings?
Is the range 10-25 hard coded, or could you accept 1 or 2 shorter or longer?

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re: How to parse string to substrings based on character occurence in the string

Replies are listed 'Best First'.
Re^2: How to parse string to substrings based on character occurence in the string by ihperlbeg (Novice) on Mar 09, 2010 at 14:48 UTC
1. yes, the subsequence with as many * possible. that is of main importance 2. the range is 10-25. as long as the length of the subsequence falls in this range, it is accepted 3. no, not required. If there is a 50 char section without a *, do you make the subsequences longer to cover it--- No. Yes- omit a bit of the string from the set of substrings? 4. yes, only if 1 or 2 shorter or longer.	[reply]