We present the first worst-case linear-time algorithm to compute the Lempel–Ziv 78
factorization of a given string over an integer alphabet. Our algorithm is based on nearest …

We propose a new indexing structure for parameterized strings, called parameterized
position heap. Parameterized position heap is applicable for parameterized pattern …

Two strings of equal length are said to parameterized match if there is a bijection that maps
the characters of one string to those of the other string, so that two strings become identical …

We propose a simple linear-time on-line algorithm for constructing a position heap for a
string (Ehrenfeucht et al., 2011 [8]). Our definition of position heap differs slightly from the …

Let\varSigma and\varPi be disjoint alphabets of respective size σ and π. Two strings
over\varSigma ∪\varPi of equal length are said to parameterized match (p-match) if there is …

Suffix trees are highly regarded data structures for text indexing and string algorithms
[MCreight 76, Weiner 73]. For any given string w of length n=| w|, a suffix tree for w takes O …

The suffix tree, DAWG, and CDAWG are fundamental indexing structures of a string, with a
number of applications in bioinformatics, information retrieval, data mining, etc. An edge …

We present several results about position heaps, a relatively new alternative to suffix trees
and suffix arrays. First, we show that if we limit the maximum length of patterns to be sought …

A labeled tree (or a trie) is a natural generalization of a string which can also be seen as a
compact representation of a set of strings. This paper considers the labeled tree indexing …

Searching for occurrences of a substring in a text is a common operation familiar to anyone
who uses a text editor, word processor, or web browser. It is also the case that algorithms for …