TY - GEN

T1 - Inferring strings from suffix trees and links on a binary alphabet

AU - I, Tomohiro

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2011/1/1

Y1 - 2011/1/1

N2 - 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. By introducing new characterizations of suffix trees, we show that the reverse engineering problem on suffix trees on a binary alphabet can be solved in linear time in the input size.

AB - 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. By introducing new characterizations of suffix trees, we show that the reverse engineering problem on suffix trees on a binary alphabet can be solved in linear time in the input size.

UR - http://www.scopus.com/inward/record.url?scp=80055045310&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80055045310&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:80055045310

SN - 9788001048702

T3 - Proceedings of the Prague Stringology Conference 2011

SP - 121

EP - 130

BT - Proceedings of the Prague Stringology Conference 2011

PB - Prague Stringology Club

T2 - Prague Stringology Conference 2011, PSC 2011

Y2 - 29 August 2011 through 31 August 2011

ER -