Space-time tradeoffs for longest-common-prefix array computation

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

Volumn 5369 LNCS, Issue , 2008, Pages 124-135

  Puglisi, Simon J ^a   Turpin, Andrew ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMOBILE SEATS; BIOINFORMATICS; DATA COMPRESSION; DATA STRUCTURES; INDEXING (OF INFORMATION); PARALLEL PROCESSING SYSTEMS; PATTERN MATCHING; TERMINOLOGY;

EXTERNAL MEMORIES; MEMORY OVERHEADS; NEW ALGORITHM; SPACE-TIME TRADEOFFS; STRING PROCESSING; SUFFIX ARRAYS; SUFFIX TREES; TIME ALGORITHMS; WORKING MEMORY (WM); WORKING SPACE;

TREES (MATHEMATICS);

EID: 58549114255     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_14     Document Type: Conference Paper

References (17)

1. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journaf of Discrete Algorithms 2(1), 53-86 (2004)
2. Apostolico, A.: The myriad virtues of subword trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO ASI Series F12, pp. 85-96. Springer, Heidelberg (1985)
3. Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G., Panario, D., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88-94. Springer, Heidelberg (2000)
4. Burkhardt, S., Kärkkäinen, J.: Fast lightweight suffix array construction and checking. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 55-69. Springer, Heidelberg (2003)
5. Colbourn, C.J., Ling, A.C.H.: Quorums from difference covers. Information Processing Letters 75(1-2), 9-12 (2000)
6. Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 36-48. Springer, Heidelberg (2006)
7. Fischer, J., Heun, V.: A new succinct representation of RMQ-information and improvements in the enhanced suffix array. In: Chen, B., Paterson, M., Zhang, G. (eds.) ESCAPE 2007. LNCS, vol. 4614, pp. 459-470. Springer, Heidelberg (2007)
8. Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
9. 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)
10. Manber, U., Myers, G.W.: Suffix arrays: a new method for on-line string searches. SIAM Journal of Computing 22(5), 935-948 (1993)
11. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48(3), 407-430 (2001)
12. Manzini, G.: Two space saving tricks for linear time LCP computation. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol. 3111, pp. 372-383. Springer, Heidelberg (2004)
13. McCreight, E.M.: A space-economical suffix tree construction algroithm. Journal of the ACM 23(2), 262-272 (1976)
14. Puglisi, S.J., Smyth, W.F., Turpin, A.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys 39(2), 1-31 (2007)
15. Smyth, B.: Computing Patterns in Strings. Pearson Addison-Wesley, Essex (2003)
16. Ukkonen, E.: Online construction of suffix trees. Algorithmica 14(3), 249-260 (1995)
17. Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th annual Symposium on Foundations of Computer Science, pp. 1-11 (1973)