E. M. McCreight, A space-economical suffix tree construction algorithm, Journal of the ACM, 23(2), 1976, 262-272.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Approximation Algorithms For The Shortest - Common Superstring Problem (Correct)
....A more compact representation can be obtained by labeling edges with strings rather than single characters. This allows us to eliminate many nodes with single children and results in a representation that requires O(m) space and that can be constructed in O(m) time, as described by McCreight [10]. See also [2, 11] Actually, McCreight defines a suffix tree to contain suffixes of a single string rather than a collection of strings. Our variant requires only minor modifications to McCreight s method. An example of this compact representation of suffix trees is shown in Figure 12. We ....
McCreight, Edward M. "A Space-Economical Suffix Tree Construction Algorithm, " Journal of the ACM, vol. 23, 4/76, 262--272.
An Alphabet Independent Approach to Two Dimensional Matching - Amir, Benson, Farach (1994) (10 citations) (Correct)
....prefix of row lptext[i] and the suffix of row i lptext[i] We need merely locate the mismatch to obtain the witness. In order to treat the suffix and prefix of a row as a single character, we will build a suffix tree for the array. A suffix tree is a compacted trie of the suffixes of a string ( [20, 23]) The suffix tree is perhaps the most widely used data stucture in string matching. A thorough description of suffix trees and their properties appears in [10] We note that since a suffix tree is a trie, each node v has associated with it some string S(v) In [18] it was pointed out that if l ....
E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262--272, 1976.
Enhanced Code Compression for Embedded RISC Processors - Cooper, McIntosh (1999) (37 citations) (Correct)
....be compressed. To identify repeats, it builds a suffix tree, as in the work of Fraser et al. 9] 2.1 Suffix Tree Construction A suffix tree is a data structure that encodes information about repetition within a textual string. Suffix trees are used for a variety of pattern matching applications [18, 20, 22]. Given a text string S, edges within the suffix tree for S are labeled with substrings within S. For each path P from the tree s root node to some leaf node, the edge labels along P describe a specific suffix within S. Figure 1 shows an example suffix tree for the text string bananas . Each ....
E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262--272, April 1976.
On Compact Directed Acyclic Word Graphs - Crochemore, Vérin (1997) (15 citations) (Correct)
....for a square [7, 9] computing the longest common subword of a finite set of words and on line subword matching [10] approximate string matching [21] The suffix tree is an alternative representation of the subwords of a word that shares with the DAWG essentially the same applications. McCreight [18] introduced the notion and gave an efficient construction after the seminal work of Weiner [22] on a similar structure. Suffix trees have been more extensively studied than DAWGs, probably because they display positions of the word in a simpler way although the branching from nodes is not uniform ....
....byte bycharacter) This is quite a convenient solution also used for suffix trees. Then, respectively for transitions matrices and adjacency lists, each state requires 20:5 and 17:13 bytes for the DAWG, and 40:5and41:21 bytes for the CDAWG. As a reference, suffix trees, as implemented by McCreight[18], need 28:25 and 20:25 bytes per state. Moreover, for CDAWG and suffix trees the source has to be stored in main memory. Theoretical average numbers of states, calculated by Blumer et al. 5] are 0:54n for CDAWG, 1:62n for DAWG, and 1# 62n for suffix trees, when n is the length of x. This gives ....
[Article contains additional citation context not shown here]
E. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262--272, Apr. 1976.
The S²-Tree: An Index Structure for Subsequence Matching.. - Wang, Perng (Correct)
....Spatial Suffix Tree 2 A recent improvement of suffix trees called String B Tree [14] achieves O(a log n) in the worst case. We have a query subsequence Q of length [Q[ We want to find quickly all the sequences i, along with the correct offset k, such that the subsequence l = Si[k,k [Q[ 1] is enveloped by the query sequence, that is, eazh spatial object in l is complelety inside its corresponding spatial object in Q. When a query subsequence Q is given, a matching tolerance is specified implicitly at the same time. A bigger MBR represents a higher tolerance. The user has the ....
McCreight, E.M. (1976) "A space-economical suffix tree construction algorithm," In Journal of the ACM, Vol. 23, No.2, pp. 262-72, April 1976.
Fast Prefix Matching of Bounded Strings - Buchsbaum, Fowler.. (2003) (4 citations) (Correct)
....prefix set, with associated values, for matching 8 bit strings; b) corresponding nested intervals; c) corresponding disjoint intervals and the equivalent set of disjoint prefixes. The first two characteristics mean that certain theoretically appealing solutions based on, e.g. suffix trees [21], string prefix matching [3, 4] or dynamic string searching [12] are not applicable, as their performance would not scale. Fortunately, the third characteristic means that specialized data structures can be designed with the desired performance levels. There are many papers in the literature ....
E. M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262--72, 1976.
Discovering and Matching Elastic Rules from Sequence Databases - Park, Chu (2001) (Correct)
....of elastic patterns. For example, S( x) hC; C; C; B; B; Di is converted to C(S( x) hC; B; Di. We use the notation X for C(S( x) Step 3. Suffix tree construction: From the set of M converted data sequences X 1 ; XM , we build a suffix tree using either McCreight s algorithm [12] or incremental disk based algorithm [3] Step 4. Trimming: We compute the support values of the nodes and trim out the nodes whose support values are less than SUP min . The support values of internal nodes are obtained by summing up the support values of their children nodes. The support values ....
McCreight, E. M.: A Space-Economical Suffix Tree Construction Algorithm, Journal of ACM, 23(2), 1998, 262--272.
Optimal Encoding of Non-Stationary Sources - Reif, Storer (2001) (Correct)
.... pure LZ77 and LZ78. However, all of the techniques we present can be generalized to incorporate most practical implementations of LZ77 and LZ78, but if the variation in question gives up optimality, then so will our methods. 1.4. Efficient implementation techniques for LZ compression McCreight [21] presented a linear time and space algorithm for the construction of a suffix tree, which effectively represents all substrings of a given string in linear space and allows an LZ77 algorithm to find a longest match in constant time per character read, which yields a linear time implementation. ....
E.M. McCreight, A space-economical suffix tree construction algorithm, Journal of the Association for Computing Machinery 23 (2) (1976) 26272.
Parallel Bi-dimensional Pattern Matching with Scaling - Marghoob Mohiyuddin Vidit (Correct)
No context found.
E. M. McCreight, A space-economical suffix tree construction algorithm, Journal of the ACM, 23(2), 1976, 262-272.
Measures of Diversity for Populations and Distances.. - Mattiussi, Waibel.. (2004) (Correct)
No context found.
McCreight, E. (1976). A space-economical suffix tree construction algorithm. J. ACM, 23(1):262--272.
Parallel Bi-dimensional Pattern Matching with Scaling - Mohiyuddin, Jain, Gupta (Correct)
No context found.
E. M. McCreight, A space-economical suffix tree construction algorithm, Journal of the ACM, 23(2), 1976, 262-272.
Practical Suffix Tree Construction - Tata, Hankins, Patel (2004) (Correct)
No context found.
E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. J. ACM, 23(2):262--272, 1976.
Practical Suffix Tree Construction - Tata, Hankins, Patel (2004) (Correct)
No context found.
E. M. McCreight. A Space-economical Suffix Tree Construction Algorithm. J. ACM, 23(2):262--272, 1976.
An O(ND) Difference Algorithm and Its Variations - Myers (1986) (12 citations) (Correct)
No context found.
McCreight, E.M. "A Space-Economical Suffix Tree Construction Algorithm." Journal of ACM 23, 2 (1976), 262-272.
Evaluating Clone Detection Techniques - Van Rysselberghe, Demeyer (2003) (1 citation) (Correct)
No context found.
E. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 32(2):262--272, 1976.
OASIS: An Online and Accurate Technique for.. - Meek, Patel, Kasetty (2003) (4 citations) (Correct)
No context found.
E. M. McCreight. A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262--272, 1976.
A Prototype for Multiple Whole Genome Alignment - Deogun, Ma, Yang (Correct)
No context found.
E.M. McCreight, A space-economical suffix tree construction algorithm. J. ACM, 23, pp. 262--272, 1976
On the Sequencing of Tree Structures for XML Indexing - Wang (2003) (1 citation) (Correct)
No context found.
E. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2):262--272, April 1976.
OASIS: An Online and Accurate Technique for.. - Meek, Patel, Kasetty (2003) (4 citations) (Correct)
No context found.
E. M. McCreight. A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM, 23(2):262--272, 1976.
On-Line Construction of Suffix Trees - Ukkonen (1995) (72 citations) (Correct)
No context found.
E. McCreight, A space--economical suffix tree construction algorithm, Journal of the ACM 23 (1976), 262--272.
Honeycomb - Creating Intrusion Detection Signatures Using.. - Kreibich, Crowcroft (2003) (13 citations) (Correct)
No context found.
E. M. McCreight, "A space-economical suffix-tree construction algorithm, " Journal of the ACM, vol. 23, pp. 262--272, 1976.
Exposition As a Learning Tool to Enhance Thinking Skills in.. - Chung (2003) (Correct)
No context found.
McCreight, E, M. (1976). A space-economical suffix tree construction algorithm. J. ACM, 23:262-72.
Efficient Implementation of Suffix Trees - Andersson, Nilsson (1995) (11 citations) (Correct)
No context found.
E. M. McCreight,`A space-economical suffix tree construction algorithm', Journal of the ACM, 23(2), 262-- 272 (1976).
Longest-match String Searching for Ziv-Lempel Compression - Bell, Kulp (1993) (12 citations) (Correct)
No context found.
E. M. McCreight, `A space-economical suffix tree construction algorithm', J ACM, 23, (2), 262-- 272 (1976).
The Effectiveness Study of Various Music Information.. - Hsu, Chen, Chen, Liu (Correct)
No context found.
McCreight, E. M. (1976). A space economical suffix tree construction algorithra. Journal of Assoc. Comput. Mach., 23,262-272.
First 50 documents Next 50
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