Optimal suffix tree construction with large alphabets
Farach, M.
Dept. of Comput. Sci., Rutgers Univ., Piscataway, NJ;
This paper appears in: Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on
Publication Date: 20-22 Oct 1997
On page(s): 137-143
Meeting Date: 10/20/1997 - 10/22/1997
Location: Miami Beach, FL, USA
ISSN: 0272-5428
ISBN: 0-8186-8197-7
References Cited: 10
INSPEC Accession Number: 5816552
Digital Object Identifier: 10.1109/SFCS.1997.646102
Current Version Published: 2002-08-06
Abstract
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 suffix tree of
an n-character string drawn from a constant size alphabet. In the
comparison model, there is a trivial Ω(n log n)-time lower bound
based on sorting, and Weiner's algorithm matches this bound trivially.
For integer alphabets, a substantial gap remains between the known upper
and lower bounds, and closing this gap is the main open question in the
construction of suffix trees. There is no super-linear lower bound, and
the fastest known algorithm was the O(n log n) time comparison based
algorithm. We settle this open problem by closing the gap: we build
suffix trees in linear time for integer alphabet
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
