Sampled longest common prefix array

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

Volumn 6129 LNCS, Issue , 2010, Pages 227-237

  Sirén, Jouni ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BUILDING BLOCKES; COMPRESSED SUFFIX ARRAY; OPTIMAL TIME; STRING PROCESSING; SUFFIX ARRAYS; SUFFIX-TREES;

ELECTROSTATIC DISCHARGE; PATTERN MATCHING;

INDEXING (OF INFORMATION);

EID: 78449266657     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13509-5_21     Document Type: Conference Paper

References (24)

1. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal on Discrete Algorithms 2(1), 53-86 (2004).
2. Brisaboa, N.R., Ladra, S., Navarro, G.: Directly addressable variable-length codes. In: Hyyro, H. (ed.) SPIRE 2009. LNCS, vol. 5721, pp. 122-130. Springer, Heidelberg (2009).
3. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994).
4. Cánovas, R., Navarro, G.: Practical compressed suffix trees. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 94-105. Springer, Heidelberg (2010).
5. Elias, P.: Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory 21(2), 194-203 (1975).
6. Fayolle, J., Ward, M.D.: Analysis of the average depth in a suffix tree under a Markov model. In: Proc. 2005 International Conference on Analysis of Algorithms, DMTCS Proceedings, vol. AD, pp. 95-104. DMTCS (2005).
7. Ferragina, P., González, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. Journal of Experimental Algorithms 13, 1.12 (2009).
8. Ferragina, P., Manzini, G.: Indexing compressed text. Journal of the ACM 52(4), 552-581 (2005). (Pubitemid 43078371)
9. Ferragina, P., Venturini, R.: A simple storage scheme for strings achieving entropy bounds. In: SODA 2007, pp. 690-696. SIAM, Philadelphia (2007).
10. Fischer, J.: Wee LCP. arXiv:0910.3123v1 [cs.DS] (2009).
11. Fischer, J., Mäkinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theoretical Computer Science 410(51), 5354-5364 (2009).
12. Grossi, R., Vitter, J.S.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing 35(2), 378-407 (2005).
13. Gupta, A., Hon, W.-K., Shah, R., Vitter, J.S.: Compressed data structures: dictionaries and data-aware measures. Theoretical Computer Science 387(3), 313-331 (2007). (Pubitemid 47633447)
14. Kärkkäinen, J., Manzini, G., Puglisi, S.: Permuted longest-common-prefix array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol. 5577, pp. 181-192. Springer, Heidelberg (2009).
15. Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longestcommon- prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181-192. Springer, Heidelberg (2001). (Pubitemid 33298873)
16. Khmelev, D.: Program lcp version 0.1.9 (2004), http://www.math.toronto. edu/dkhmelev/PROGS/misc/lcp-eng.html.
17. Kurtz, S.: Reducing the space requirement of suffix trees. Software: Practice and Experience 29(13), 1149-1171 (1999). (Pubitemid 129303954)
18. Mäkinen, V., Navarro, G., Sirén, J., Välimäki, N.: Storage and retrieval of individual genomes. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol. 5541, pp. 121-137. Springer, Heidelberg (2009).
19. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1), 2 (2007).
20. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: SODA 2002, pp. 233-242. SIAM, Philadelphia (2002).
21. Russo, L., Navarro, G., Oliveira, A.: Fully-compressed suffix trees. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 362-373. Springer, Heidelberg (2008). (Pubitemid 351632202)
22. Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems 41(4), 589-607 (2007).
23. Sirén, J.: Compressed suffix arrays for massive data. In: Hyyro, H. (ed.) SPIRE 2009. LNCS, vol. 5721, pp. 63-74. Springer, Heidelberg (2009).
24. Sirén, J.: Sampled longest common prefix array. arXiv:1001.2101v2 [cs.DS] (2010).