Solving Fragment Assembly Problem using hybrid 2-Stage Algorithm

dc.contributor.author	Mohammad, Aziz
dc.contributor.author	Al-Hasan, Md.
dc.contributor.author	Rahman, Md. Arifur
dc.contributor.author	Hossain, Md. Shakhaeat
dc.date.accessioned	2019-07-08T09:58:09Z
dc.date.available	2019-07-08T09:58:09Z
dc.date.issued	2019-07
dc.identifier.uri	http://dspace.uiu.ac.bd/handle/52243/1215
dc.description.abstract	Deoxyribonucleic acid (DNA) is the carrier of the hereditary characteristics of an organism. It also holds promise for predicting fatal diseases. These predictions are essential as they enable prevention rather than cure. However, such detection techniques would be improbable without comprehending the complete genome of an organism. Through our work we tried to unravel the genome code by assembling DNA fragments using our 2-stage hybrid algorithm which employs Ant Colony Optimization and deft Local Search technique to maximize the DNA fragment overlap count.	en_US
dc.language.iso	en_US	en_US
dc.subject	Genome Assembly	en_US
dc.subject	Optimization	en_US
dc.title	Solving Fragment Assembly Problem using hybrid 2-Stage Algorithm	en_US
dc.type	Thesis	en_US