Skip to Main content Skip to Navigation
Conference papers

Reverse Engineering Prefix Tables

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/inria-00359304
Contributor : Publications Loria <>
Submitted on : Friday, February 6, 2009 - 3:15:08 PM
Last modification on : Wednesday, February 3, 2021 - 7:54:26 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 7:13:06 PM

File

24-clement.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00359304, version 1

Citation

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⟩

Share

Metrics

Record views

542

Files downloads

358