bs P.
I hope I have cleared things up a bit and thank for all the advice so far!
Mike
Am 26.06.2013 um 15:58 schrieb Raul Miller :
> On Wed, Jun 26, 2013 at 4:37 AM, Mike Müller wrote:
>> I hope this is not too simple a question for this list, but I'm still
>> learning J and won
Hello!
I hope this is not too simple a question for this list, but I'm still learning
J and wonder how to do a simple backtracking in J.
For instance, I might want to see what is the longest string consisting of a,b,
and c, that fulfills some property P.
In any imperative language (here: ruby) I
I asked about this problem in #jsoftware on Freenode, where it was mentioned to
me that this might be of broader interest,
so I will repeat my question here and hope to get some other interested in this
topic.
I am interested in finding squares in strings. A square is a string of the form
uu, f
Sorry for dragging up such an old thread, but I just read this and wanted to
remark, that it's essential for the BWT to sort on all characters.
There's a variant called Sort Transform (or sometimes Schindler Transform) that
only sorts the cyclic shifts according to the first k characters.
See, fo
