Binary block order Rouen Transform

Abstract

Please cite this article in press as: J.W. Daykin et al., Binary block order Rouen transform, Theoret. Comput. Sci. (2016), http://dx.doi.org/10.1016/j.tcs. 2016.05.028 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Highlights• Novel twin binary Burrows-Wheeler type transforms are introduced.• The transforms are defined for Lyndon-like B-words which apply binary block order.• We call this approach the B-BWT Rouen Transform.• These bijective Rouen transforms and inverses are computed in linear time.• Preliminary experimental results indicate potential value of binary transforms. Binary Block Order Rouen Transform

On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms

“…To date the only known BWT designed specifically for binary strings is the binary block order B-BWT [19]. This binary string sorting method prioritizes length, thus also exhibiting a suffix array with progression ratio −1.…”