License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1825
URN: urn:nbn:de:0030-drops-18258
URL: http://drops.dagstuhl.de/opus/volltexte/2009/1825/
Go to the corresponding LIPIcs Volume Portal


Clement, Julien ; Crochemore, Maxime ; Rindone, Giuseppina

Reverse Engineering Prefix Tables

pdf-format:
Document 1.pdf (178 KB)


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 $\log_2 n$ letters. The overall algorithm runs in $O(n)$ time.

BibTeX - Entry

@InProceedings{clement_et_al:LIPIcs:2009:1825,
  author =	{Julien Clement and Maxime Crochemore and Giuseppina Rindone},
  title =	{{Reverse Engineering Prefix Tables}},
  booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{289--300},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-09-5},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{3},
  editor =	{Susanne Albers and Jean-Yves Marion},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/1825},
  URN =		{urn:nbn:de:0030-drops-18258},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2009.1825},
  annote =	{Keywords: Design and analysis of algorithms, Algorithms on strings, Pattern matching, String matching, Combinatorics on words, Prefix table, Suffix table }
}

Keywords: Design and analysis of algorithms, Algorithms on strings, Pattern matching, String matching, Combinatorics on words, Prefix table, Suffix table
Seminar: 26th International Symposium on Theoretical Aspects of Computer Science
Issue Date: 2009
Date of publication: 19.02.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI