Space-efficient construction of the Burrows-Wheeler transform

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

Volumn 8214 LNCS, Issue , 2013, Pages 5-16

  Beller, Timo ^a   Zwerger, Maike ^a   Gog, Simon ^b   Ohlebusch, Enno ^a  

^a UNIVERSITY OF ULM   (Germany)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BACKWARD WAVE TUBES; DATA COMPRESSION; INFORMATION RETRIEVAL;

BURROWS-WHEELER TRANSFORM; CONSTRUCTION ALGORITHMS; LINEAR-TIME; MEMORY REQUIREMENTS; TIME-MEMORY TRADE-OFFS;

BIOINFORMATICS;

EID: 84893901024     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-02432-5_5     Document Type: Conference Paper

References (19)

1. Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the BWT of string collections. Theoretical Computer Science 483, 134-148 (2013)
2. Beller, T., Gog, S., Ohlebusch, E., Schnattinger, T.: Computing the longest common prefix array based on the Burrows-Wheeler transform. Journal of Discrete Algorithms 18, 22-31 (2013)
3. Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proc. 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 360-369 (1997)
4. Bingmann, T., Fischer, J., Osipov, V.: Inducing suffix and lcp arrays in external memory. In: Proc. Wkshp. Algorithm Engineering and Experiments (2013)
5. Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Research Report 124, Digital Systems Research Center (1994)
6. Dementiev, R., Kärkkäinen, J., Mehnert, J., Sanders, P.: Better external memory suffix array construction. Journal of Experimental Algorithmics 12, Article No. 3.4 (2008)
7. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 390-398 (2000)
8. Ferragina, P., Gagie, T., Manzini, G.: Lightweight data indexing and compression in external memory. Algorithmica 63(3), 707-730 (2012)
9. Gog, S.: Compressed Suffix Trees: Design, Construction, and Applications. PhD thesis, University of Ulm, Germany (2011)
10. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th Annual Symposium on Foundations of Computer Science, pp. 549-554. IEEE (1989)
11. Kärkkäinen, J.: Fast BWT in small space by blockwise suffix sorting. Theoretical Computer Science 387(3), 249-257 (2007)
12. Larsson, J., Sadakane, K.: Faster suffix sorting. Theoretical Computer Science 387(3), 258-272 (2007)
13. Lippert, R.A., Mobarry, C.M., Walenz, B.P.: A space-efficient construction of the Burrows-Wheeler transform for genomic data. Journal of Computational Biology 12(7), 943-951 (2005)
14. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1), Article No. 2 (2007)
15. Nong, G., Zhang, S., Chan, W.: Linear suffix array construction by almost pure induced-sorting. In: Proc. Data Compression Conference, pp. 193-202 (2009)
16. Nong, G., Zhang, S., Chan, W.: Two efficient algorithms for linear time suffix array construction. IEEE Transactions on Computers 60(10), 1471-1484 (2011)
17. G. Nong Practical Linear-Time O(1)-Workspace Suffix Sorting for Constant Alphabets. ACM Transactions on Information Systems (to appear, July 2013)
18. Okanohara, D., Sadakane, K.: A linear-time Burrows-Wheeler transform using induced sorting. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 90-101. Springer, Heidelberg (2009)
19. Puglisi, S.J., Smyth, W.F., Turpin, A.: A taxonomy of suffix array construction algorithms. ACM Computing Surveys 39(2), Article No. 4 (2007)