检索结果-内蒙古大学图书馆

On-line construction of compact directed acyclic word graphs

DISCRETE APPLIED MATHEMATICS 2005年第2期146卷 156-179页

作者： Inenaga, S Hoshino, H Shinohara, A Takeda, M Arikawa, S Mauri, G Pavesi, G Kyushu Univ Dept Informat Fukuoka 812 Japan Univ Milan Biccoca Dept Comp Sci Syst & Commun Milan Italy

Many different index structures, providing efficient solutions to problems related to pattern matching, have been introduced so far. Examples of these structures are suffix trees and directed acyclic word graphs (DAWGs), which can be efficiently constructed in linear time and space. Compact directed acyclic word graphs (CDAWGs) are an index structure preserving some features of both suffix trees and DAWGs, and require less space than both of them. An algorithm which directly constructs CDAWGs in linear time and space was first introduced by Crochemore and Verin, based on McCreight's algorithm for constructing suffix trees. In this work, we present a novel on-line linear-time algorithm that builds the CDAWG for a single string as well as for a set of strings, inspired by Ukkonen's on-line algorithm for constructing suffix trees. (C) 2004 Elsevier B.V. All rights reserved.

关键词： pattern matching on strings compact directed acyclic word graphs directed acyclic word graphs suffix trees on-line and linear-time algorithms

来源：评论

学校读者我要写书评

暂无评论

Ternary directed acyclic word graphs

引用

THEORETICAL COMPUTER SCIENCE 2004年第1-2期328卷 97-111页

作者： Miyamoto, S Inenaga, S Takeda, M Shinohara, A Univ Helsinki Dept Comp Sci FIN-00014 Helsinki Finland Kyushu Univ Dept Informat Fukuoka 8128581 Japan

Given a set S of strings, a DFA accepting S offers a very time-efficient solution to the pattern matching problem over S. The key is how to implement such a DFA in the trade-off between time and space, and especially the choice of how to implement the transitions of each state is critical. Bentley and Sedgewick proposed an effective tree structure called ternary trees. The idea of ternary trees is to 'implant' the process of binary search for transitions into the structure of the trees themselves. This way the process of binary search becomes visible, and the implementation of the trees becomes quite easy. The directed acyclic word graph (DAWG) of a string w is the smallest DFA that accepts all suffixes of w, and requires only linear space. We apply the scheme of ternary trees to DAWGs, introducing a new data structure named ternary DAWGs (TDAWGs). Furthermore, the scheme of AVL trees is applied to the TDAWGs, yielding a more time-efficient structure AVL TDAWGs. We also perform some experiments that show the efficiency of TDAWGs and AVL TDAWGs, compared to DAWGs in which transitions are implemented by linked lists. (C) 2004 Elsevier B.V. All rights reserved.

关键词： deterministic finite state automata pattern matching on strings directed acyclic word graphs ternary search trees AVL trees

来源：评论

学校读者我要写书评

暂无评论

Ternary directed acyclic word graphs 8th

Ternary directed acyclic word graphs

引用

8th International Conference on Implementation and Application of Automata (CIAA 03)

作者： Miyamoto, S Inenaga, S Takeda, M Shinohara, A Univ Helsinki Dept Comp Sci FIN-00014 Helsinki Finland Kyushu Univ Dept Informat Fukuoka 8128581 Japan

ISBN: (纸本)3540405615

关键词： deterministic finite state automata pattern matching on strings directed acyclic word graphs ternary search trees AVL trees

来源：评论

学校读者我要写书评

暂无评论

On-line construction of compact directed acyclic word graphs 1

引用

12th Annual Symposium on Combinatorial pattern matching (CPM 2001)

作者： Inenaga, S Hoshino, H Shinohara, A Takeda, M Arikawa, S Mauri, G Pavesi, G Kyushu Univ Dept Informat Fukuoka 812 Japan Univ Milan Biccoca Dept Comp Sci Syst & Commun Milan Italy

ISBN: (数字)9783540481942

ISBN: (纸本)9783540422716

关键词： pattern matching on strings compact directed acyclic word graphs directed acyclic word graphs suffix trees on-line and linear-time algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：