IEEE - Institute of Electrical and Electronics Engineers, Inc. - Optimal suffix tree construction with large alphabets

Proceedings 38th Annual Symposium on Foundations of Computer Science

Author(s): Farach, M.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1997
Conference Location: Miami Beach, FL, USA, USA
Conference Date: 20 October 1997
Page(s): 137 - 143
ISBN (Paper): 0-8186-8197-7
ISSN (Paper): 0272-5428
DOI: 10.1109/SFCS.1997.646102
Regular:

The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner (1973), who introduced the data structure, gave an O(n)-time algorithm for building the... View More

Advertisement