Weighted directed word graph

Authors:
Meng Zhang;Liang Hu;Qiang Li;Jiubin Ju
Affiliations:
College of Computer Science and Technology, Jilin University, Changchun, China;College of Computer Science and Technology, Jilin University, Changchun, China;College of Computer Science and Technology, Jilin University, Changchun, China;College of Computer Science and Technology, Jilin University, Changchun, China
Venue:
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Year:
2005

Citing 5
Cited 1

Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Automata for matching patterns

Handbook of formal languages, vol. 2
Direct Construction of Compact Directed Acyclic Word Graphs

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics

On the Structure of Consistent Partitions of Substring Set of a Word

FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Weighted Directed Word Graph is a new text-indexing structure which is based on a new compaction method on DAWG. WDWGs are basically cyclic, means that they may accept infinite strings. But by assigning weights to the edges, the acceptable strings are limited only to the substrings of input strings. The size of WDWGs is smaller than that of DAWGs both in theory and practice. A linear-time on-line construction algorithm for WDWGs is also presented.