Inferring strings from suffix trees and links on a binary alphabet

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

5 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2011
出版社Prague Stringology Club
ページ121-130
ページ数10
ISBN(印刷版)9788001048702
出版ステータス出版済み - 1 1 2011
イベントPrague Stringology Conference 2011, PSC 2011 - Prague, チェコ共和国
継続期間: 8 29 20118 31 2011

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2011

その他

その他Prague Stringology Conference 2011, PSC 2011
Countryチェコ共和国
CityPrague
Period8/29/118/31/11

All Science Journal Classification (ASJC) codes

  • Mathematics(all)

フィンガープリント 「Inferring strings from suffix trees and links on a binary alphabet」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル