In 1994, Burrows and Wheeler [5] developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in order to improve their algorithm, which is based on a reversible transformation of the input string, called BWT (the Burrows-Wheeler transformation). In this paper, we propose a compression scheme based on BWT, M...

Christopher H. Wheeler is a research officer in the Research division of the Bank. He previously was an assistant professor of economics at Tulane University in New Orleans. Wheeler received his doctoral and master’s degrees in economics from the University of Wisconsin-Madison in 1998 and 1995, respectively, and his bachelor’s degree in economics from Colby College in Waterville, Maine, in 199...

January 14, 2017 Title An R package for subset-based association analysis of heterogeneous traits and subtypes Version 1.12.0 Date 2015-06-01 Author Samsiddhi Bhattacharjee, Nilanjan Chatterjee and William Wheeler Description An R package for subset-based analysis of heterogeneous traits and subtypes. Maintainer William Wheeler Depends MASS, msm, rmeta, mvtnorm, tmvnsim Su...

This thesis examines two modifications of the Burrows-Wheeler compression algorithm. The effect of non-standard sort orders during the sorting phase of the Burrows-Wheeler transform is analyzed and a new method to find good sort orders developed and compared to previous work. The process is generalized to allow multiple sort orders in the transform and the reversibility in some cases is shown. ...

John A. Wheeler a, Mary F. Wheeler b and Ivan Yotov c a Texas Institute for Computational and Applied Mathematics (TICAM), The University of Texas at Austin, Austin, TX 78712, USA E-mail: [email protected] b TICAM, Department of Aerospace Engineering & Engineering Mechanics, and Department of Petroleum and Geosystems Engineering, The University of Texas at Austin, Austin, TX 78712, USA ...

The Burrows–Wheeler transform is a powerful tool for data compression and has been the focus of intense research in the last decade. Little attention, however, has been paid to the inverse transform, even though it is a bottleneck in decompression. We introduce three new inversion algorithms with improved performance in a wide range of the space-time spectrum, as confirmed by both theoretical a...

This report investigates two approaches for online pattern-matching in files compressed with the Burrows-Wheeler transform (Burrows & Wheeler 1994). The first is based on the Boyer-Moore pattern matching algorithm (Boyer & Moore 1977), and the second is based on binary search. The new methods use the special structure of the BurrowsWheeler transform to achieve efficient, robust pattern matching...

The Burrows-Wheeler Transformation computes a permutation of a string of letters over an alphabet, and is well-suited to compression-related applications due to its invertability and data clustering properties. For space e ciency the input to the transform can be preprocessed into Lyndon factors. We consider scenarios with uncertainty regarding the data: a position in an indeterminate or degene...

Not long ago I witnessed a remarkable interchange between two great thinkers: the cosmologist and physicist John Archibald Wheeler, and the philosopher of science Sir Karl Popper. Popper and Wheeler were meeting with a dozen other philosophers and scientists at Schloss Kronberg, the Victorian castle built by Kaiser Wilhelm's mother outside of Frankfurt during the closing years of the nineteenth...

In this paper we present an algorithm to compute the Lyndon array of a string T of length n as a byproduct of the inversion of the Burrows-Wheeler transform of T . Our algorithm runs in linear time using only a stack in addition to the data structures used for Burrows-Wheeler inversion. We compare our algorithm with two other linear-time algorithms for Lyndon array construction and show that co...