Ukkonen, E. (1992): Constructing sux trees on{line in linear time. In: J. van Leeuwen (ed.), Algorithms, Software, Architecture. Information Processing 92, vol. I, pp. 484{  Home/Search   Document Not in Database   Summary   Related Articles   Check

....answer. Since the resulting tree has degree at least two and it has O(n) leaves (text suxes) it follows that it is O(n) size in the worst case. The result, due to Weiner [70] is called a sux tree [6, 31] Sux trees can be built in optimal O(n) worst case time, as shown by McCreight and others [46, 67, 29], and can simulate any algorithm over sux tries with the same complexity. So in practice they are preferred over sux tries, although it is much easier to think of algorithms over the sux trie and then implement them over the sux tree. Still, sux trees are unsatisfactory in most practical ....

E. Ukkonen. Constructing sux trees on-line in linear time. In Proc. 12th IFIP World Computer Congress (IFIP'92), pages 484-492. North-Holland, 1992.

....of a given square array p in the square text t) in time independent of jtj. Sux Tree Construction. There are several algorithms for constructing the sux tree of a string drawn from a constant sized alphabet set in O(n) time. These include the algorithms by McCreight [10] Weiner [14] and Ukkonen [13]. All these algorithms exploit an important property of sux trees, namely, each node has an outgoing sux link. Farach [4] showed how to construct sux trees in O(n) time even when the alphabet size was not constant but some polynomial in n. This algorithm di ers from the others above in that it is ....

E. Ukkonen. Constructing sux trees on-line in linear time, Proceedings of the IFIP 12th World Computer Congress, 1992, 484-492.

....valid models. One way of doing that is using a representation of the string s that allows to put together some of the repetitions, that is, using an index of s such as a sux tree T . 1.5.3. 1 Building the sux tree We do not describe the sux tree construction, this can be found in either [25, 42] or (for a review of this and other data structures and text algorithms) 6] and [13] We just recall some of the basic properties such structures possess (these are taken from [25] Basic properties of the sux tree T of a string s Property 1.5.1 An arc of T may represent any nonempty substring ....

E. Ukkonen.Constructing sux trees on-line in linear time.pages 484-492. IFIP'92, 1992.

....data structure for maintaining dynamic set partitions as a special case. We propose a series of data structures based on sux trees [10] to eciently support a restricted set of these operations. In particular, we build our data structure around Ukkonen s linear time sux tree construction algorithm [18]. In Ukkonen s algorithm, suxes are inserted into the tree from left to right. Analogously, we can continue to append new characters onto the end of a string by simulating the insertion of another subsequent sux. We will augment this sux tree to support constant time least common ancestor ....

E. Ukkonen. Constructing sux trees on-line in linear time. In Intern. Federation of Information Processing (IFIP '92), pages 484-492, 1992.

No context found.

Ukkonen, E. (1992): Constructing sux trees on{line in linear time. In: J. van Leeuwen (ed.), Algorithms, Software, Architecture. Information Processing 92, vol. I, pp. 484{

No context found.

E. Ukkonen. Constructing sux trees on{line in linear time. Information Processing, 1:484-492, 1992.

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