The book is intended for lectures on string processes and pattern matching in Master's
courses of computer science and software engineering curricula. The details of algorithms …

arXiv:cs/0502073v1 [cs.DS] 17 Feb 2005 Page 1 arXiv:cs/0502073v1 [cs.DS] 17 Feb 2005 A
note on the Burrows-Wheeler transformation Maxime Crochemore Jacques Désarménien …

A suffix tree is a fundamental data structure for string processing and information retrieval,
however, its structure is still not well understood. The suffix trees reverse engineering …

The Prefix table of a string reports for each position the maximal length of its prefixes starting
here. The Prefix table and its dual Suffix table are basic tools used in the design of the most …

Abstract The Burrows-Wheeler-Transform (BWT) is a reversible string transformation which
plays a central role in text compression and is fundamental in many modern bioinformatics …

We consider the suffix array for parameterized binary strings that consist of only two types of
parameter symbols. We show that the parameterized suffix array, as well as its longest …

A proper factor u of a string y is a cover of y if every letter of y is within some occurrence of u
in y. The concept generalises the notion of periods of a string. An integer array C is the …

The suffix array, perhaps the most important data structure in modern string processing, is
often augmented with the longest common prefix (LCP) array which stores the lengths of the …

We present a bijective characterization of suffix array permutations obtained from a
characterization of Burrows–Wheeler arrays given in [1]. We show that previous …

In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and
suffix links of its internal nodes, we ask the question “Is τ a suffix tree?”, ie, is there a string S …