Elsevier

Discrete Applied Mathematics

Volume 163, Part 3, 30 January 2014, Pages 316-325
Discrete Applied Mathematics

Inferring strings from suffix trees and links on a binary alphabet

https://doi.org/10.1016/j.dam.2013.02.033Get rights and content
Under an Elsevier user license
open archive

Abstract

A suffix tree, which provides us with a linear space full-text index of a given string, is a fundamental data structure for string processing and information retrieval. In this paper we consider the reverse engineering problem on suffix trees: given an unlabeled ordered rooted tree T accompanied with a node-to-node transition function f, infer a string whose suffix tree and its suffix links for inner nodes are isomorphic to T and f, respectively. Also, we consider the enumeration problem in which we enumerate all strings corresponding to an input tree and links. By introducing new characterizations of suffix trees, we show that the reverse engineering problem and the enumeration problem on suffix trees on a binary alphabet can be solved in optimal time.

Keywords

Reverse engineering problem
Enumeration problem
Suffix trees

Cited by (0)