E. M. McCreight. A space-economical su#x tree construction algorithm. J. ACM, 23(2):262--272, 1976. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Oblivious String Embeddings and Edit Distance Approximations - Tugkan Batu Funda (2005) (Correct)
No context found.
E. M. McCreight. A space-economical su#x tree construction algorithm. J. ACM, 23(2):262--272, 1976.
A Parallel Algorithm for the Extraction of Structured Motifs - Carvalho, Freitas, al. (2004) (2 citations) (Correct)
No context found.
E. McCreight. A space economical sux tree construction algorithm. Journal of the ACM, 23:262-272, 1976. 16
The at Most k-Deep Factor Tree - Allali, Sagot (Correct)
No context found.
McCreight E.M. A space-economical su#x tree construction algorithm J. Algorithms, 23:262--272, 1976.
Oblivious String Embeddings and Edit Distance Approximations - Tugkan Batu Funda (2005) (Correct)
No context found.
E. M. McCreight. A space-economical su#x tree construction algorithm. J. ACM, 23(2):262--272, 1976.
Locally Consistent Parsing and Applications to - Approximate String Comparisons (Correct)
No context found.
Edward M. McCreight. A space-economical su#x tree construction algorithm. J. ACM, 23(2):262--272, 1976.
Efficient Extraction of Structured Motifs Using Box-links - Carvalho, Freitas, Sagot (2004) (1 citation) (Correct)
No context found.
McCreight, E.: A space economical su#x tree construction algorithm. Journal of the ACM 23 (1976) 262--272
Version Spaces in Constraint-Based Data Mining - Fischer (2003) (Correct)
No context found.
E. M. McCreight. A space-economical su x tree construction algorithm. Journal of the ACM, 23(2):262272, 1976.
Motif Extraction from Weighted Sequences - Iliopoulos, Perdikuri.. (Correct)
No context found.
E.M. McCreight. A Space-Economical Su#x Tree Construction Algorithm. Journal of the ACM, 23:262-272, 1976.
New Upper Bounds on Various String Manipulation Problems - Makris, Panagis.. (Correct)
No context found.
McCreight, E.,M.,: A space-economical su#x tree construction algorithm. Journal of the ACM, Vol. 23(2), pages 262--272, 1976.
Rotation Invariant Template Matching - Fredriksson (2001) (1 citation) (Correct)
No context found.
E. M. McCreight. A space-economical sux tree construction algorithm. J. Algorithms, 23(2):262-272, 1976.
Linear Time Universal Coding and Time Reversal of Tree .. - Martin, Seroussi.. (2004) (Correct)
No context found.
E. McCreight, "A space-economical su#x tree construction algorithm," Journal of the ACM, vol. 23, no. 2, pp. 262--272, 1976.
A Parallel Algorithm for the Extraction of Structured.. - Carvalho, Freitas.. (2004) (2 citations) (Correct)
No context found.
E. McCreight. A space economical su#x tree construction algorithm. Journal of the ACM, 23:262--272, 1976.
A Parallel Algorithm for the Extraction of Structured.. - Carvalho, Freitas.. (2004) (2 citations) (Correct)
No context found.
E. McCreight. A space economical su#x tree construction algorithm. Journal of the ACM, 23:262--272, 1976. 16
Pattern and Approximate-Pattern Matching for Program Compaction - Johnson, Mycroft (Correct)
No context found.
McCreight, E. A space-economical su#x tree construction algorithm. Jour. ACM 23, 2 (April 1976), 262--272.
Advantages of Backward Searching - Efficient Secondary.. - Mäkinen, Navarro.. (Correct)
No context found.
E. M. McCreight. A space economical sux tree construction algorithm. J. of the ACM, 23, pp. 262-272, 1976.
Improving Suffix-Array Construction Algorithms with Applications - Kao (Correct)
No context found.
E. M. McCreight, A space-economical sux tree construction algorithm, J. ACM, 23(1976), pp. 262-272.
Two space saving tricks for linear time LCP computation - Manzini (2004) (Correct)
No context found.
E. M. McCreight. A space-economical su#x tree construction algorithm. Journal of the ACM, 23(2):262--272, 1976.
On Compressing and Indexing Data - Ferragina, Manzini (Correct)
No context found.
E. M. McCreight. A space-economical sux tree construction algorithm. Journal of the ACM, 23(2):262-272, 1976.
Maximal tandem repetitions and Applications to DNA words - Giraud (1999) (Correct)
No context found.
E. M. McCreight, A space-economical sux tree construction algorithm, Journal of the ACM (1976), 262-272.
On Average Sequence Complexity - Janson, Lonardi, Szpankowski (2004) (Correct)
No context found.
McCreight, E. M. A space-economical sux tree construction algorithm. J. Assoc. Comput. Mach. 23, 2 (Apr. 1976), pp. 262-272.
Opportunistic Data Structures with Applications - Ferragina, Manzini (2000) (28 citations) (Correct)
No context found.
E. M. McCreight. A space-economical su#x tree construction algorithm. J. ACM, 23(2):262--272, 1976.
Pattern Matching - Navarro (Correct)
No context found.
E. McCreight. A space-economical su#x tree construction algorithm. Journal of Algorithms, 23(2):262--272, 1976.
Compression Boosting in Optimal Linear Time Using the.. - Ferragina, Manzini (2004) (Correct)
No context found.
E. M. McCreight. A space-economical su#x tree construction algorithm. Journal of the ACM, 23(2):262-- 272, 1976.
Compressed Suffix Trees with Full Functionality - Sadakane (Correct)
No context found.
E. M. McCreight. A Space-economical Su#x Tree Construction Algorithm. Journal of the ACM, 23(12):262--272, 1976.
Linear-Time Off-Line Text Compression by.. - Inenaga, Funamoto.. (2003) (Correct)
No context found.
E. M. McCreight. A space-economical su#x tree construction algorithm. J. ACM, 23(2):262--272, 1976.
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