Let T [1, n] be a string of length n and T [i, j] be the substring of T starting at position i and
ending at position j. A substring T [i, j] of T is a repeat if it occurs more than once in T; …

Abstract Let T [1, n] be a text of length n and T [i, n] be the suffix starting at position i. Also, for
any two strings X and Y, let LCP (X, Y) denote their longest common prefix. The range-LCP …

Given a string T of length n over an alphabet Σ⊂{1, 2,…, n O (1)} of size σ, we are to
preprocess T so that given a range [i, j], we can return a representation of a shortest string …

Given a string T of length n over an alphabet Σ⊂{1, 2,..., nO (1)} of size σ, we are to
preprocess T so that given a range [i, j], we can return a representation of a shortest string …

Palindromes are strings that read the same forward and backward. Problems of computing
palindromic structures in strings have been studied for many years with a motivation of their …

Let T 1, n be a string of length n and T i, j be the substring of T starting at position i and
ending at position j. A substring T i, j of T is a repeat if it occurs more than once in T; …

Palindromes are strings that read the same forward and backward. Problems of computing
palindromic structures in strings have been studied for many years with the motivation of …

This thesis is devoted to designing and analyzing efficient text indexing data structures and
associated algorithms for processing text data. The general problem is to preprocess a given …