![]() This difference is intuitive since 2D matrices are stored in row-major form. Exploiting Cache LocalityĪccessing data row-wise gave better results than accessing colum-wise. ![]() The main performance metrics were Execution Time and Throughput. We attempt to make improvements upon the baseline performance of the algorithm by parallelizing it and optimizing it to achieve the peak performance possible. The Needleman-Wunsch algorithm is used to find the optimal global alignment, and essentially divides a larger problem into a series of smaller problems to find this optimal alignment. It involves the use of dynamic programming to compare biological sequences. Needleman-Wunsch algorithm is an algorithm that is used in bioinformatics to align DNA or protein sequences. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |