Inferring strings from suffix trees and links on a binary alphabet

研究成果: ジャーナルへの寄稿記事

8 引用 (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

Fingerprint

Suffix Tree
Reverse engineering
Strings
Binary
Information retrieval
Reverse Engineering
Data structures
Enumeration
Vertex of a graph
Ordered Trees
Processing
Suffix
Rooted Trees
Linear Space
Information Retrieval
Data Structures
Isomorphic

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

これを引用

Inferring strings from suffix trees and links on a binary alphabet. / Tomohiro, I.; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

:: Discrete Applied Mathematics, 巻 163, 番号 PART 3, 30.01.2014, p. 316-325.

研究成果: ジャーナルへの寄稿記事

@article{83812439cee548a79cbd5c53c258bb12,
title = "Inferring strings from suffix trees and links on a binary alphabet",
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.",
author = "I. Tomohiro and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",
year = "2014",
month = "1",
day = "30",
doi = "10.1016/j.dam.2013.02.033",
language = "English",
volume = "163",
pages = "316--325",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "PART 3",

}

TY - JOUR

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

AU - Tomohiro, I.

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

PY - 2014/1/30

Y1 - 2014/1/30

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

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

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

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

U2 - 10.1016/j.dam.2013.02.033

DO - 10.1016/j.dam.2013.02.033

M3 - Article

VL - 163

SP - 316

EP - 325

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - PART 3

ER -