2026-07-26T20:56:35Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1825 2024-03-06T10:33:11Z ddc:004 open_access

Reverse Engineering Prefix Tables Clement, Julien Crochemore, Maxime Rindone, Giuseppina Design and analysis of algorithms Algorithms on strings Pattern matching String matching Combinatorics on words Prefix table Suffix table 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Julien Clement and Maxime Crochemore and Giuseppina Rindone 2009 Is Part Of LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.STACS.2009.1825 urn:nbn:de:0030-drops-18258 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1825 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode