Lightweight LCP construction for next-generation sequencing datasets

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

Volumn 7534 LNBI, Issue , 2012, Pages 326-337

  Bauer, Markus J ^a   Cox, Anthony J ^a   Rosone, Giovanna ^b   Sciortino, Marinella ^b  

^a ILLUMINA INC   (United States)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

BWT; LCP; massive datasets; next generation sequencing datasets; text indexes

Indexed keywords

BWT; DATA SETS; LCP; MASSIVE DATA SETS; TEXT INDEXES;

ALGORITHMS; BACKWARD WAVE TUBES; DATA STRUCTURES; DNA SEQUENCES;

BIOINFORMATICS;

EID: 84866660349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33122-0_26     Document Type: Conference Paper

References (17)

1. Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms 2(1), 53-86 (2004)
2. Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight BWT Construction for Very Large String Collections. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 219-231. Springer, Heidelberg (2011)
3. Bauer, M.J., Cox, A.J., Rosone, G.: Lightweight algorithms for constructing and inverting the bwt of string collections. Theor. Comput. Sci. (in press, 2012)
4. Beller, T., Gog, S., Ohlebusch, E., Schnattinger, T.: Computing the longest common prefix array based on the Burrows-Wheeler transform. Journal of Discrete Algorithms (to appear)
5. Beller, T., Gog, S., Ohlebusch, E., Schnattinger, T.: Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol. 7024, pp. 197-208. Springer, Heidelberg (2011)
6. Ferragina, P., Gagie, T., Manzini, G.: Lightweight Data Indexing and Compression in External Memory. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 697-710. Springer, Heidelberg (2010)
7. Fischer, J.: Inducing the LCP-Array. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 374-385. Springer, Heidelberg (2011)
8. National Center for Biotechnology Information. Sequence Read Archive, http://trace.ncbi.nlm.nih.gov/Traces/sra/sra.cgi?
9. Gog, S., Ohlebusch, E.: Fast and Lightweight LCP-Array Construction Algorithms. In: ALENEX, pp. 25-34. SIAM (2011)
10. Herold, J., Kurtz, S., Giegerich, R.: Efficient computation of absent words in genomic sequences. BMC Bioinformatics 9(1), 167 (2008)
11. Kärkkäinen, J., Manzini, G., Puglisi, S.J.: Permuted Longest-Common-Prefix Array. In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009 Lille. LNCS, vol. 5577, pp. 181-192. Springer, Heidelberg (2009)
12. Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows- Wheeler Transform. Theor. Comput. Sci. 387(3), 298-312 (2007)
13. Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: A new combinatorial approach to sequence comparison. Theory Comput. Syst. 42(3), 411-429 (2008)
14. Ohlebusch, E., Gog, S., Kügel, A.: Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 347-358. Springer, Heidelberg (2010)
15. Puglisi, S., Turpin, A.: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 124-135. Springer, Heidelberg (2008)
16. Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comp. Sys. 41(4), 589-607 (2007)
17. Shi, F.: Suffix Arrays for Multiple Strings: A Method for On-line Multiple String Searches. In: Jaffar, J., Yap, R.H.C. (eds.) ASIAN 1996. LNCS, vol. 1179, pp. 11-22. Springer, Heidelberg (1996)