Computing the longest common prefix array based on the Burrows-Wheeler transform

Journal of Discrete Algorithms

Volumn 18, Issue , 2013, Pages 22-31

  Beller, Timo ^a   Gog, Simon ^a   Ohlebusch, Enno ^a   Schnattinger, Thomas ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

Burrows Wheeler transform; Longest common prefix array; Shortest absent words; Shortest unique substrings; Wavelet tree

Indexed keywords

BURROWS WHEELER TRANSFORM; LONGEST COMMON PREFIX ARRAY; SHORTEST ABSENT WORDS; SUB-STRINGS; WAVELET TREE;

FORESTRY; INDEXING (OF INFORMATION);

TREES (MATHEMATICS);

INDEXING; INFORMATION RETRIEVAL; MATHEMATICS; TREES;

EID: 84872102147     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2012.07.007     Document Type: Conference Paper

References (45)

1. T. Beller, S. Gog, E. Ohlebusch, and T. Schnattinger Computing the longest common prefix array based on the Burrows-Wheeler transform Proc. 18th International Symposium on String Processing and Information Retrieval Lecture Notes in Computer Science vol. 7024 2011 Springer-Verlag Berlin 197 208
2. N.R. Brisaboa, S. Ladra, and G. Navarro Directly addressable variable-length codes Proc. 16th International Symposium on String Processing and Information Retrieval Lecture Notes in Computer Science vol. 5721 2009 Springer-Verlag Berlin 122 130
3. M. Burrows, D.J. Wheeler, A block-sorting lossless data compression algorithm, Research Report 124, Digital Systems Research Center, 1994.
4. A. Cox, M. Bauer, and G. Rosone Lightweight BWT construction for very large string collections Proc. 22nd Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 6661 2011 Springer-Verlag Berlin 219 231
5. M. Crochemore, F. Mignosi, and A. Restivo Automata and forbidden words Information Processing Letters 67 3 1998 111 117
6. J.S. Culpepper, G. Navarro, S.J. Puglisi, and A. Turpin Top-k ranked document search in general text databases Proc. 18th Annual European Symposium on Algorithms Lecture Notes in Computer Science vol. 6347 2010 Springer-Verlag Berlin 194 205
7. L. Devroye, W. Szpankowski, and B. Rais A note on the height of suffix trees SIAM Journal on Computing 21 1 1992 48 53
8. P. Ferragina, T. Gagie, and G. Manzini Lightweight data indexing and compression in external memory Proc. 9th Latin American Theoretical Informatics Symposium Lecture Notes in Computer Science vol. 6034 2010 Springer-Verlag Berlin 697 710
9. P. Ferragina, G. Manzini, Opportunistic data structures with applications, in: Proc. IEEE Symposium on Foundations of Computer Science, 2000, pp. 390-398.
10. P. Flick, and E. Birney Sense from sequence reads: Methods for alignment and assembly Nature Methods 6 11 Suppl. 2009 S6 S12
11. T. Gagie, S.J. Puglisi, and A. Turpin Range quantile queries: Another virtue of wavelet trees Proc. 16th International Symposium on String Processing and Information Retrieval Lecture Notes in Computer Science vol. 5721 2009 Springer-Verlag Berlin 1 6
12. S. Gog, and E. Ohlebusch Lightweight LCP-array construction in linear time arXiv:1012.4263 2011
13. R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 841-850.
14. D. Gusfield Algorithms on Strings, Trees, and Sequences 1997 Cambridge University Press New York
15. G. Hampikian, T. Andersen, Absent sequences: Nullomers and primes, in: Proc. 12th Pacific Symposium on Biocomputing, 2007, pp. 355-366.
16. J. Herold, S. Kurtz, and R. Giegerich Efficient computation of absent words in genomic sequences BMC Bioinformatics 9 2008 167
17. G. Jacobson Space-efficient static trees and graphs Proc. 30th Annual Symposium on Foundations of Computer Science 1989 IEEE 549 554
18. J. Kärkkäinen Fast BWT in small space by blockwise suffix sorting Theoretical Computer Science 387 3 2007 249 257
19. J. Kärkkäinen, G. Manzini, and S.J. Puglisi Permuted longest-common-prefix array Proc. 20th Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 5577 2009 Springer-Verlag Berlin 181 192
20. J. Kärkkäinen, and S.J. Puglisi Fixed block compression boosting in FM-indexes Proc. 18th International Symposium on String Processing and Information Retrieval Lecture Notes in Computer Science vol. 7024 2011 Springer-Verlag Berlin 174 184
21. J. Kärkkäinen, and P. Sanders Simple linear work suffix array construction Proc. 30th International Colloquium on Automata, Languages and Programming Lecture Notes in Computer Science vol. 2719 2003 Springer-Verlag Berlin 943 955
22. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park Linear-time longest-common-prefix computation in suffix arrays and its applications Proc. 12th Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 2089 2001 Springer-Verlag Berlin 181 192
23. T.-W. Lam, R. Li, A. Tam, S. Wong, E. Wu, and S.-M. Yiu High throughput short read alignment via bi-directional BWT Proc. International Conference on Bioinformatics and Biomedicine 2009 IEEE Computer Society 31 36
24. B. Langmead, C. Trapnell, M. Pop, and S.L. Salzberg Ultrafast and memory-efficient alignment of short DNA sequences to the human genome Genome Biology 10 3 2009 Article R25
25. M. Léonard, L. Mouchard, and M. Salson On the number of elements to reorder when updating a suffix array Journal of Discrete Algorithms 11 2012 87 99
26. H. Li, and R. Durbin Fast and accurate short read alignment with Burrows-Wheeler transform Bioinformatics 25 14 2009 1754 1760
27. R. Li, C. Yu, Y. Li, T.-W. Lam, S.-M. Yiu, K. Kristiansen, and J. Wang Soap2: an improved ultrafast tool for short read alignment Bioinformatics 25 15 2009 1966 1977
28. R.A. Lippert Space-efficient whole genome comparisons with Burrows-Wheeler transforms Journal of Computational Biology 12 4 2005 407 415
29. R.A. Lippert, C.M. Mobarry, and B. Walenz A space-efficient construction of the Burrows-Wheeler transforms for genomic data Journal of Computational Biology 12 7 2005 943 951
30. U. Manber, and E.W. Myers Suffix arrays: A new method for on-line string searches SIAM Journal on Computing 22 5 1993 935 948
31. G. Manzini Two space saving tricks for linear time LCP array computation Proc. 9th Scandinavian Workshop on Algorithm Theory Lecture Notes in Computer Science vol. 3111 2004 Springer-Verlag Berlin 372 383
32. G. Navarro, and V. Mäkinen Compressed full-text indexes ACM Computing Surveys 39 1 2007 Article 2
33. G. Nong, S. Zhang, and W.H. Chan Linear suffix array construction by almost pure induced-sorting Proc. Data Compression Conference 2009 IEEE Computer Society 193 202
34. E. Ohlebusch, J. Fischer, and S. Gog CST++ Proc. 17th International Symposium on String Processing and Information Retrieval Lecture Notes in Computer Science vol. 6393 2010 Springer-Verlag Berlin 322 333
35. E. Ohlebusch, S. Gog, and A. Kügel Computing matching statistics and maximal exact matches on compressed full-text indexes Proc. 17th International Symposium on String Processing and Information Retrieval Lecture Notes in Computer Science vol. 6393 2010 Springer-Verlag Berlin 347 358
36. D. Okanohara, and K. Sadakane A linear-time Burrows-Wheeler transform using induced sorting Proc. 16th International Symposium on String Processing and Information Retrieval Lecture Notes in Computer Science vol. 5721 2009 Springer-Verlag Berlin 90 101
37. J. Pinho, P. Ferreira, S.P. Garcia, and J. Rodrigues On finding minimal absent words BMC Bioinformatics 10 2009 137
38. S.J. Puglisi, W.F. Smyth, and A. Turpin A taxonomy of suffix array construction algorithms ACM Computing Surveys 39 2 2007 1 31
39. S.J. Puglisi, and A. Turpin Space-time tradeoffs for longest-common- prefix array computation Proc. 19th International Symposium on Algorithms and Computation Lecture Notes in Computer Science vol. 5369 2008 Springer-Verlag Berlin 124 135
40. T. Schnattinger, Bidirektionale indexbasierte Suche in Texten, Diploma thesis, University of Ulm, Germany, 2010.
41. J.T. Simpson, and R. Durbin Efficient construction of an assembly string graph using the FM-index Bioinformatics 26 12 2010 i367 i373
42. J. Sirén Compressed suffix arrays for massive data Proc. 16th International Symposium on String Processing and Information Retrieval Lecture Notes in Computer Science vol. 5721 2009 Springer-Verlag Berlin 63 74
43. J. Sirén Sampled longest common prefix array Proc. 21st Annual Symposium on Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 6129 2010 Springer-Verlag Berlin 227 237
44. I. Umar, and R. Abdullah Longest-common-prefix computation in Burrows-Wheeler transformed text Proc. 2nd IMT-GT Regional Conference on Mathematics, Statistics and Applications 2006 Universiti Sains Malaysia Penang
45. Z.-D. Wu, T. Jiang, and W.-J. Su Efficient computation of shortest absent words in a genomic sequence Information Processing Letters 110 14-15 2010 596 601