Two space saving tricks for linear time LCP array computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3111, Issue , 2004, Pages 372-383

  Manzini, Giovanni ^a  

^a UNIVERSITY OF EASTERN PIEDMONT   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; DATA COMPRESSION; DATA COMPRESSION RATIO; OPEN SOURCE SOFTWARE;

ARRAY COMPUTATIONS; BURROWS WHEELER TRANSFORM; LINEAR-TIME ALGORITHMS; LONGEST COMMON PREFIXES; SOURCE CODES; SPACE SAVINGS; SUFFIX ARRAYS; SUFFIX SORTING;

ALGORITHMS;

EID: 35048818017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_32     Document Type: Article

References (15)

1. S. Burkhardt and J. Kärkkäinen. Fast lightweight suffix array construction and checking. In Proc. 14th Symposium on Combinatorial Pattern Matching (CPM '03), pages 55-69. Springer-Verlag LNCS n. 2676, 2003.
2. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation, 1994.
3. P. Ferragina and G. Manzini. Compression boosting in optimal linear time using the Burrows-Wheeler transform. In Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA '04), 2004.
4. W. Hon, K. Sadakane, and W. Sung. Breaking a time-and-space barrier in constructing full-text indices. In Proc. of the 44th IEEE Symposium on Foundations of Computer Science, pages 251-260, 2003.
5. J. Kärkkäinen and P. Sanders. Simple linear work suffix array construction. In Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP '03), pages 943-955. Springer-Verlag LNCS n. 2719, 2003.
6. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park. Linear-time longest-common-prefix computation in suffix arrays and its applications. In Proc. 12th Symposium on Combinatorial Pattern Matching (CPM '01), pages 181-192. Springer-Verlag LNCS n. 2089, 2001.
7. D. K. Kim, J. S. Sim, H. Park, and K. Park. Linear-time construction of suffix arrays. In Proc. 14th Symposium on Combinatorial Pattern Matching (CPM '03), pages 186-199. Springer-Verlag LNCS n. 2676, 2003.
8. P. Ko and S. Aluru. Space efficient linear time construction of suffix arrays. In Proc. 14th Symposium on Combinatorial Pattern Matching (CPM '03), pages 200-210. Springer-Verlag LNCS n. 2676, 2003.
9. V. Mäkinen. Compact suffix array - a space-efficient full-text index. Fundamenta Informaticae, 56(1-2):191-210, 2003.
10. V. Mäkinen and G. Navarro. Compressed compact suffix arrays. In Proc. of the 15th Symposium on Combinatorial Pattern Matching. Springer-Verlag LNCS, 2004.
11. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993.
12. G. Manzini. Two space saving tricks for linear time LCP computation. Technical Report TR-INF-2004-02-03-UNIPMN, Dipartimento di Informatica, Università Piemonte Orientale, http://www.di.unipmn.it, 2004.
13. ∼manzini/lightweight.
14. G. Manzini and P. Ferragina. Engineering a lightweight suffix array construction algorithm. Algorithmica, 2004. To appear. Preliminary version in Proc. 10th European Symposium on Algorithms (ESA '02).
15. K. Sadakane. Succinct representations of LCP information and improvements in the compressed suffix arrays. In Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA '02), pages 225-232, 2002.