Burrows-Wheeler Transform Part2

All right, all right, all right. Calm down. Why don't you hit the showers, and I'll walk the people through the rest of the algorithm, all right? Good job today. Good job. I don't think he's got a shot at that one.
Anyhow, thanks to Magnus, we've got a recreated permutation table alongside a nifty row index that we output during the encoding phase. Since this matrix over there is identical to the post-sorted one from the encoder, the fourth row actually contains the original input string, "BANANA." See?
Pretty easy stuff. Oh, and to be clear, kids, training to be a world champion at sorting requires a lot of practice and dedication. So eat your vegetables and listen to your parents.
MALE SPEAKER: Take one. COLT MCANLIS: How do you make your hair do that? MALE SPEAKER: Lots and lots of gel. COLT MCANLIS: Really? I'm gel-ous, and not just because it's a pun. Nice.
It'll take him a second. In 1994, Mike Burrows and David Wheeler were set up to be the title fight at the second annual UFC championship in Las Vegas, Nevada. But before the fight, while playing a few rounds of pai gow, the two ended up creating the Burrows-Wheeler Transform algorithm.
MIKE BURROWS: That isn't really true. COLT MCANLIS: No, no. No, it is not.
Um-- ha. You know, one of the problems about working at Google is you can't really throw a stone around here without hitting the inventor of some amazing algorithm. Ladies and gentlemen, I want to introduce you to the co-inventor of the Burrows-Wheeler Transform, Mr. Mike Burrows. Mike, it's fantastic to see you. Maybe if you have a second, can you sit down and talk to us a little bit about your algorithm?
MIKE BURROWS: Certainly. I'd like to put you straight about that title fight. COLT MCANLIS: OK. So I guess at the beginning, let's start there. MIKE BURROWS: Well, it really started with David Wheeler.
He was on the faculty of the University of Cambridge, but on sabbatical at Bell Labs, and working on compression. And he came up with the algorithm there. I only learned about it some years later when I became his graduate student.
COLT MCANLIS: In the world of data compression, Burrows-Wheeler Transform just stands alone against everything else. There's nothing really like it. How did you all come up with it? MIKE BURROWS: Well, I asked David what was going through his mind when he came up with it originally.
And he didn't know. He could not explain to me how he came up with that particular algorithm. I got the impression that he was playing around with sorting the contexts of characters that were to be encoded and using that as a good predictor. And then he must have realized that it was possible to invert that sort under certain conditions. COLT MCANLIS: Did you and Mike kind of co-create the article together?