Let \(\varSigma \) and \(\varPi be disjoint alphabets, respectively called the static alphabet parameterized alphabet. Two strings x y over \cup \varPi of equal length are said to match (p-match) if there exists a renaming bijection f on which is identity maps characters those so that two become identical. The indexing version problem finding p-matching occurrences given pattern in text well-st...

We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n over an alphabet of size σ ≤ n, our method builds the wavelet tree in O(n log σ/ √ logn) time, improving upon the state-of-the-art algorithm by a factor of √ log n. As a consequence, given an array of n integers we c...

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor aut...

The Tongan suffix -‘i has been variously analyzed as a transitivizer, a passive suffix, a perfective suffix, and a modifier of verbal semantics. It has a variety of effects on the valency and aspect of the verb to which it is affixed. The One Form/One Meaning Principle (Johns 1992) suggests that these various effects should be linked together. I show that the apparently divergent functions of -...