基因组压缩技术网页开发公告

Md. Syed Mahamud Hossein, A. Mukherjee, S. Ghosh
{"title":"基因组压缩技术网页开发公告","authors":"Md. Syed Mahamud Hossein, A. Mukherjee, S. Ghosh","doi":"10.1109/ICMLC.2010.59","DOIUrl":null,"url":null,"abstract":"This is web based project which mainly deals with GENOMIC COMPRESSION. Here we have used several compression techniques i,e Huffman Compression Techniques, Four base to single base compression techniques..etc for compressing Nucleotide sequence of huge size. There are two phases one is ADMINISTRATOR and another NORMAL USER. ADMINISTRATOR handles the data and maintains the database. Initially our aim to generate the encoded file for a particular file at runtime and the signature of that particular file are stored in another file to identify that particular file while decoding but we were not able to generate at runtime but rather we store the encoded file along with signature file in the database and while retrieving decoded data from encoded data we use encoded data file along with the signature file. The DNA sequences storing and transmitting them may require a huge amount of space. This web page are help to reduce the space for storing and transmitting data, also introduce one new techniques along with exiting Huffman Technique of compression routine. DNA and RNA sequences can be considered as tests over a four letter alphabet, namely {a, t, g and c}. This algorithm can approach a compression rate of 2.1 bits /base and even lower. We tested the program on standard benchmark data used. The greatest advantage of this program is fast execution, small memory occupation and easy implementation.","PeriodicalId":423912,"journal":{"name":"2010 Second International Conference on Machine Learning and Computing","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Notice of RetractionWebpage Development for Genome Compression Technique\",\"authors\":\"Md. Syed Mahamud Hossein, A. Mukherjee, S. Ghosh\",\"doi\":\"10.1109/ICMLC.2010.59\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This is web based project which mainly deals with GENOMIC COMPRESSION. Here we have used several compression techniques i,e Huffman Compression Techniques, Four base to single base compression techniques..etc for compressing Nucleotide sequence of huge size. There are two phases one is ADMINISTRATOR and another NORMAL USER. ADMINISTRATOR handles the data and maintains the database. Initially our aim to generate the encoded file for a particular file at runtime and the signature of that particular file are stored in another file to identify that particular file while decoding but we were not able to generate at runtime but rather we store the encoded file along with signature file in the database and while retrieving decoded data from encoded data we use encoded data file along with the signature file. The DNA sequences storing and transmitting them may require a huge amount of space. This web page are help to reduce the space for storing and transmitting data, also introduce one new techniques along with exiting Huffman Technique of compression routine. DNA and RNA sequences can be considered as tests over a four letter alphabet, namely {a, t, g and c}. This algorithm can approach a compression rate of 2.1 bits /base and even lower. We tested the program on standard benchmark data used. The greatest advantage of this program is fast execution, small memory occupation and easy implementation.\",\"PeriodicalId\":423912,\"journal\":{\"name\":\"2010 Second International Conference on Machine Learning and Computing\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-02-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Machine Learning and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMLC.2010.59\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Machine Learning and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC.2010.59","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

这是一个基于网络的项目,主要处理基因组压缩。在这里,我们使用了几种压缩技术,如霍夫曼压缩技术,四碱基到单碱基压缩技术等来压缩大尺寸的核苷酸序列。有两个阶段,一个是管理员和另一个普通用户。管理员处理数据并维护数据库。最初,我们的目标是在运行时为特定文件生成编码文件,并将该特定文件的签名存储在另一个文件中,以便在解码时识别该特定文件,但我们无法在运行时生成,而是将编码文件与签名文件一起存储在数据库中,当从编码数据中检索解码数据时,我们使用编码数据文件和签名文件。存储和传输它们的DNA序列可能需要巨大的空间。为了减少数据的存储和传输空间,在现有的霍夫曼压缩程序的基础上引入了一种新的压缩技术。DNA和RNA序列可以看作是对四个字母的测试,即{a, t, g和c}。该算法可以接近2.1位/基的压缩率,甚至更低。我们在使用的标准基准数据上测试了该程序。该程序最大的优点是执行速度快,占用内存少,易于实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Notice of RetractionWebpage Development for Genome Compression Technique
This is web based project which mainly deals with GENOMIC COMPRESSION. Here we have used several compression techniques i,e Huffman Compression Techniques, Four base to single base compression techniques..etc for compressing Nucleotide sequence of huge size. There are two phases one is ADMINISTRATOR and another NORMAL USER. ADMINISTRATOR handles the data and maintains the database. Initially our aim to generate the encoded file for a particular file at runtime and the signature of that particular file are stored in another file to identify that particular file while decoding but we were not able to generate at runtime but rather we store the encoded file along with signature file in the database and while retrieving decoded data from encoded data we use encoded data file along with the signature file. The DNA sequences storing and transmitting them may require a huge amount of space. This web page are help to reduce the space for storing and transmitting data, also introduce one new techniques along with exiting Huffman Technique of compression routine. DNA and RNA sequences can be considered as tests over a four letter alphabet, namely {a, t, g and c}. This algorithm can approach a compression rate of 2.1 bits /base and even lower. We tested the program on standard benchmark data used. The greatest advantage of this program is fast execution, small memory occupation and easy implementation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信