Hi there:
You could try optimizedPaa instead of paa function, it should be faster and possibly less space-consuming.
In the code, I have followed a reshape transform algorithm borrowed from MatLab code, these days I think that it could be done easier, without allocating huge matrices, but I can not get free time to work on this, maybe later.
Also. You see, in all the work I do, we rarely use the whole series transform into string - since this causes a huge loss of information - typically we use sliding window. Sliding window allows to capture local features very well, while "holistic" approach will lose them.
If the series is not normal, then, for better performance, you'd need to build your own Alphabet based on the observed distribution. The new alphabet should guarantee equal probability for each letter.
In fact, if you use sliding window, then you can compare series of different length and point distribution, because short subsequences (from sliding window) will likely to be normally distributed.