Cache and energy efficient alignment of very long sequences

We develop cache and energy efficient algorithms to align very long sequences. These algorithms were evaluated experimentally on a single node of the IBM Blue Gene/Q. We were able to reduce the run time of the classical Myers and Miller linear space alignment algorithm by up to 43%; energy consumption was reduced by up to 45% on our test data.

[1]  Eugene W. Myers,et al.  Optimal alignments in linear space , 1988, Comput. Appl. Biosci..

[2]  Nuno Roma,et al.  A Parallel Programming Framework for Multi-core DNA Sequence Alignment , 2010, 2010 International Conference on Complex, Intelligent and Software Intensive Systems.

[3]  Edans Flavius de Oliveira Sandes,et al.  Smith-Waterman Alignment of Huge Sequences with GPU in Linear Space , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

[4]  A. Apostolio,et al.  A Fast Linear Space Algorithm for Computing Longest Common Subsequences , 1985 .

[5]  Sartaj Sahni,et al.  Pairwise sequence alignment for very long sequences on GPUs , 2012, 2012 IEEE 2nd International Conference on Computational Advances in Bio and medical Sciences (ICCABS).

[6]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[7]  D. Lipman,et al.  Improved tools for biological sequence comparison. , 1988, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Webb Miller,et al.  A space-efficient algorithm for local similarities , 1990, Comput. Appl. Biosci..

[9]  O. Gotoh.  An improved algorithm for matching biological sequences. , 1982, Journal of molecular biology.

[10]  S. Salzberg,et al.  Versatile and open software for comparing large genomes , 2004, Genome Biology.

[11]  Kun-Mao Chao,et al.  A local alignment tool for very long DNA sequences , 1995, Comput. Appl. Biosci..

[12]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[13]  Daniel Etiemble,et al.  Parallel Smith-Waterman Comparison on Multicore and Manycore Computing Platforms with BSP++ , 2012, International Journal of Parallel Programming.

[14]  Stephen W. Poole,et al.  Acceleration of the Smith-Waterman algorithm using single and multiple graphics processors , 2010, J. Comput. Phys..

[15]  S. Henikoff,et al.  Amino acid substitution matrices from protein blocks. , 1992, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Srinivas Aluru,et al.  A Review of Hardware Acceleration for Computational Genomics , 2014, IEEE Design & Test.

[17]  Christus,et al.  A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 2022 .

[18]  Srinivas Aluru,et al.  Space and time optimal parallel sequence alignments , 2004, IEEE Transactions on Parallel and Distributed Systems.

[19]  E. Myers,et al.  Basic local alignment search tool. , 1990, Journal of molecular biology.

[20]  Zhiling Lan,et al.  Application power profiling on IBM Blue Gene/Q , 2013, 2013 IEEE International Conference on Cluster Computing (CLUSTER).

[21]  Zhiling Lan,et al.  Measuring Power Consumption on IBM Blue Gene/Q , 2013, 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum.

[22]  C.,et al.  A Fast Linear Space Algorithm for Computing Longest Common Subsequences , 2013 .

[23]  Jonathan Schaeffer,et al.  FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment , 2006, Algorithmica.