Presentation 2007-04-26
On an Efficient off-Line Construction of Property Suffix Trees
Takashi UEMURA, Takuya KIDA, Hiroki ARIMURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In some intelligent application of text retrieval, it is required to do a search just through particular parts of target text data with consideration for some properties that the text have. Namely, the texts are followed by additional information, and the each target part satisfies a certain condition on it. In this paper, we address the problem to construct an efficient index structure for this kind of search. In 2006, Amir et al. proposed a modified suffix tree for this problem, called the property suffix tree, which stores only substrings that belong to the given property. This algorithm constructs a suffix tree at first, and then pluning edges indicating substrings which are not included in the property. In this paper, we present an algorithm for finding all borders between nodes to be remained and nodes to be eliminated in the suffix tree.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # COMP2007-10
Date of Issue

Conference Information
Committee COMP
Conference Date 2007/4/19(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On an Efficient off-Line Construction of Property Suffix Trees
Sub Title (in English)
Keyword(1)
1st Author's Name Takashi UEMURA
1st Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University()
2nd Author's Name Takuya KIDA
2nd Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University
3rd Author's Name Hiroki ARIMURA
3rd Author's Affiliation Graduate School of Information Science and Technology, Hokkaido University
Date 2007-04-26
Paper # COMP2007-10
Volume (vol) vol.107
Number (no) 24
Page pp.pp.-
#Pages 8
Date of Issue