Reverse Engineering Prefix Tables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Reverse Engineering Prefix Tables


The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the design of the most efficient string-matching and pattern extraction algorithms. These tables can be computed in linear time independently of the alphabet size. We give an algorithmic characterisation of a Prefix table (it can be adapted to a Suffix table). Namely, the algorithm tests if an integer table of size n is the Prefix table of some word and, if successful, it constructs the lexicographically smallest string having it as a Prefix table. We show that the alphabet of the string can be bounded to log2 n letters. The overall algorithm runs in O(n) time.
Fichier principal
Vignette du fichier
24-clement.pdf (240.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00359304 , version 1 (06-02-2009)


  • HAL Id : inria-00359304 , version 1


Julien Clément, Maxime Crochemore, Giuseppina Rindone. Reverse Engineering Prefix Tables. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.289-300. ⟨inria-00359304⟩
312 View
321 Download


Gmail Facebook X LinkedIn More