BWT any suggestions to improve this?

[Dan Kortschak]

I was just having a play implementing a simple BWT code.

Here's what I came up with: http://play.golang.org/p/coOUXB_g07

Any suggestions to improve this?

Dan

[Dan Kortschak]

A little more polish: http://play.golang.org/p/HV2DFUyHkY

[Ingo Oeser]

Hi Dan,

On Wednesday, October 9, 2013 2:50:26 PM UTC+2, kortschak wrote:

A little more polish: http://play.golang.org/p/HV2DFUyHkY

You can fold the equality into the else path, because you already return true, after the if triggers 

and the compare won't change the result anymore.

http://play.golang.org/p/5BNbJGerg2

Best Regards

Ingo

[Ingo Oeser]

It get's even more simple:

http://play.golang.org/p/JjvFSz4D-q

[Dan Kortschak]

Yeah, I've been working on it, but not sending here. It gets even
simpler - something I have from last week:

http://play.golang.org/p/kEi1PyS-Wh

Dan

[Dan Kortschak]

And merging in some of the things you had:

http://play.golang.org/p/eLzHRXJosP

[Dan Kortschak]

Now with added concision:

http://play.golang.org/p/yHn_4fDGPS

[Robert Syme]

If you are happy to borrow from stdlib, the index/suffixarray package contains code that will generate a suffix array very quickly (n log n). The important functions are not exported, so they are copied in the example below.

Once you have the suffix array, it's not difficult to generate the bwt:

http://play.golang.org/p/UhY4mF-LUf