
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Oğuzhan Külekci, Jeffrey Scott Vitter, Bojian Xu, "Efficient Maximal Repeat Finding Using the BurrowsWheeler Transform and Wavelet Tree," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 2, pp. 421429, March/April, 2012.  
BibTex  x  
@article{ 10.1109/TCBB.2011.127, author = {M. Oğuzhan Külekci and Jeffrey Scott Vitter and Bojian Xu}, title = {Efficient Maximal Repeat Finding Using the BurrowsWheeler Transform and Wavelet Tree}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {9}, number = {2}, issn = {15455963}, year = {2012}, pages = {421429}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2011.127}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Efficient Maximal Repeat Finding Using the BurrowsWheeler Transform and Wavelet Tree IS  2 SN  15455963 SP421 EP429 EPD  421429 A1  M. Oğuzhan Külekci, A1  Jeffrey Scott Vitter, A1  Bojian Xu, PY  2012 KW  Repeats KW  maximal repeats KW  BurrowsWheeler transform KW  wavelet trees. VL  9 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] V. Becher, A. Deymonnaz, and P.A. Heiber, “Efficient Computation of All Perfect Repeats in Genomic Sequences of Up To Half a Gigabyte, with a Case Study on the Human Genome,” Bioinformatics, vol. 25, no. 14, pp. 17461753, 2009.
[2] B. Behzadi and F.L. Fessant, “DNA Compression Challenge Revisited: A Dynamic Programming Approach,” Proc. Ann. Symp. Combinatorial Pattern Matching, 2005.
[3] G. Benson, “Tandem Repeats Finder: A Program to Analyze DNA Sequences,” Nucleic Acids Research, vol. 27, no. 2, pp. 573580, 1999.
[4] M. Burrows and D.J. Wheeler, “A Block Sorting Data Compression Algorithm,” technical report, Digital Systems Research Center, 1994.
[5] A.T. Castelo, W. Martins, and G.R. Gao, “TrollTandem Repeat Occurrence Locator,” Bioinformatics, vol. 18, no. 4, pp. 634636, 2002.
[6] R. Dementiev, J. Kärkkäinen, J. Mehnert, and P. Sanders, “Better External Memory Suffix Array Construction,” J. Experimental Algorithmics, vol. 12, pp. 124, 2008.
[7] P. Ferragina and G. Manzini, “Indexing Compressed Text,” J. ACM, vol. 52, no. 4, pp. 552581, 2005.
[8] P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro, “An AlphabetFriendly FMIndex,” Proc. Int'l Symp. String Processing and Information Retrieval (SPIRE), pp. 150160, 2004.
[9] J. Fischer, V. Mäkinen, and N. Välimäki, “Space Efficient String Mining under Frequency Constraints,” Proc. IEEE Int'l Conf. Data Mining, pp. 193202, 2008.
[10] R. Grossi, A. Gupta, and J.S. Vitter, “HighOrder EntropyCompressed Text Indexes,” Proc. ACMSIAM Symp. Discrete Algorithms, pp. 841850, 2003.
[11] R. Grossi and J.S. Vitter, “Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching,” SIAM J. Computing, vol. 35, no. 32, pp. 378407, 2005.
[12] D. Gusfield, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge Univ. Press, 1997.
[13] W.K. Hon, T.W. Lam, K. Sadakane, W.K. Sung, and S.M. Yiu, “A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays,” Algorithmica, vol. 48, no. 1, pp. 2336, 2007.
[14] W.K. Hon, K. Sadakane, and W.K. Sung, “Breaking a TimeandSpace Barrier in Constructing FullText Indices,” SIAM J. Computing, vol. 38, no. 6, pp. 21622178, 2009.
[15] J. Kärkkäinen, “Fast BWT in Small Space by Blockwise Suffix Sorting,” Theoretical Computer Science, vol. 387, no. 3, pp. 249257, 2007.
[16] J. Kärkkäinen, G. Manzini, and S.J. Puglisi, “Permuted LongestCommonPrefix Array,” Proc. 20th Ann. Symp. Combinatorial Pattern Matching (CPM), pp. 181192, 2009.
[17] T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park, “LinearTime LongestCommonPrefix Computation in Suffix Arrays and Its Applications,” Proc. Ann. Symp. Combinatorial Pattern Matching, pp. 181192, 2001.
[18] M.O. Külekci, J.S. Vitter, and B. Xu, “Time and SpaceEfficient Maximal Repeat Finding Using the BurrowsWheeler Transform and Wavelet Trees,” Proc. IEEE Int'l Conf. Bioinformatics and Biomedicine (BIBM), pp. 622625, 2010.
[19] S. Kurtz, “Reducing the Space Requirements of Suffix Trees,” Software—Practice and Experience, vol. 29, no. 13, pp. 11491171, 1999.
[20] S. Kurtz, J.V. Choudhuri, E. Ohlebusch, C. Schleiermacher, J. Stoye, and R. Giegerich, “Reputer: The Manifold Applications of Repeat Analysis on a Genomic Scale,” Nucleic Acids Research, vol. 29, no. 22, pp. 46334642, 2001.
[21] S. Kurtz and C. Schleiermacher, “Reputer: Fast Computation of Maximal Repeats in Complete Genomes,” Bioinformatics, vol. 15, no. 5, pp. 426427, 1999.
[22] A. Lefebvre, T. Lecroq, H. Dauchel, and J. Alexandre, “FORRepeats: Detects Repeats on Entire Chromosomes and between Genomes,” Bioinformatics, vol. 19, no. 3, pp. 319326, 2003.
[23] R. Lippert, “SpaceEfficient Whole Genome Comparisons with BurrowsWheeler Transforms,” J. Computational Biology, vol. 12, no. 4, pp. 407415, 2005.
[24] R.A. Lippert, C.M. Mobarry, and B. Walenz, “A SpaceEfficient Construction of the BurrowsWheeler Transform for Genomic Data,” J. Computational Biology, vol. 12, no. 7, pp. 943951, 2005.
[25] X. Liu and L. Wang, “Finding the Region of PseudoPeriodic Tandem Repeats in Biological Sequences,” Algorithms for Molecular Biology, vol. 1, no. 1, p. 2, 2006.
[26] V. Mäkinen, “Compact Suffix Array: A SpaceEfficient FullText Index,” Fundamenta Informaticae, vol. 56, pp. 191210, Oct. 2002.
[27] G. Manzini, “Two Space Saving Tricks for Linear Time lcp Array Computation,” Proc. Scandinavian Workshop Algorithm Theory, pp. 372383, 2004.
[28] G. Manzini and M. Rastero, “A Simple and Fast DNA Compressor,” Software—Practice and Experience, vol. 34, pp. 13971411, 2004.
[29] H.M. Martinez, “An Efficient Method for Finding Repeats in Molecular Sequences,” Nucleic Acids Research, vol. 11, no. 13, pp. 46294634, 1983.
[30] E.H. McConkey, Human Genetics: The Molecular Revolution. Jones and Bartlett, 1993.
[31] J.C. Na and K. Park, “AlphabetIndependent LinearTime Construction of Compressed Suffix Arrays Using o(nlogn)Bit Working Space,” Theoretical Computer Science, vol. 385, nos. 13, pp. 127136, 2007.
[32] G. Navarro and V. Mäkinen, “Compressed FullText Indexes,” ACM Computing Surveys, vol. 39, no. 1, 2007.
[33] E. Ohlebusch, S. Gog, and A. Kügell, “Computing Matching Statistics and Maximal Exact Matches on Compressed FullText Indexes,” Proc. 17th Int'l Conf. String Processing and Information Retrieval (SPIRE), pp. 347358, 2010.
[34] D. Okanohara and K. Sadakane, “A LinearTime BurrowsWheeler Transform Using Induced Sorting,” Proc. Int'l Symp. String Processing and Information Retrieval, pp. 90101, 2009.
[35] A. Poddar, N. Chandra, M. Ganapathiraju, K. Sekar, J. KleinSeetharaman, R. Judith, R. Reddy, and N. Balakrishnan, “Evolutionary Insights from Suffix Arraybased Genome Sequence Analysis,” J. Biosciences, vol. 32, no. 5, pp. 871881, 2007.
[36] R. Raman, V. Raman, and S.S. Rao, “Succinct Indexable Dictionaries with Applications to Encoding kary Trees, Prefix Sums and Multisets,” ACM Trans. Algorithms, vol. 3, no. 4, p. 43, 2007.
[37] K. Sadakane, “Succinct Representations of lcp Information and Improvements in the Compressed Suffix Arrays,” Proc. Ann. ACMSIAM Symp. Discrete Algorithms, pp. 225232, 2002.
[38] S. Saha, S. Bridges, Z.V. Magbanua, and D.G. Peterson, “Computational Approaches and Tools Used in Identification of Dispersed Repetitive DNA Sequences,” Tropical Plant Biology, vol. 1, no. 1, pp. 8596, 2008.
[39] S. Saha, S. Bridges, Z.V. Magbanua, and D.G. Peterson, “Empirical Comparison of ab Initio Repeat Finding Programs,” Nucleic Acids Research, vol. 36, no. 7, pp. 22842294, 2008.
[40] J. Sirén, “Sampled Longest Common Prefix Array,” Proc. Ann. Symp. Combinatorial Pattern Matching (CPM), pp. 227237, 2010.
[41] N. Välimäki, V. Mäkinen, W. Gerlach, and K. Dixit, “Engineering a Compressed Suffix Tree Implementation,” J. Experimental Algorithmics, vol. 14, pp. 2:4.22:4.23, 2010.
[42] J.S. Vitter, Algorithms and Data Structures for External Memory, Foundations and Trends in Theoretical Computer Science. Now Publishers, 2008.