Inferring strings from suffix trees and links on a binary alphabet

Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

研究成果: Contribution to journalArticle査読

14 被引用数 (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. 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.

本文言語英語
ページ(範囲)316-325
ページ数10
ジャーナルDiscrete Applied Mathematics
163
PART 3
DOI
出版ステータス出版済み - 1 30 2014

All Science Journal Classification (ASJC) codes

  • 離散数学と組合せ数学
  • 応用数学

フィンガープリント

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

引用スタイル