CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2010 vol.7 Issue No.03 - July-September
Issue No.03 - July-September (2010 vol.7)
Rezaul Alam Chowdhury , The University of Texas at Austin, Austin
Vijaya Ramachandran , The University of Texas at Austin, Austin
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.94
We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alignment and three-way sequence alignment (or median), both with affine gap costs, and RNA secondary structure prediction with simple pseudoknots. For each of these problems, we present cache-oblivious algorithms that match the best-known time complexity, match or improve the best-known space complexity, and improve significantly over the cache-efficiency of earlier algorithms. We present experimental results which show that our cache-oblivious algorithms run faster than software and implementations based on previous best algorithms for these problems.
Sequence alignment, median, RNA secondary structure prediction, dynamic programming, cache-efficient, cache-oblivious.
Rezaul Alam Chowdhury, Vijaya Ramachandran, "Cache-Oblivious Dynamic Programming for Bioinformatics", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.7, no. 3, pp. 495-510, July-September 2010, doi:10.1109/TCBB.2008.94