## Two space saving tricks for linear time LCP computation (2004)

### Cached

### Download Links

- [people.unipmn.it]
- [www.mfn.unipmn.it]
- [www.mfn.unipmn.it]
- [people.unipmn.it]
- [people.unipmn.it]
- DBLP

### Other Repositories/Bibliography

Venue: | In: Proc. SWAT. Volume 3111 of Lecture Notes in Computer Science |

Citations: | 31 - 3 self |

### BibTeX

@INPROCEEDINGS{Manzini04twospace,

author = {Giovanni Manzini},

title = {Two space saving tricks for linear time LCP computation},

booktitle = {In: Proc. SWAT. Volume 3111 of Lecture Notes in Computer Science},

year = {2004},

pages = {372--383},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we consider the linear time algorithm of Kasai et al. [10] for the computation of the LCP array given the text and the su#x array. We show that this algorithm can be implemented without any auxiliary array in addition to the ones required for the input (the text and the su#x array) and the output (the LCP array). Thus, for a text of length n, we reduce the space occupancy of this algorithm from 13n bytes to 9n bytes.

### Citations

657 | E.: Suffix arrays: A new method for on-line string searches
- Manber, Myers
- 1993
(Show Context)
Citation Context ...he source code for the algorithms described in this paper has been included in the lightweight suffix sorting package [13] which is freely available under the GNU GPL. 1 Introduction The suffix array =-=[11]-=- is a simple and elegant data structure used for several fundamental string matching problems involving both linguistic texts and biological data. The vitality of this data structure is proven by the ... |

579 | A block sorting lossless data compression algorithm
- Burrows, Wheeler
- 1994
(Show Context)
Citation Context ...xt over Σ. Fori =1,...,n we write t[i, n] to denote the suffix of t of length n − i + 1 that is t[i, n] =t[i]t[i +1]···t[n]. The suffix array [11] for t is the array Sa[1,n] such that t[Sa[1],n], t[Sa=-=[2]-=-,n], ..., t[Sa[n],n] is the list of suffixes of t sorted in lexicographic order. To define unambiguously the lexicographic order of the suffixes it is customary to logically append at the end of t a s... |

557 | A Space-Efficient Suffix Tree Construction Algorithm - McCreight - 1976 |

196 | High-order entropy-compressed text indexes - Grossi, Gupta, et al. - 2003 |

186 | G.: Opportunistic data structures with applications - Ferragina, Manzini - 2000 |

153 | Simple linear work suffix array construction
- Karkkainen, Sanders
- 2003
(Show Context)
Citation Context ...problems involving both linguistic texts and biological data. The vitality of this data structure is proven by the large number of suffix array construction algorithms developed in the last two years =-=[1,5,7,8,14]-=-. The suffix array of a text t[1,n] is the lexicographically sorted list of all its suffixes. The suffix array is often used together with the Longest Common Prefix array, LCP array from now on, which... |

81 | K.: Linear-time longestcommon-prefix computation in suffix arrays and its applications
- Kasai, Lee, et al.
- 2001
(Show Context)
Citation Context ...anzini Dipartimento di Informatica, Università del Piemonte Orientale, I-15100 Alessandria, Italy. manzini@mfn.unipmn.it. Abstract. In this paper we consider the linear time algorithm of Kasai et al. =-=[6]-=- for the computation of the Longest Common Prefix (LCP) array given the text and the suffix array. We show that this algorithm can be implemented without any auxiliary array in addition to the ones re... |

73 | Space-efficient linear time construction of suffix arrays, Accepted to Symp. Combinatorial Pattern Matching
- Ko, Aluru
- 2003
(Show Context)
Citation Context ...problems involving both linguistic texts and biological data. The vitality of this data structure is proven by the large number of suffix array construction algorithms developed in the last two years =-=[1,5,7,8,14]-=-. The suffix array of a text t[1,n] is the lexicographically sorted list of all its suffixes. The suffix array is often used together with the Longest Common Prefix array, LCP array from now on, which... |

66 | An experimental study of an opportunistic index - Ferragina, Manzini |

59 | Engineering a lightweight suffix array construction algorithm
- Manzini, Ferragina
(Show Context)
Citation Context ...problems involving both linguistic texts and biological data. The vitality of this data structure is proven by the large number of suffix array construction algorithms developed in the last two years =-=[1,5,7,8,14]-=-. The suffix array of a text t[1,n] is the lexicographically sorted list of all its suffixes. The suffix array is often used together with the Longest Common Prefix array, LCP array from now on, which... |

54 | Linear-time construction of suffix arrays
- Kim, Sim, et al.
- 2003
(Show Context)
Citation Context |

52 | Breaking a time-and-space barrier in constructing full-text indices
- Hon, Sadakane, et al.
(Show Context)
Citation Context ...have a “practical” interest: from the theoretical point of view their working space of Θ(n log n) bits is not optimal. Indeed, the optimal space/time tradeoff can be obtained combining the results in =-=[4]-=- and [15] which allow one to build the suffix array and LCP array in linear time using O(n) bits of auxiliary storage. Unfortunately the algorithms in [4,15] are quite complex and it is still unclear ... |

51 | Succinct representation of lcp information and improvement in the compressed suffix arrays
- Sadakane
(Show Context)
Citation Context ...practical” interest: from the theoretical point of view their working space of Θ(n log n) bits is not optimal. Indeed, the optimal space/time tradeoff can be obtained combining the results in [4] and =-=[15]-=- which allow one to build the suffix array and LCP array in linear time using O(n) bits of auxiliary storage. Unfortunately the algorithms in [4,15] are quite complex and it is still unclear whether t... |

47 | Faster suffix sorting - Larsson, Sadakane |

38 | Optimal Exact String Matching Based on Suffix Arrays - Abouelhoda, EnnoOhlebusch, et al. - 2002 |

32 | Compressed compact suffix arrays
- Mäkinen, Navarro
- 2004
(Show Context)
Citation Context ...xample, in Fig. 1 we have that the second i in F (that is, F [2]) corresponds to the second i in L (that is, L[7]) since they both are the eighth symbol of mississippi. Similarly, the third s in F (F =-=[10]-=-) corresponds to the third s in L (L[8]) since they both are the sixth symbol of mississippi. Assume now that the character F [j] corresponds to L[i]. This means that row i of M consists of a (rightwa... |

26 | Fast lightweight suffix array construction and checking, Accepted to Symp. Combinatorial Pattern Matching
- Burkhardt, Kärkkäinen
- 2003
(Show Context)
Citation Context |

20 |
Compact suffix array — a space-efficient full-text index
- Mäkinen
- 2003
(Show Context)
Citation Context ...k-th order empirical entropy of t. Ift is highly compressible the space occupancy of Lcp6 can be as small as 6n bytes. Vice versa, if t is a “random” string the space 1 Recently, we found out that in =-=[9]-=- Mäkinen describes a space-economical version of Kasai et al. algorithm which only uses 9.125n bytes. We will report on Mäkinen’s algorithm in the full paper.374 G. Manzini required by our algorithm ... |

12 | Compression boosting in optimal linear time using the Burrows-Wheeler Transform
- Ferragina, Manzini
- 2004
(Show Context)
Citation Context ...th a single pass over the LCP array we can simulate a post order visit of the suffix tree of the text t. In some applications, for example for the construction of the compression booster described in =-=[3]-=-, such visit does not need the information stored in the suffix array. If we only need the LCP array, even the 9n bytes space occupancy of algorithm Lcp9 becomes the space bottleneck of the whole comp... |

2 |
Lightweight suffix sorting home
- Manzini, Ferragina
(Show Context)
Citation Context ...ication of the Burrows-Wheeler Transform outside the domain of data compression. The source code for the algorithms described in this paper has been included in the lightweight suffix sorting package =-=[13]-=- which is freely available under the GNU GPL. 1 Introduction The suffix array [11] is a simple and elegant data structure used for several fundamental string matching problems involving both linguisti... |