REVERSE ENGINEERING PREFIX TABLES

DOI10.4230/LIPIcs.STACS.2009.1825zbMath1236.68306OpenAlexW1534830854MaRDI QIDQ5389985

Julien Clément, Giuseppina Rindone, Maxime Crochemore

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_95a0.html

zbMATH Keywords

string matchingpattern matchingcombinatorics on wordsalgorithms on stringsdesign and analysis of algorithmsprefix tablesuffix table

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items (18)

Universal Reconstruction of a String ⋮ On left and right seeds of a string ⋮ Validating the Knuth-Morris-Pratt failure function, fast and online ⋮ Recognizing union-find trees is NP-complete ⋮ Inferring strings from position heaps in linear time ⋮ Reconstructing a string from its Lyndon arrays ⋮ Constructing an indeterminate string from its associated graph ⋮ Representing prefix and border tables: results on enumeration ⋮ Verifying and enumerating parameterized border arrays ⋮ When a dollar makes a BWT ⋮ A new approach to regular \& indeterminate strings ⋮ Indeterminate strings, prefix arrays \& undirected graphs ⋮ Inferring strings from suffix trees and links on a binary alphabet ⋮ Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info ⋮ Universal reconstruction of a string ⋮ Inferring an indeterminate string from a prefix graph ⋮ A suffix tree or not a suffix tree? ⋮ String inference from longest-common-prefix array

This page was built for publication: REVERSE ENGINEERING PREFIX TABLES