in reply to Permutation with repetitions
An additional complexity to the problem is that I have some characters, say "x", in the string which are not to be counted, i.e.
aaaabccbaxxxcbddadcc...
So if n=3 as in the example any substring of size 3 that includes an x needs to be ignored and not counted.
Any ideas on that?
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Permutation with repetitions
by BrowserUk (Patriarch) on Jun 08, 2010 at 12:54 UTC | |
by umeboshi (Acolyte) on Jun 08, 2010 at 13:16 UTC | |
by space_agent (Acolyte) on Jun 12, 2010 at 20:32 UTC | |
by BrowserUk (Patriarch) on Jun 12, 2010 at 20:48 UTC | |
|
Re^2: Permutation with repetitions
by moritz (Cardinal) on Jun 08, 2010 at 12:33 UTC |