Is this what you were looking for?
Exams, Lecture Notes, etc.
Embed: URL:
To view this paper, you need Flash 9
You have an old version of Flash. Click here to download the latest version.
If this doesn't work, please make sure that JavaScript is enabled on your browser.
 
Added By: White Globeon May 4, 2012
Authors: Harshita G. Patil , Manish Narnaware

Cite:
, Harshita G. Patil and Manish Narnaware . A Comparison of Computation Techniques for DNA Sequence Comparison . Last Modified May 4, 2012. Last Accessed May 21, 2013. < http://www.wepapers.com/Papers/400634/A_Comparison_of_Computation_Techniques_for_DNA_Sequence_Comparison_ >.
Description: This Project shows a comparison survey done on DNA sequence comparison techniques. The various techniques implemented are sequential comparison, multithreading on a single computer and multithreading using parallel processing. This Project shows the issues involved in implementing a dynamic programming algorithm for biological sequence comparison on a general purpose parallel computing platform Tiling is an important technique for extraction of parallelism. Informally, tiling consists of partitioning the iteration space into several chunks of computation called tiles (blocks) such that sequential traversal of the tiles covers the entire iteration space. The idea behind tiling is to increase the granularity of computation and decrease the amount of communication incurred between processors. This makes tiling more suitable for distributed memory architectures where communication startup costs are very high and hence frequent communication is undesirable. Our work to develop sequence- comparison mechanism and software supports the identification of sequences of DNA.
Comments / Comment on this document Add a comment (You can embed videos too, from any video site)

 
103 Views
0 Favorites
Paper Type: Unknown
Copyright: Attribution-NonCommercial