Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/10783
Title: Compact morphic directed acyclic word graphs
Authors: Luk, RWP 
Issue Date: 2001
Publisher: Oxford Univ Press
Source: Computer journal, 2001, v. 44, no. 5, p. 425-434 How to cite?
Journal: Computer Journal 
Abstract: A directed acyclic word graph (DAWG) represents all factors of a string t over σ. By some isomorphism h : Σ* → (σq)*, the string t can be transformed into h(t), the factors of which are represented by another DAWG, called the morphic DAWG, over a different alphabet σ. Depending on h, t has many morphic DAWGs, which exhibit time-space trade-off compared with the original DAWG. The bounds for storage reduction and time-space efficiency between DAWG and its morphic DAWGs implemented as tables are derived, as well as for their optimal points. Likewise, the storage increases, comparing the morphic DAWG implemented as tables and DAWGs implemented using bucket arrays, are also derived. The bounds of storage increase have global minimum when |σ| = 3. Experiments show that round-off errors degrade storage reduction and time-space efficiency, so that q should be well chosen (i.e.|σ| q = |Σ|). The compact morphic DAWG was found to be more space efficient than both the corresponding morphic DAWG and the compact DAWG. The compact morphic DAWGs over the binary alphabet require the least storage but the access speed is slower than those over the ternary alphabet. The space demand of compact morphic DAWGs is of similar order (within a factor of 3.3) of the bucket-array implementation of DAWGs.
URI: http://hdl.handle.net/10397/10783
ISSN: 0010-4620
DOI: 10.1093/comjnl/44.5.425
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Feb 10, 2018

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Feb 22, 2018

Page view(s)

66
Last Week
0
Last month
Citations as of Feb 19, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.