Suffix arrays on words

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

Volumn 4580 LNCS, Issue , 2007, Pages 328-339

  Ferragina, Paolo ^a   Fischer, Johannes ^b  

^a UNIVERSITY OF PISA   (Italy)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; PROBLEM SOLVING; TREES (MATHEMATICS);

CLASS-NOTE SOLUTION; SPACE REDUCTION; SUFFIX ARRAYS; WORD-BASED VERSIONS;

INDEXING (OF INFORMATION);

EID: 37849013073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_33     Document Type: Conference Paper

References (29)

1. Andersson, A., Larsson, N.J., Swanson, K.: Suffix Trees on Words. Algorithmica 23(3), 246-260 (1999)
2. Inenaga, S., Takeda, M.: On-Line Linear-Time Construction of Word Suffix Trees. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 60-71. Springer, Heidelberg (2006)
3. Inenaga, S., Takeda, M.: Sparse Directed Acyclic Word Graphs. In: Crestani, F., Ferragina, P., Sanderson, M. (eds.) SPIRE 2006. LNCS, vol. 4209, pp. 61-73. Springer, Heidelberg (2006)
4. Inenaga, S., Takeda, M.: Sparse compact directed acyclic word graphs. In: Stringology, pp. 197-211 (2006)
5. Yugo, R., Isal, K., Moffat, A.: Word-based block-sorting text compression. In: Australasian Conference on Computer Science, pp. 92-99. IEEE Press, New York (2001)
6. Yamamoto, M., Church, K.W: Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus. Computational Linguistics 27(1), 1-30 (2001)
7. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)
8. Navarro, C., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys (to appear) Preliminary version available at http://www.dec.uchile.cl/~gnavarro/ps/acmcs06.ps.gz
9. Witten, I.H, Moffat, A., Bell, T.C: Managing Gigabytes: Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann, San Francisco (1999)
10. Zobel, J., Moffat, A., Ramamohanarao, K.: Guidelines for Presentation and Comparison of Indexing Techniques. SIGMOD Record 25(3), 10-15 (1996)
11. Hon, W.K., Sadakane, K., Sung, W.K.: Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. In: Proc. FOCS, pp. 251-260. IEEE Computer Society, Los Alamitos (2003)
12. Ukkonen, E.: On-line Construction of Suffix Trees. Algorithmica 14(3), 249-260 (1995)
13. Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The Smallest Automaton Recognizing the Subwords of a Text. Theor. Comput. Sci. 40, 31-55 (1985)
14. Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, C., Pavesi, G.: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics 146(2), 156-179 (2005)
15. Kärkkäinen, J., Sanders, P., Burkhardt, S.: Linear Work Suffix Array Construction. J. ACM 53(6), 1-19 (2006)
16. Inenaga, S.: personal communication (December 2006)
17. Kärkkäinen, J., Ukkonen, E.: Sparse Suffix Trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol. 1090, pp. 219-230. Springer, Heidelberg (1996)
18. Ferragina, P., Venturini, R.: A Simple Storage Scheme for Strings Achieving Entropy Bounds. Theoretical Computer Science 372(1), 115-121 (2007)
19. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing Suffix Trees with Enhanced Suffix Arrays. J. Discrete Algorithms 2(1), 53-86 (2004)
20. Kasai, T., Lee, C., Arimura, H., Arikawa, S., Park, K.: Linear-Time Longest-Common-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)
21. Aluru, S. (ed.): Handbook of Computational Molecular Biology. Chapman & Hall/CRC, Sydney, Australia (2006)
22. Manber, U., Myers, E.W.: Suffix Arrays: A New Method for On-Line String Searches. SIAM J. Comput. 22(5), 935-948 (1993)
23. Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Proc. ESCAPE. LNCS (to appear)
24. Larsson, N.J., Sadakane, K.: Faster suffix sorting. Technical Report LU-CS-TR:99-214, LUNDFD6/(NFCS-3140)/l-20/(1999), Department of Computer Science, Lund University, Sweden (May 1999)
25. Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest Common Ancestors: A Survey and a New Distributed Algorithm. In: Proc. SPAA, pp. 258-264. ACM Press, New York (2002)
26. Ferragina, P., Navarro, C.: The Pizza & Chili Corpus. Available at http://pizzachili.di.unipi.it, http://pizzachili.dec.uchile.cl
27. Università degli Studi di Milano, Laboratory for Web Algorithmics: URLs from the.eu domain. Available at http://law.dsi.unimi.it/index.php
28. Maniscalco, M.A., Puglisi, S.J.: An efficient, versatile approach to suffix sorting. ACM Journal of Experimental Algorithmics (to appear) Available at http://www.michael-maniscalco.com/msufsort.htm
29. Manzini, C., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica, 40(1), 33-50 (2004) Available at http://www.mfn.unipmn.it/~manzini/lightweight