A speed-up for the commute between subword trees and DAWGs

Authors:
Alberto Apostolico;Stefano Lonardi
Affiliations:
DEI, University of Padova, Via Gradenigo 6/A, I-35131 Padova, Italy and Computer Sciences Department, Purdue University, West Lafayette, IN;DEI, University of Padova, Via Gradenigo 6/A, I-35131 Padova, Italy and Computer Sciences Department, Purdue University, West Lafayette, IN
Venue:
Information Processing Letters
Year:
2002

Citing 5
Cited 3

Complete inverted files for efficient text retrieval and analysis

Journal of the ACM (JACM)
Text algorithms

Text algorithms
Pattern matching algorithms

Pattern matching algorithms
A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
On-line construction of compact directed acyclic word graphs

Discrete Applied Mathematics
Near real-time suffix tree construction via the fringe marked ancestor problem

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

A popular way to describe and build the DAWG or Directed Acyclic Word Graph of a string is by transformation of the corresponding subword tree. This transformation, which is not difficult to reverse, is easy to grasp and almost trivial to implement except for the assumed implication of a standard tree isomorphism algorithm. Here we point out a simple property of subword trees that makes checking tree isomorphism in this context a straightforward process, thereby simplifying the transformation significantly. Subword trees and DAWGs arise rather ubiquitously in applications of string processing, where they often play complementary roles. Efficient conversions are thus especially desirable.