J. Karkkainen. Sux cactus: a cross between sux tree and sux array. In Proc. 6th Ann. Symp. Combinatorial Pattern Matching (CPM'95), LNCS 937, pages 191-204, 1995.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... index a text of u characters, which required u log 2 bits to be represented, so the index is in practice larger than the text (typically 4 times the text size) Since the last decade, several attempts to reduce the space of the sux trees [3] or arrays have been made by K arkk ainen and Ukkonen [12, 15], Kurtz [17] M akinen [19] and Abouelhoda, Ohlebusch and Kurtz [1] obtaining remarkable improvements, albeit no spectacular ones. Moreover, they have concentrated on the space requirement of the data structure only, needing the text separately available. The rst achievement of a new trend ....

J. Karkkainen. Sux cactus: a cross between sux tree and sux array. In Proc. 6th Ann. Symp. Combinatorial Pattern Matching (CPM'95), LNCS 937, pages 191-204, 1995.

.... to index a text of u characters, which required u log 2 bits to be represented, so the index is in practice larger than the text (typically 4 times the text size) In the last decade, several attempts to reduce the space of the sux trees [2] or arrays have been made by K arkk ainen and Ukkonen [10, 13], Kurtz [15] and M akinen [16] obtaining reasonable improvements, albeit no spectacular ones (at best 9 times the text size) Moreover, they have concentrated on the space requirement of the data structure only, needing the text separately available. Grossi and Vitter [8] presented a sux array ....

J. Karkkainen. Sux cactus: a cross between sux tree and sux array. In Proc. 6th Ann. Symp. Combinatorial Pattern Matching (CPM'95), LNCS 937, pages 191-204, 1995.

....the structure. In many applications, like sequence analysis and pattern discovery in biological sequences, keeping as many data as possible in main memory might provide signi cant advantages. This fact has led to the introduction of more space ecient structures, like sux arrays [1] sux cacti [2], and others. In this work, we focus our attention on the Compact Directed Acyclic Word Graph (CDAWG) rst described in [3] The CDAWG for a string can be seen either as a compaction of the Directed Acyclic Word Graph (DAWG) 4] or a minimization of the sux tree, from which it can be derived as ....

J. Karkkainen. Sux cactus: a cross between sux tree and sux array. Combinatorial Pattern Matching, 937:191-204, July 1995.

....it takes O(n log n) time although the total size of suxes is O(n 2 ) Ecient storage. Among the many implementations of sux structures we can mention the notion of sparse sux trees of K arkk ainen and Ukkonen [20] that consider a reduced set of sux, the sux cactus of K arkk ainen [19], who degenerates the sux tree structure without over charging too much the access time, and the version dedicated to external memory (SB trees) by Ferragina and Grossi [14] but several others exist (see [3] and [18] for example) An excellent solution to save size of sux structures is to ....

J. Karkkainen. Sux cactus: a cross between sux tree and sux array. Proc. 6th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science number937, Springer-Verlag, 1995, 191-204.

....are represented by pairs of integers as in the sux tree, see Figure 5. Ecient storage Among the many implementations of sux structures, we can mention the notion of sparse sux trees due to K arkk ainen and Ukkonen [38] which considers a reduced set of suxes, the sux cactus due to K arkk ainen [39], who degenerates the sux tree structure without increasing too much the access time, and the version dedicated to external memory (SB trees) by Ferragina and Grossi [40] but several other variations exist (see [41] and [42] for example) An excellent solution to save on the size of sux ....

J. Karkkainen. Sux cactus: a cross between sux tree and sux array. Proc. 6th Ann. Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science number937, Springer-Verlag, 1995, 191-204.

....previous results, including the rst linear work BSP algorithm. On all the models, the skew algorithm is much simpler than the best previous algorithm. In many applications, the sux array needs to be augmented with additional data, the most important being the longest common pre x (lcp) array [1, 2, 26, 27, 31]. In particular, the sux tree can be constructed easily from the sux and lcp arrays [11, 13, 14] There is a linear time algorithm for computing the lcp array from the sux array [27] but it does not appear to be suitable for parallel or external computation. We extend our algorithm to compute ....

J. Karkkainen. Sux cactus: A cross between sux tree and sux array. In Z. Galil and E. Ukkonen, editors, Proc. 6th Annual Symposium on Combinatorial Pattern Matching, volume 937 of LNCS, pages 191-204. Springer, 1995.

No context found.

J. Karkkainen. Sux cactus: a cross between sux tree and sux array. In Proc. 6th Ann. Symp. Combinatorial Pattern Matching (CPM'95), LNCS 937, pages 191-204, 1995.

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