R. Grossi and G.F. Italiano. Suffix Trees and their Applications in String Algorithms. Manuscript, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Suffix Tree of a Tree and Minimizing Sequential Transducers - Breslauer (1995) (4 citations) (Correct)
....an efficient algorithm for the minimization of sequential transducers. 1 Introduction The suffix tree of a string is a compact trie representing all suffixes of the string. The suffix tree has proven to be an extremely useful data structure in a wide variety of string processing algorithms [3, 6]. Kosaraju [10] defined the generalized suffix tree of all suffixes of a set of strings which are represented by a tree. Kosaraju mentions that Weiner s [14] suffix tree construction algorithm can be easily modified to construct the suffix tree of a tree in O(n log n) time, and that it might even ....
....of the suffix tree, by using Theorem 2.2 and by observing that the longest common prefix of two suffixes is the label of the vertex in the suffix tree which is the lowest common ancestor of the leaves labeled with the two suffixes. For more properties and applications of suffix trees see [3, 6]. 2.1 The suffix tree of a tree Given a set of strings fw 1 ; w h g, we can represent these strings by the common suffix tree (abbreviate hereafter CS tree) which is a rooted trie that is defined as follows: 2 1. Each edge is labeled by a single alphabet symbol. 2. Each vertex is ....
R. Grossi and G.F. Italiano. Suffix Trees and their Applications in String Algorithms. Manuscript, 1995.
An overview of the Italian National Project on "Algorithms.. - Ausiello, d'Amore (Correct)
....also been studied. The concept of palindromic tree has been introduced. The detection of all the palindromic subtrees of a given binary tree has been solved in [178] The result has been extended to arbitrary trees in [179] These studies, together with other results, are summarized in [177] In [286] algorithmic techniques for the construction of suffix trees are surveyed, considering also generalizations of suffix trees in higher dimensions. New algorithms and data structures have been designed for pattern matching on structures of higher dimension. In particular, given an n Theta n matrix ....
R. Grossi and G. F. Italiano. Suffix trees and their applications in string algorithms. In Proc. 1st South American Workshop on String Processing (WSP 1993), pages 57--76, September 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC