Conference
New Perspectives on the Prefix Array
Abstract
In this paper we consider the of a string in which and, for i > 1, iff k is the largest integer such that . The prefix array is closely related to the : an integer array [1..n] such that iff the length of the longest border of is k. Border arrays or their variants are used in many string algorithms and prefix arrays can be used directly for pattern-matching. It is well known that for regular strings provides all the information that …
Authors
Smyth WF; Wang S
Series
Lecture Notes in Computer Science
Volume
5280
Pagination
pp. 133-143
Publisher
Springer Nature
Publication Date
2008
DOI
10.1007/978-3-540-89097-3_14
Conference proceedings
Lecture Notes in Computer Science
ISSN
0302-9743