Compressed suffix trees for repetitive texts

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

Volumn 7608 LNCS, Issue , 2012, Pages 30-41

  Abeliuk, Andrés ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

COMPRESSED SUFFIX TREES; LONGEST COMMON PREFIXES; SEQUENCE ANALYSIS; STATISTICAL COMPRESSION; TEXT COLLECTION;

FORESTRY;

ALGORITHMS; COMPUTATION; FORESTRY;

EID: 84867513711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34109-0_5     Document Type: Conference Paper

References (27)

1. Apostolico, A.: The myriad virtues of subword trees, pp. 85-96. Combinatorial Algorithms on Words. NATO ISI Series. Springer (1985)
2. Brisaboa, N.R., Ladra, S., Navarro, G.: Directly Addressable Variable-Length Codes. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 122-130. Springer, Heidelberg (2009)
3. Cánovas, R., Navarro, G.: Practical Compressed Suffix Trees. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 94-105. Springer, Heidelberg (2010)
4. Claude, F., FariËoena, A., Martńez-Prieto, M., Navarro, G.: Compressed q-gram indexing for highly repetitive biological sequences. In: Proc. 10th BIBE, pp. 86-91 (2010)
5. Claude, F., Navarro, G.: Self-indexed Text Compression Using Straight-Line Programs. In: Královi?c, R., Niwínski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 235-246. Springer, Heidelberg (2009)
6. Ferragina, P., González, R., Navarro, G., Venturini, R.: Compressed text indexes: From theory to practice. ACM J. Exp. Algor. 13, article 12 (2009)
7. Fischer, J.: Wee LCP. Inf. Proc. Lett. 110, 317-320 (2010)
8. Fischer, J., Mäkinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comp. Sci. 410(51), 5354-5364 (2009)
9. Gog, S.: Compressed Suffix Trees: Design, Construction, and Applications. Ph.D. thesis, Univ. of Ulm, Germany (2011)
10. González, R., Navarro, G.: Compressed Text Indexes with Fast Locate. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 216-227. Springer, Heidelberg (2007)
11. Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)
12. Kreft, S.: Self-index based on LZ77. Masteras thesis, Univ. of Chile (2010), arXiv:1112.4578v1
13. Kreft, S., Navarro, G.: Self-indexing Based on LZ77. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 41-54. Springer, Heidelberg (2011)
14. Kurtz, S.: Reducing the space requirements of suffix trees. Report 98-03, Technische Fakultät, Univ. Bielefeld, Germany (1998)
15. Larsson, J., Moffat, A.: Off-line dictionary-based compression. Proc. of the IEEE 88(11), 1722-1732 (2000)
16. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic J. Comp. 12(1), 40-66 (2005)
17. Mäkinen, V., Navarro, G., Sirén, J., Välimäki, N.: Storage and retrieval of highly repetitive sequence collections. J. Comp. Biol. 17(3), 281-308 (2010)
18. Manber, U., Myers, E.: Suffix arrays: A new method for on-line string searches. SIAM J. Comp., 935-948 (1993)
19. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM 48(3), 407-430 (2001)
20. McCreight, E.: A space-economical suffix tree construction algorithm. J. ACM 32(2), 262-272 (1976)
21. Munro, I.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
22. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Comp. Surv. 39(1), article 2 (2007)
23. Ohlebusch, E., Fischer, J., Gog, S.: CST++. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 322-333. Springer, Heidelberg (2010)
24. Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th SODA, pp. 233-242 (2002)
25. Russo, L., Navarro, G., Oliveira, A.: Fully-compressed suffix trees. ACM Trans. Alg. 7(4), article 53 (2011)
26. Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comp. Sys. 41(4), 589-607 (2007)
27. Weiner, P.: Linear pattern matching algorithms. In: IEEE Symp. Swit. and Aut. Theo., pp. 1-11 (1973)