Data-Compression.org

data compression link collection

Sorting the matrix of two-sided contexts

Published in Burrows-Wheeler Transform/Block Sorting, Wavelets, Tutorials, Reference, Presentations

This article describes a variant on BWT that doesn’t use the cyclical rotations of strings used for BWT, but a different scheme. DCL reader points to a Burrows paper showing that this scheme is suboptimal.

http://geocities.com/eri32/slrm.htm

*        

admin
Posted in September 3rd, 2001

No User Commented In " Sorting the matrix of two-sided contexts "

Subscribes to this post Comment RSS or TrackBack URL

Leave Your Reply Below

 Username

 Email Address

 Website

Sticky note: Please double check your comments before submit Please Note: The comment moderation maybe active so there is no need to resubmit your comment