A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The 2011 International Conference on Computer Engineering & Systems
Recently, many parallel solutions were proposed in order to accelerate the exact methods of aligning huge DNA sequences. However, most of these solutions restrict the sequence's sizes to be in kilobytes, in such a way that megabyte-scale genome comparison cannot be achieved. In addition, these solutions calculate only the alignment similarity score without finding the actual alignment. This paper presents an efficient solution to find the optimal alignment of the huge DNA sequences. Thisdoi:10.1109/icces.2011.6141059 fatcat:2esc64abqrhuzcneodwrpje2xa