| , Venkatesh Raman (2007) | |||||||||||||
Abstract | |||||||||||||
| Abstract. We first give a representation of a suffix tree that uses n lg n+ O(n) bits of space and supports searching for a pattern in the given text (from a fixed size alphabet) in O(m) time, where n is the size of the text and m is the size of the pattern. The structure is quite simple and answers a question raised by Muthukrishnan in [17]. Previous compact representations of suffix trees had a higher lower order term in space and had some expectation assumption [3], or required more time for searching [5]. Then, surprisingly, we show that we can even do better, by developing a structure that uses a suffix array (and so ndlg ne bits) and an additional o(n) bits. String searching can be done in this structure also in O(m) time. Besides supporting string searching, we can also report the number of occurrences of the pattern in the same time using no additional space. In this case the space occupied by the structures is much less compared to many of the previously known structures to do this. When the size of the alphabet k is not a constant, our structures can be easily extended, using standard tricks, to those that use the same space but take O(m lg k) time for string searching or to those that use an additional O(m lg k) bits but take the same O(m) time for searching. 1 | |||||||||||||
Details der Publikation | |||||||||||||
| |||||||||||||