BWTS explanation?

[TopQuark]

Hi,

Can someone please point me to an explanation of the BWTS algorithm (bijective BWT) and how it works, in English?

I have got the source code, but I'm not a C programmer and I'd prefer to read the full explanation, not try to reverse-engineer the code.

Thanks!

[Matt Mahoney]

I think only David Scott knows for sure. I think the idea is to divide a block into smaller blocks so that the reverse BWT always starts at a predictable location so you don't have to send the starting index.

[pat357]

Hi,
Can someone please point me to an explanation of the BWTS algorithm (bijective BWT) and how it works, in English?
I have got the source code, but I'm not a C programmer and I'd prefer to read the full explanation, not try to reverse-engineer the code.

Take a look at : http://bijective.dogma.net/compresa.htm

[TopQuark]

To answer my own question, I found a great explanation here by Klaus Stengel:

http://groups.google.com/group/comp....36d754e869212?

TQ

[biject.bwts]

To answer my own question, I found a great explanation here by Klaus Stengel:

http://groups.google.com/group/comp....36d754e869212?

TQ

The back and forth with Klaus has helped many. I also have
explained to several people exactly how it works. I am
currently in a back and forth with someone and we are
hammering out a clear and concise description of exactly
what it does. Please hold on for just a few weeks more
you will not be disappointed. It will replace the BWT with
something far better and it will be more understandable
than the old BWT.

[nanoflooder]

That sounds very promising Can't wait to see it in action