Parallel and distributed compressed indexes

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

Volumn 6129 LNCS, Issue , 2010, Pages 348-360

  Russo, Luís M S ^a   Navarro, Gonzalo ^b   Oliveira, Arlindo L ^c  

^a UNIVERSIDADE NOVA DE LISBOA   (Portugal)

^b UNIVERSITY OF CHILE   (Chile)

^c INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

SHARED-MEMORY PARALLELS; STRINGOLOGY; TEXT STRING;

PATTERN MATCHING;

ELECTROSTATIC DISCHARGE;

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

References (18)

1. Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Softw., Pract. Exper. 33(11), 1035-1049 (2003).
2. Manber, U., Myers, E.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993).
3. Sadakane, K.: Compressed suffix trees with full functionality. Theory Comput. Syst. 41(4), 589-607 (2007).
4. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Comp. Surv. 39(1), article 2 (2007).
5. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algor. 3(2), article 20 (2007).
6. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM 48(3), 407-430 (2001).
7. 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)
8. Fischer, J., Mäkinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comp. Sci. 410(51), 5354-5364 (2009).
9. Mäkinen, V., Navarro, G., Sadakane, K.: Advantages of backward searching - efficient secondary memory and distributed implementation of compressed suffix arrays. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 681-692. Springer, Heidelberg (2004). (Pubitemid 39745117)
10. Clifford, R.: Distributed suffix trees. J. Discrete Algorithms 3(2-4), 176-197 (2005). (Pubitemid 40655177)
11. Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge (1997).
12. Weiner, P.: Linear pattern matching algorithms. In: IEEE Symp. on Switching and Automata Theory, pp. 1-11 (1973).
13. Lee, S., Park, K.: Dynamic rank-select structures with applications to run-length encoded texts. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 95-106. Springer, Heidelberg (2007).
14. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc 13th SODA, pp. 233-242 (2002).
15. Huynh, T.N.D., Hon, W.K., Lam, T.W., Sung, W.K.: Approximate string matching using compressed suffix arrays. Theor. Comput. Sci. 352(1-3), 240-249 (2006). (Pubitemid 43243293)
16. Russo, L., Navarro, G., Oliveira, A.: Dynamic Fully-Compressed Suffix Trees. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 191-203. Springer, Heidelberg (2008).
17. Marín, M., Navarro, G.: Distributed query processing using suffix arrays. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol. 2857, pp. 311-325. Springer, Heidelberg (2003).
18. Gupta, A., Hon, W.K., Shah, R., Vitter, J.: Compressed data structures: dictionaries and data-aware measures. In: Àlvarez, C., Serna, M. (eds.) WEA 2006. LNCS, vol. 4007, pp. 158-169. Springer, Heidelberg (2006).