Results 1 
7 of
7
Sturmian and episturmian words (A survey of some recent results)
 OF LECTURE NOTES IN COMPUT. SCI
, 2007
"... This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we s ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
(Show Context)
This survey paper contains a description of some recent results concerning Sturmian and episturmian words, with particular emphasis on central words. We list fourteen characterizations of central words. We give the characterizations of Sturmian and episturmian words by lexicographic ordering, we show how the BurrowsWheeler transform behaves on Sturmian words. We mention results on balanced episturmian words. We give a description of the compact suffix automaton of central Sturmian words.
REVERSE ENGINEERING PREFIX TABLES
, 2009
"... 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 efficient stringmatching and pattern extraction algorithms. These tables can be computed in linear time ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
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 efficient stringmatching and pattern extraction algorithms. These tables can be computed in linear time independently of the alphabet size. We give an algorithmic characterisation of a Prefix table (it can be adapted to a Suffix table). Namely, the algorithm tests if an integer table of size n is the Prefix table of some word and, if successful, it constructs the lexicographically smallest string having it as a Prefix table. We show that the alphabet of the string can be bounded to log 2 n letters. The overall algorithm runs in O(n) time.
On Bijective Variants of the BurrowsWheeler Transform
"... Abstract. The sort transform (ST) is a modification of the BurrowsWheeler transform (BWT). Both transformations map an arbitrary word of length n to a pair consisting of a word of length n and an index between 1 and n. The BWT sorts all rotation conjugates of the input word, whereas the ST of order ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. The sort transform (ST) is a modification of the BurrowsWheeler transform (BWT). Both transformations map an arbitrary word of length n to a pair consisting of a word of length n and an index between 1 and n. The BWT sorts all rotation conjugates of the input word, whereas the ST of order k only uses the first k letters for sorting all such conjugates. If two conjugates start with the same prefix of length k, then the indices of the rotations are used for tiebreaking. Both transforms output the sequence of the last letters of the sorted list and the index of the input within the sorted list. In this paper, we discuss a bijective variant of the BWT (due to Scott), proving its correctness and relations to other results due to Gessel and Reutenauer (1993) and Crochemore, Désarménien, and Perrin (2005). Further, we present a novel bijective variant of the ST. 1
Dynamic BurrowsWheeler Transform
, 2008
"... The BurrowsWheeler Transform is a building block for many text compression applications and selfindex data structures. It reorders the letters of a text T to obtain a new text bwt(T) which can be better compressed. This forward transform has been intensively studied over the years, but a major pro ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
The BurrowsWheeler Transform is a building block for many text compression applications and selfindex data structures. It reorders the letters of a text T to obtain a new text bwt(T) which can be better compressed. This forward transform has been intensively studied over the years, but a major problem still remains: bwt(T) has to be entirely recomputed whenever T is modified. In this article, we are considering standard edit operations (insertion, deletion, substitution of a letter or a factor) that are transforming a text T into T ′. We are studying the impact of these edit operations on bwt(T) and are presenting an algorithm that converts bwt(T) into bwt(T ′). Moreover, we show that we can use this algorithm for converting the suffix array of T into the suffix array of T ′. Even if the theoretical worstcase time complexity is O(T ), the experiments we conducted indicate that it performs really well in practice.
Maximal Palindromic Factorization
"... Abstract. A palindrome is a symmetric string, phrase, number, or other sequence of units sequence that reads the same forward and backward. We present an algorithm for maximal palindromic factorization of a finite string by adapting an Gusfield algorithm [15] for detecting all occurrences of maximal ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. A palindrome is a symmetric string, phrase, number, or other sequence of units sequence that reads the same forward and backward. We present an algorithm for maximal palindromic factorization of a finite string by adapting an Gusfield algorithm [15] for detecting all occurrences of maximal palindromes in a string in linear time to the length of the given string then using the breadth first search (BFS) to find the maximal palindromic factorization set. A factorization F of s with respect to S refers to a decomposition of s such that s = si1si2 · · · siℓ where sij ∈ S and ℓ is minimum. In this context the set S is referred to as the factorization set. In this paper, we tackle the following problem. Given a string s, find the maximal palindromic factorization of s, that is a factorization of s where the factorization set is the set of all centerdistinct maximal palindromes of a string s MP(s).