Digital genome in Genetic Sequence Matching Using Big Data Approach
Priyanka H.Y, Smt Kavitha G
M. Tech, Department of CS& E, UBDT College, Davangere, India, India
Abstract
Late innovative advances in Next Generation Sequencing devices have prompted expanding rates of DNA test gathering, arrangement, and sequencing. One instrument can create more than 600 Gb of hereditary grouping information in a solitary run. This makes new chances to effectively handle the expanding workload. We propose another strategy for quick hereditary grouping examination utilizing the Dynamic Distributed Dimensional Data Model (D4M) – a cooperative cluster environment for MATLAB created at MIT Lincoln Laboratory. Taking into account scientific and factual properties, the strategy influences huge information systems and the execution of an Apache Acculumo database to quicken calculations one-hundred fold over different strategies. Examinations of the D4M strategy with the present best quality level for grouping examination, BLAST, demonstrate the two are equivalent in the arrangements they find. This paper will introduce a diagram of the D4M hereditary grouping calculation and measurable examinations with BLAST.
Keywords
How to cite
Priyanka H.Y, Smt Kavitha G (2016). Digital genome in Genetic Sequence Matching Using Big Data Approach. IJAREST, 3(6), 385-391.
BibTeX
@article{ijarest20168F7A86,
title={{Digital genome in Genetic Sequence Matching Using Big Data Approach}},
author={Priyanka H.Y and Smt Kavitha G},
journal={IJAREST},
volume={3},
number={6},
pages={385-391},
year={2016}
}Published under an open-access licence. See copyright & licensing.