Inferring strings from suffix trees and links on a binary alphabet

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

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. 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.

Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference 2011
PublisherPrague Stringology Club
Pages121-130
Number of pages10
ISBN (Print)9788001048702
Publication statusPublished - Jan 1 2011
EventPrague Stringology Conference 2011, PSC 2011 - Prague, Czech Republic
Duration: Aug 29 2011Aug 31 2011

Publication series

NameProceedings of the Prague Stringology Conference 2011

Other

OtherPrague Stringology Conference 2011, PSC 2011
CountryCzech Republic
CityPrague
Period8/29/118/31/11

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Inferring strings from suffix trees and links on a binary alphabet'. Together they form a unique fingerprint.

Cite this