Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/4850
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jindal, Parisha | - |
dc.date.accessioned | 2014-08-19T07:59:42Z | - |
dc.date.available | 2014-08-19T07:59:42Z | - |
dc.date.issued | 2014-06-01 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/4850 | - |
dc.description.abstract | The continuous increase in population has exponentially increased the biological datasets to be processed. Hence computations to process these datasets have also increased tremendously. An expedited solution for analysis of this data is required to enable quick decision making for various researches and medical treatments. This raise demand for HPC based solutions of bioinformatics operations for quick processing. Major focus of optimization is on the operations of DNA assembly and alignment. Many companies like Xcelris Genomics working in the field of bioinformatics and life sciences have identified the need for optimized solution for DNA assembly and alignment as time and space complexity of existing approaches delay research and analysis based on these datasets. This dissertation work focus on optimization of well known DNA sequence assembly tool Velvet using hybrid computing of HPC technologies. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | 12MCEC09; | - |
dc.subject | Computer 2012 | en_US |
dc.subject | Project Report 2012 | en_US |
dc.subject | Computer Project Report | en_US |
dc.subject | Project Report | en_US |
dc.subject | 12MCE | en_US |
dc.subject | 12MCEC | en_US |
dc.subject | 12MCEC09 | en_US |
dc.title | Optimizing Bioinformatics Operations Using High Performance Computing | en_US |
dc.type | Dissertation | en_US |
Appears in Collections: | Dissertation, CE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
12MCEC09.pdf | 12MCEC09 | 1.1 MB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.