
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Rezaul Alam Chowdhury, HaiSon Le, Vijaya Ramachandran, "CacheOblivious Dynamic Programming for Bioinformatics," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 3, pp. 495510, JulySeptember, 2010.  
BibTex  x  
@article{ 10.1109/TCBB.2008.94, author = {Rezaul Alam Chowdhury and HaiSon Le and Vijaya Ramachandran}, title = {CacheOblivious Dynamic Programming for Bioinformatics}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {7}, number = {3}, issn = {15455963}, year = {2010}, pages = {495510}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.94}, 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  CacheOblivious Dynamic Programming for Bioinformatics IS  3 SN  15455963 SP495 EP510 EPD  495510 A1  Rezaul Alam Chowdhury, A1  HaiSon Le, A1  Vijaya Ramachandran, PY  2010 KW  Sequence alignment KW  median KW  RNA secondary structure prediction KW  dynamic programming KW  cacheefficient KW  cacheoblivious. VL  7 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] A. Aggarwal and J. Vitter, "The Input/Output Complexity of Sorting and Related Problems," Comm. ACM, vol. 31, pp. 11161127, 1988.
[2] A. Aho, D. Hirschberg, and J. Ullman, "Bounds on the Complexity of the Longest Common Subsequence Problem," J. ACM, vol. 23, no. 1, pp. 112, 1976.
[3] T. Akutsu, "Dynamic Programming Algorithms for RNA Secondary Structure Prediction with Pseudoknots," Discrete Applied Math., vol. 104, pp. 4562, 2000.
[4] S. Altschul and B. Erickson, "Optimal Sequence Alignment Using Affine Gap Costs," Bull. Math. Biology, vol. 48, pp. 603616, 1986.
[5] A. Apostolico, S. Browne, and C. Guerra, "Fast LinearSpace Computations of Longest Common Subsequences," Theoretical Computer Science, vol. 92, no. 1, pp. 317, 1992.
[6] L. Bergroth, H. Hakonen, and T. Raita, "A Survey of Longest Common Subsequence Algorithms," Proc. Seventh String Processing and Information Retrieval (SPIRE '00), pp. 3948, 2000.
[7] J. Cannone, S. Subramanian, M. Schnare, J. Collett, L. D'Souza, Y. Du, B. Feng, N. Lin, L. Madabusi, K. Muller, N. Pande, Z. Shang, N. Yu, and R. Gutell, "The Comparative RNA Web (CRW) Site: An Online Database of Comparative Sequence and Structure Information for Ribosomal, Intron, and Other RNAs," BMC Bioinformatics, vol. 3, no. 2,http:/www.rna.icmb.utexas. edu/, 2002.
[8] R. Chowdhury, "Algorithms and Data Structures for CacheEfficient Computation: Theory and Experimental Evaluation," PhD thesis, Dept. of Computer Sciences, Univ. of Texas at Austin, 2007.
[9] R. Chowdhury, H. Le, and V. Ramachandran, "Efficient CacheOblivious String Algorithms for Bioinformatics," Technical Report TR0703, Dept. of Computer Sciences, Univ. of Texas at Austin, Feb. 2007.
[10] R. Chowdhury and V. Ramachandran, "CacheOblivious Dynamic Programming," Proc. 17th Ann. ACMSIAM Symp. Discrete Algorithms (SODA '06), pp. 591600, 2006.
[11] R. Chowdhury and V. Ramachandran, "The CacheOblivious Gaussian Elimination Paradigm: Theoretical Framework and Experimental Evaluation," to appear in Theory of Computing Systems (Special Issue for SPAA '07), 2010, preliminary version appeared in Proc. 19th ACM Symp. Parallelism in Algorithms and Architectures (SPAA '07), pp. 7180, 2007.
[12] R. Chowdhury and V. Ramachandran, "CacheEfficient Dynamic Programming Algorithms for Multicores," Proc. 20th ACM Symp. Parallelism in Algorithms and Architectures (SPAA '08), pp. 207216, 2008.
[13] R. Chowdhury, F. Silvestri, B. Blakeley, and V. Ramachandran, "Oblivious Algorithms for Multicores and Network of Processors," to appear in Proc. 24th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '10), 2010.
[14] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. The MIT Press, 2001.
[15] M. Crochemore, G. Landau, and M. ZivUkelson, "A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices," SIAM J. Computing, vol. 32, no. 6, pp. 16541673, 2003.
[16] T. DeSantis, I. Dubosarskiy, S. Murray, and G. Andersen, "Comprehensive Aligned Sequence Construction for Automated Design of Effective Probes (CascadeP) Using 16S rDNA," Bioinformatics, vol. 19, pp. 14611468, http://greengenes.llnl. gov16S/, 2003.
[17] R. Durbin, S. Eddy, A. Krogh, and G. Mitchison, Biological Sequence Analysis. Cambridge Univ. Press, 1998.
[18] M. Frigo, C. Leiserson, H. Prokop, and S. Ramachandran, "CacheOblivious Algorithms," Proc. 40th Ann. IEEE Symp. Foundations of Computer Science (FOCS '99), pp. 285297, 1999.
[19] M. Frigo and V. Strumpen, "CacheOblivious Stencil Computations," Proc. 19th ACM Int'l Conf. Supercomputing (ICS '05), pp. 361366, 2005.
[20] O. Gotoh, "An Improved Algorithm for Matching Biological Sequences," J. Molecular Biology, vol. 162, pp. 705708, 1982.
[21] J. Grice, R. Hughey, and D. Speck, "Reduced Space Sequence Alignment," Computer Applications in the Biosciences, vol. 13, no. 1, pp. 4553, 1997.
[22] D. Gusfield, Algorithms on Strings, Trees and Sequences. Cambridge Univ. Press, 1997.
[23] D. Hirschberg, "A Linear Space Algorithm for Computing Maximal Common Subsequences," Comm. ACM, vol. 18, no. 6, pp. 341343, 1975.
[24] D. Hirschberg, "An Information Theoretic Lower Bound for the Longest Common Subsequence Problem," Information Processing Letters, vol. 7, no. 1, pp. 4041, 1978.
[25] J. Hong and H. Kung, "I/O Complexity: The RedBlue Pebble Game," Proc. 13th Ann. ACM Symp. Theory of Computation (STOC '81), pp. 326333, 1981.
[26] J. Kleinberg and E. Tardos, Algorithm Design. AddisonWesley, 2005.
[27] B. Knudsen, Multiple Parsimony Alignment with "affalign", software package multalign.tar, 2008.
[28] B. Knudsen, "Optimal Multiple Parsimony Alignment with Affine Gap Cost Using a Phylogenetic Tree," Proc. Third Workshop Algorithms in Bioinformatics (WABI '03), pp. 433446, 2003.
[29] S. Kumar and C. Rangan, "A LinearSpace Algorithm for the LCS Problem," Acta Informatica, vol. 24, pp. 353362, 1987.
[30] H. Le, "Algorithms for Identification of Patterns in Biogeography and Median Alignment of Three Sequences in Bioinformatics," undergraduate honors thesis, Dept. of Computer Sciences, Univ. of Texas at Austin, CSTR0629, 2006.
[31] R. Lyngsø and C. Pedersen, "RNA Pseudoknot Prediction in EnergyBased Models," J. Computational Biology, vol. 7, no. 3/4, pp. 409427, 2000.
[32] D. Maier, "The Complexity of Some Problems on Subsequences and Supersequences," J. ACM, vol. 25, no. 2, pp. 322336, 1978.
[33] W. Masek and M. Paterson, "A Faster Algorithm for Computing String Edit Distances," J. Computer and System Sciences, vol. 20, no. 1, pp. 1831, 1980.
[34] E. Myers and W. Miller, "Optimal Alignments in Linear Space," Computer Applications in the Biosciences, vol. 4, no. 1, pp. 1117, 1988.
[35] W. Pearson and D. Lipman, "Improved Tools for Biological Sequence Comparison," Proc. Nat'l Academy of Sciences USA, vol. 85, pp. 24442448, 1988.
[36] C. Pedersen, "Algorithms in Computational Biology," PhD thesis, Dept. of Computer Science, Univ. of Aarhus, 1999.
[37] D. Powell, Software Package, align3str_checkp.tar.gz, 2008.
[38] D. Powell, L. Allison, and T. Dix, "Fast, Optimal Alignment of Three Sequences Using Linear Gap Cost," J. Theoretical Biology, vol. 207, no. 3, pp. 325336, 2000.
[39] E. Rivas and S. Eddy, "A Dynamic Programming Algorithm for RNA Structure Prediction Including Pseudoknots," J. Molecular Biology, vol. 285, no. 5, pp. 20532068, 1999.
[40] J. Seward and N. Nethercote, Valgrind (Debugging and Profiling Tool for x86Linux Programs), http://valgrind.kde.orgindex.html, 2008.
[41] J. Thomas et al., "Comparative Analyses of MultiSpecies Sequences from Targeted Genomic Regions," Nature, vol. 424, pp. 788793, 2003.
[42] M. Waterman, Introduction to Computational Biology. Chapman and Hall, 1995.