Dynamic fully-compressed suffix trees

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

Volumn 5029 LNCS, Issue , 2008, Pages 191-203

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

^a INESC ID   (Portugal)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; DATA STRUCTURES; FILE ORGANIZATION; INFORMATION SCIENCE; INFORMATION SERVICES; PATTERN MATCHING; PHASE MODULATION; SEARCH ENGINES; TREES (MATHEMATICS);

RETRIEVAL (MIR); STRINGOLOGY; SUFFIX TREES;

DATA COMPRESSION;

EID: 45849125001     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69068-9_19     Document Type: Conference Paper

References (15)

1. Apostolico, A.: Combinatorial Algorithms on Words. In: The myriad virtues of subword trees. NATO ISI Series, pp. 85-96. Springer, Heidelberg (1985)
2. Gusfield, D.: Algorithms on Strings, Trees and Sequences. Cambridge University Press, Cambridge, UK (1997)
3. Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Softw. Pract. Exper. 33(11), 1035-1049 (2003)
4. Manber, U., Myers, E.W.: Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935-948 (1993)
5. Sadakane, K.: Compressed suffix trees with full functionality. Theory Comput. Syst. 41, 589-607 (2007), http://dx.doi.org/10.1007/s00224-006-1198-x
6. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Comp. Surv. 39(1), 2 (2007)
7. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Trans. Algor. 3(2), 20 (2007)
8. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM 48(3), 407-430 (2001)
9. Russo, L., Navarro, G., Oliveira, A.: Fully-Compressed Suffix Trees. In: LATIN. LNCS, vol. 4957, pp. 362-373. Springer, Heidelberg (2008)
10. Chan, H.-L., Hon, W.-K., Lam, T.-W., Sadakane, K.: Compressed indexes for dynamic text collections. ACM Trans. Algorithms 3(2) (2007)
11. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 307-318. Springer, Heidelberg (to appear in ACM TALG, 2006)
12. González, R., Navarro, G.: Improved dynamic rank-select entropy-bound structures. In: LATIN. LNCS, vol. 4957, pp. 374-386. Springer, Heidelberg (2008)
13. Weiner, P.: Linear pattern matching algorithms. In: IEEE Symp. on Switching and Automata Theory, pp. 1-11 (1973)
14. Russo, L., Oliveira, A.: A compressed self-index using a Ziv-Lempel dictionary. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol. 4209, pp. 163-180. Springer, Heidelberg (2006)
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)