Suffix trays and suffix trists: Structures for faster text indexing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 358-369

  Cole, Richard ^a   Kopelowitz, Tsvi ^b   Lewenstein, Moshe ^b  

^a NEW YORK UNIVERSITY   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAYS; INDEXING (OF INFORMATION); ONLINE SYSTEMS; QUERY LANGUAGES; TEXT PROCESSING; TREES (MATHEMATICS);

SUFFIX ARRAYS; SUFFIX TRAYS; SUFFIX TREES; SUFFIX TRISTS; TEXT INDEXING;

DATA STRUCTURES;

EID: 33746367784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_32     Document Type: Conference Paper

References (11)

1. A. Amir, T. Kopelowitz, M. Lewenstein, and N. Lewenstein. Towards Real-Time Suffix Tree Construction. Proc. of Symp. on String Processing and Information Retrieval (SPIRE), 67-78, 2005.
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.
3. M. Farach. Optimal suffix tree construction with large alphabets. Proc. 38th IEEE Symposium on Foundations of Computer Science, pages 137-143, 1997.
4. R. Grossi and G. F. Italiano. Efficient techniques for maintaining multidimensional keys in linked data structures. In Proc. 26th Intl. Col. on Automata, Languages and Programming (ICALP), LNCS 1644, pages 372-381, 1999.
5. Juha Kärkkäinen and Peter Sanders. Simple linear work suffix array construction. In Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP 03), LNCS 2719, pages 943-955, 2003.
6. D.K. Kim, J.S. Sim, H. Park, and K. Park. Linear-time construction of suffix arrays. Proc. of 14th Symposium on Combinatorial Pattern Matching, 186-199, LNCS 2676, 2003.
7. P. Ko and S. Aluru. Space efficient linear time construction of suffix arrays. Proc. of 14th Symposium on Combinatorial Pattern Matching, 200-210, LNCS 2676, 2003.
8. U. Manber and E.W. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. on Computing, 22(5):935-948, 1993.
9. E. M. McCreight. A space-economical suffix tree construction algorithm. J. of the ACM, 23:262-272, 1976.
10. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.
11. P. Weiner. Linear pattern matching algorithm. Proc. 14th IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.