Space-efficient whole genome comparisons with Burrows-Wheeler transforms

Journal of Computational Biology

Volumn 12, Issue 4, 2005, Pages 407-415

  Lippert, Ross A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Burrows Wheeler transforms; BWT; Comparative genomics; Compressed suffix array; Strings

Indexed keywords

NUCLEOTIDE;

BURROWS WHEELER TRANSFORM; CALCULATION; COMPARATIVE STUDY; DNA MICROARRAY; GENOME; MAMMAL; MATHEMATICAL PHENOMENA; PRIORITY JOURNAL; REVIEW; SPACE; TIME;

ANIMALS; COMPUTATIONAL BIOLOGY; GENOME; HUMANS; SEQUENCE ALIGNMENT;

MAMMALIA;

EID: 18844405663     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2005.12.407     Document Type: Review

References (17)

1. Abouelhoda, M.I., Kurtz, S., and Ohlebusch, E. 2002. The enhanced suffix array and its applications to genome analysis. Proc. 2nd Int. Workshop on Algorithms in Bioinformatics, 449-463.
2. Burrows, M., and Wheeler, D.J. 1994. A block-sorting lossless data compression algorithm. Technical report, Digital SRC, 1994. Research Report 124.
3. Delcher, A.L., Kasif, S., Fleischmann, R.D., Peterson, J., White, O., and Salzberg, S.L. 1999. Alignment of whole genomes. Nucl. Acids Res. 27(11), 2369-2376.
4. Ferragina, P., and Manzini, G. 2000. Opportunistic data structures with applications. Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS '00), 390-398.
5. Grossi, R., and Vitter, J.S. 2000. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). Proc. 32nd ACM Symp. on Theory of Comp. (STOC '00), 397-406.
6. Gusfield, D. 1997. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, London.
7. Hon, W.-K., Lam, T.W., Sadakane, K., and Sung, W.-K. 2003. Constructing compressed suffix arrays with large alphabets. Lecture Notes in Computer Science 2906, 240-249.
8. Hon, W.-K., and Sadakane, K. 2002. Space-economical algorithms for finding maximal unique matches. Proc. 13th Annual Symp. on Combinatorial Pattern Matching, 144-152.
9. Kurtz, S. 1999. Reducing the space requirement of suffix trees. Software - Practice and Experience 29(13), 1149-1171.
10. Kurtz, S., Choudhuri, J.V., Ohlebusch, E., Schleiermacher, C., Stoye, J., and Giegerich, R. 2001. Reputer: The manifold applications of repeat analysis on a genomic scale. Nucl. Acids Res. 29(22), 4633-4642.
11. Lam, T.W., Sadakane, K., Sung, W.-K., and Yiu, S.-M. 2002. A space and time efficient algorithm for constructing compressed suffix arrays. Computing and Combinatorics: 8th Ann. Int. Conf. (COCOON 2002), Lecture Notes in Computer Science 2387, 401-410.
12. Lippert, R.A., Mobarry, C.M., and Walenz, B.P. 2004. A space-efficient construction of the Burrows Wheeler transform for genomic data. Submitted to J. Comp. Biol. www-math.mit.edu/~lippert/research/JCB-submission-2.pdf.
13. Manber, U., and Myers, E. 1993. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22(5), 935-948.
14. Marsan, L., and Sagot, M.-F. 2000. Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory site consensus identification. J. Comp. Biol. 1, 345-360.
15. McCreight, E. 1976. A space economical suffix tree construction algorithm. J. ACM 23, 262-272.
16. Munro, J.I., Raman, V., and Rao, S.S. 1998. Space efficient suffix trees. Foundations of Software Technology and Theoretical Computer Science, 186-196.
17. Weiner, P. 1973. Linear pattern matching algorithms. Proc. 14th IEEE Symp. on Switching and Automata Theory, 1-11.