Versatile succinct representations of the bidirectional Burrows-Wheeler transform

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

Volumn 8125 LNCS, Issue , 2013, Pages 133-144

  Belazzougui, Djamal ^a   Cunial, Fabio ^a   Kärkkäinen, Juha ^a   Mäkinen, Veli ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BURROWS WHEELER TRANSFORM; COMPACT REPRESENTATION; CONSTANT TIME; NEAR-LINEAR TIME; SEQUENCE ANALYSIS; SPACE-TIME TRADEOFFS; SUCCINCT REPRESENTATION; UNIQUE MATCHES;

FORESTRY;

ALGORITHMS;

ALGORITHMS; FORESTRY;

EID: 84884295902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40450-4_12     Document Type: Conference Paper

References (28)

1. Apostolico, A.: The myriad virtues of subword trees. Technical Report 85-540, Department of Computer Science, Purdue University (1985)
2. Apostolico, A., Bock, M.E., Lonardi, S.: Monotony of surprise and large-scale quest for unusual words. In: RECOMB 2002, pp. 22-31 (2002)
3. Apostolico, A., Bock, M.E., Lonardi, S., Xu, X.: Efficient detection of unusual words. J. Comput. Biol. 7(1-2), 71-94 (2000)
4. Belazzougui, D., Boldi, P., Pagh, R., Vigna, S.: Monotone minimal perfect hashing: searching a sorted table with o(1) accesses. In: SODA 2009, pp. 785-794 (2009)
5. Belazzougui, D., Navarro, G.: Alphabet-independent compressed text indexing. ACM Trans. Alg. (to appear, 2013)
6. Beller, T., Berger, K., Ohlebusch, E.: Space-efficient computation of maximal and supermaximal repeats in genome sequences. In: Calderón- Benavides, L., González-Caro, C., Chávez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 99-110. Springer, Heidelberg (2012)
7. Breslauer, D.: An on-line string superprimitivity test. Inform. Process. Lett. 44(6), 345-347 (1992)
8. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM T. Alg. 3(2), 20 (2007)
9. Fischer, J.: Optimal succinctness for range minimum queries. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 158-169. Springer, Heidelberg (2010)
10. Fischer, J., Mäkinen, V., Navarro, G.: Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci. 410(51), 5354-5364 (2009)
11. Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press (1997)
12. Hoare, C.A.R.: Quicksort. The Computer Journal 5(1), 10-16 (1962)
13. Hon, W.-K., Sadakane, K.: Space-economical algorithms for finding maximal unique matches. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 144-152. Springer, Heidelberg (2002)
14. Hon, W.-K., Sadakane, K., Sung, W.-K.: Breaking a time-and-space barrier in constructing full-text indices. SIAM J. Comput. 38(6), 2162-2178 (2009)
15. Kulekci, O., Vitter, J.S., Xu, B.: Efficient maximal repeat finding using the Burrows-Wheeler transform and wavelet tree. TCBB 9(2), 421-429 (2012)
16. Lam, T.W., Li, R., Tam, A., Wong, S., Wu, E., Yiu, S.: High throughput short read alignment via bi-directional BWT. In: BIBM 2009, pp. 31-36 (2009)
17. Li, H., Homer, N.: A survey of sequence alignment algorithms for next-generation sequencing. Brief. Bioinform. 11(5), 473-483 (2010)
18. Li, R., Yu, C., Li, Y., Lam, T.W., Yiu, S.-M., Kristiansen, K., Wang, J.: Soap2: An improved ultrafast tool for short read alignment. Bioinformatics 25(15), 1966-1967 (2009)
19. 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)
20. Pinho, A.J., Ferreira, P.J.S.G., Garcia, S.P., Rodrigues, J.M.O.S.: On finding minimal absent words. BMC Bioinformatics 10(1), 137 (2009)
21. Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM T. Alg. 3(4) (2007)
22. Russo, L.M.S., Navarro, G., Oliveira, A.L.: Dynamic fully-compressed suffix trees. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 191-203. Springer, Heidelberg (2008)
23. Russo, L.M.S., Navarro, G., Oliveira, A.L.: Fully compressed suffix trees. ACM Trans. Alg. 7(4), 53 (2011)
24. Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comput. Syst. 41(4), 589-607 (2007)
25. Sadakane, K.: Succinct data structures for flexible text retrieval systems. J. Discrete Alg. 5(1), 12-22 (2007)
26. Sadakane, K., Navarro, G.: Fully-functional succinct trees. In: SODA 2010, pp. 134-149 (2010)
27. Schnattinger, T., Ohlebusch, E., Gog, S.: Bidirectional search in a string with wavelet trees. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 40-50. Springer, Heidelberg (2010)
28. Schnattinger, T., Ohlebusch, E., Gog, S.: Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inform. Comput. 213, 13-22 (2012)