Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/5290
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMehta, Kanika-
dc.contributor.authorGhrera, Satya Prakash [Guided by]-
dc.date.accessioned2022-07-28T13:06:43Z-
dc.date.available2022-07-28T13:06:43Z-
dc.date.issued2015-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui//xmlui/handle/123456789/5290-
dc.description.abstractWith rapid technological development and growth of sequencing data, an umpteen gamut of biological data has been generated. As an alternative, Data Compression is employed to reduce the size of data. In this direction, this paper proposes a new reference-based compression approach ,which is employed as a solution. Firstly, a reference has been constructed from the common sub strings of randomly selected input sequences. Reference set is a pair of key and value, where key is a ngerprint (or a unique id) and value is a sequence of characters. Next, these given sequences are compressed using referential compression algorithm. This is attained by matching the input with the reference and hence, replacing the match found in input by its ngerprints contained in the reference, thereby achieving better compression. The experimental results of this paper show that the approach proposed herein, outperforms the existing approaches and methodologies applied so far.en_US
dc.language.isoenen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectDNA sequencingen_US
dc.subjectDeoxyrib nucleic aciden_US
dc.subjectCampylobacter colien_US
dc.subjectCytosineen_US
dc.subjectGuanineen_US
dc.subjectAlgorithmen_US
dc.titleDNA Compression using Referential Algorithmen_US
dc.typeProject Reporten_US
Appears in Collections:Dissertations (M.Tech.)

Files in This Item:
File Description SizeFormat 
DNA Compression using Referential Algorithm.pdf3.04 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.