Analysis of Complex Genomics

dc.contributor.advisorVargas-Pérez, Sandino
dc.contributor.authorQureshi, Abdullah
dc.date.accessioned2020-06-15T00:16:01Z
dc.date.available2020-06-15T00:16:01Z
dc.date.issued2020-04-01
dc.description18 p.en_US
dc.description.abstractModern genomic research is acquiring genomic data from millions of people around the world. By 2025 this number is expected to reach a billion. The need for smart compressive parallel algorithms is also increasing to cope up with the analysis of massive genomic data. This paper discusses the functionality, need, and importance of compressive algorithms. Furthermore, this paper analyses and compares two parallel compressive algorithms, PHYNGSC and DSRC 2. The performance of both algorithms is evaluated with different inputs, and scalability is tested to decide which algorithm is better for genomic analysis.en_US
dc.format.mimetypeapplication/pdf
dc.identifier.urihttps://cache.kzoo.edu/handle/10920/38614
dc.language.isoen_USen_US
dc.relation.ispartofKalamazoo College Physics Senior Individualized Projects Collection
dc.rightsU.S. copyright laws protect this material. Commercial use or distribution of this material is not permitted without prior written permission of the copyright holder. All rights reserved.
dc.titleAnalysis of Complex Genomicsen_US
dc.typeThesisen_US
Files