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. ...

Die verlustfreie Datenkompression auf Grundlage der Burrows-Wheeler-Transformation ist in den letzten Jahren aufgrund Ihrer Effizienz und bemerkenswerten Eleganz auf ein großes Interesse gestoßen. Selbst einfache Implementierungen erreichen Geschwindigkeiten und Kompressionsraten von bekannten kommerziellen Pr ogrammen. Die Burrows-Wheeler-Transformation basiert auf einer Permutation von Eingab...

Abstract Professor Hugh D. Burrows, Scientific Editor of Pure and Applied Chemistry , is stepping down at the end 2022 after serving as since 2014. IUPAC requests nominations and/or applications to succeed Burrows in this position. The mandate for will be maintain scientific standards, focus on international profile journal, explore creative ways engage with community digital 21st century. PAC ...

This paper reports on two case-studies of applying BAN logic to industrial strength security protocols. These studies demonstrate the flexibility of the BAN language, as it caters for the addition of appropriate constructs and rules. We argue that, although a semantical foundation of the formalism is lacking, BAN logic provides an intuitive and powerful technique for security analysis.

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...

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...

Although the deep sea is the largest ecosystem on Earth, its infaunal ecology remains poorly understood because of the logistical challenges. Here we report the morphology of relatively large burrows obtained by in situ burrow casting at a hydrocarbon-seep site and a non-seep site at water depths of 1173 and 1455 m, respectively. Deep and complex burrows are abundant at both sites, indicating t...

Scrambled Burrows-Wheeler transform [6] is an attempt to combine privacy (encryption) and data compression. We show that the proposed approach is insecure. We present chosen plaintext and known plaintext attacks and estimate their complexity in various scenarios.