{"title":"基于无损片段的DNA压缩","authors":"Mridula T, P. Samuel","doi":"10.1109/ICECTECH.2011.5941705","DOIUrl":null,"url":null,"abstract":"This paper introduces a new Lossless Segment Based DNA Compression (LSBD) method for compressing the DNA sequences. It stores the individual gene position in a compressed file. Since LSBD method performs a gene wise compression, further processing of compressed data reduces memory usage. The biggest advantage of this algorithm is that it enables part by part decompression and can work on any sized data. Here the method identifies individual gene location and then constructs triplets that are mapped to an eight bit number. The individual gene information is stored in a pointer table and a pointer is provided to corresponding location in the compressed file. The LSBD technique appropriately compresses the non-base characters and performs well on repeating sequences.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Lossless Segment Based DNA Compression\",\"authors\":\"Mridula T, P. Samuel\",\"doi\":\"10.1109/ICECTECH.2011.5941705\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a new Lossless Segment Based DNA Compression (LSBD) method for compressing the DNA sequences. It stores the individual gene position in a compressed file. Since LSBD method performs a gene wise compression, further processing of compressed data reduces memory usage. The biggest advantage of this algorithm is that it enables part by part decompression and can work on any sized data. Here the method identifies individual gene location and then constructs triplets that are mapped to an eight bit number. The individual gene information is stored in a pointer table and a pointer is provided to corresponding location in the compressed file. The LSBD technique appropriately compresses the non-base characters and performs well on repeating sequences.\",\"PeriodicalId\":184011,\"journal\":{\"name\":\"2011 3rd International Conference on Electronics Computer Technology\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 3rd International Conference on Electronics Computer Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECTECH.2011.5941705\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd International Conference on Electronics Computer Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECTECH.2011.5941705","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper introduces a new Lossless Segment Based DNA Compression (LSBD) method for compressing the DNA sequences. It stores the individual gene position in a compressed file. Since LSBD method performs a gene wise compression, further processing of compressed data reduces memory usage. The biggest advantage of this algorithm is that it enables part by part decompression and can work on any sized data. Here the method identifies individual gene location and then constructs triplets that are mapped to an eight bit number. The individual gene information is stored in a pointer table and a pointer is provided to corresponding location in the compressed file. The LSBD technique appropriately compresses the non-base characters and performs well on repeating sequences.