Year: 1999
Type: conference-paper
Abstract: A border of a string x is a proper (but possibly empty) prex of x that is also a sux of x. The border array = [1::n] of a string x = x[1::n] is an array of nonnegative integers in which each element [i], 1 i n, is the length of the longest border of x[1::i]. In this paper we rst present a simple linear-time algorithm to determine whether or not a given array y = y[1::n] of integers is a border array of some string on an alphabet of unbounded size and then a slightly more complex linear-time algorithm for an alphabet of any given (bounded) size . We then consider the problem of generating all possible distinct border arrays of given length n on a bounded or unbounded alphabet, and doing so in time proportional to the number of arrays generated. A previously published algorithm that claims to solve this problem in constant time per array generated is shown to be incorrect, and new algorithms are proposed. We conclude with an equally ecient on-line algorithm for th...
Authors: František Franěk, Weixu Lu, Patrick J. Ryan, W.F. Smyth, Y. Sun, Liming Yang
Institution: McMaster University
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2592254475
