Abstract
The prefix table of a string x = x[1..n] is an array π = π[1..n] such that π[i] is the length of the longest substring beginning at i that equals a prefix of x. In this paper we describe and evaluate algorithms for prefix table construction, some previously proposed, others designed by us. We also describe and evaluate new linear-time algorithms for transformations between π and the border array.
The work of the first and third authors was supported in part by the Natural Sciences & Engineering Research Council of Canada. The second author was supported by a Marie Curie Intra-European Fellowship for Career Development.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, V.A., Hopcroft, J.E., Ullman, J.D.: The Design & Analysis of Computer Algorithms, p. 470. Addison-Wesley (1974)
Amir, A., Calinescu, G.: Alphabet-independent and scaled dictionary matching. J. Algorithms, Elsevier 34–62 (2000)
Amir, A., Landau, G.M., Sokol, D.: Inplace run-length 2d compressed search. In: Proc. 11th ACM-SIAM Symp. Discrete Algs., pp. 817–818. SIAM (2000)
Barton, C., Iliopoulos, C.S., Pissis, S., Smyth, W.F.: Prefix tables and border arrays with k-mismatches & applications (submitted for publication, 2013)
Christodoulakis, M., Ryan, P.J., Smyth, W.F., Wang, S.: Indeterminate strings, prefix arrays & undirected graphs (submitted for publication, 2013)
Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du Texte, p. 347, Vuibert (2001)
Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, p. 383. Cambridge University Press (2007)
Galil, Z., Park, K.: Truly alphabet-independent two-dimensional pattern matching. In: Proc. 33rd IEEE Symp. Found. Computer Science, pp. 247–256. IEEE (1992)
Gusfield, D.: Algorithms on Strings, Trees & Sequences, p. 534. Cambridge University Press (1997)
Lothaire, M.: Applied Combinatorics on Words, p. 610. Cambridge University Press (2005)
Main, M.G., Lorentz, R.J.: An O(n logn) algorithm for finding all repetitions in a string. J. Algorithms 5, 422–432 (1984)
Smyth, B.: Computing Patterns in Strings, p. 423. Pearson Addison-Wesley (2003)
Smyth, W.F., Wang, S.: New perspectives on the prefix array. In: Amir, A., Turpin, A., Moffat, A. (eds.) SPIRE 2008. LNCS, vol. 5280, pp. 133–143. Springer, Heidelberg (2008)
Vishkin, U.: Optimal parallel pattern matching in strings. Information and Control, Elsevier, 91–113 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bland, W., Kucherov, G., Smyth, W.F. (2013). Prefix Table Construction and Conversion. In: Lecroq, T., Mouchard, L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45278-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-45278-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45277-2
Online ISBN: 978-3-642-45278-9
eBook Packages: Computer ScienceComputer Science (R0)