DNA序列和四元循环代码

V. Rykov, A. Macula, D. Torney, P. S. White
{"title":"DNA序列和四元循环代码","authors":"V. Rykov, A. Macula, D. Torney, P. S. White","doi":"10.1109/ISIT.2001.936111","DOIUrl":null,"url":null,"abstract":"There is a need to find generalized or universal tags for multiplex genome analysis. We use sets of reverse complement cyclic codes to generate DNA codes that can be used for DNA tags. These tags are placed on DNA chips and connect with the capture tags floating in a solution. The capture tags attach themselves to these generalized codes and give us much information about an individual strand. We show that the reverse complement cyclic and shortening cyclic codes are suitable for this application. We found theoretical bounds of parameters for these codes and the parameters and the generator polynomials of these codes for length up to 41.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"DNA sequences and quaternary cyclic codes\",\"authors\":\"V. Rykov, A. Macula, D. Torney, P. S. White\",\"doi\":\"10.1109/ISIT.2001.936111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There is a need to find generalized or universal tags for multiplex genome analysis. We use sets of reverse complement cyclic codes to generate DNA codes that can be used for DNA tags. These tags are placed on DNA chips and connect with the capture tags floating in a solution. The capture tags attach themselves to these generalized codes and give us much information about an individual strand. We show that the reverse complement cyclic and shortening cyclic codes are suitable for this application. We found theoretical bounds of parameters for these codes and the parameters and the generator polynomials of these codes for length up to 41.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.936111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

有必要找到通用或通用标签的多重基因组分析。我们使用一组反向互补循环代码来生成可用于DNA标签的DNA代码。这些标签被放置在DNA芯片上,并与漂浮在溶液中的捕获标签连接。捕获标签附着在这些通用代码上,并为我们提供了关于单个链的许多信息。我们证明了逆补循环码和缩短循环码适合于这种应用。我们发现了这些码的参数的理论边界,以及这些码的参数和生成器多项式的长度高达41。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DNA sequences and quaternary cyclic codes
There is a need to find generalized or universal tags for multiplex genome analysis. We use sets of reverse complement cyclic codes to generate DNA codes that can be used for DNA tags. These tags are placed on DNA chips and connect with the capture tags floating in a solution. The capture tags attach themselves to these generalized codes and give us much information about an individual strand. We show that the reverse complement cyclic and shortening cyclic codes are suitable for this application. We found theoretical bounds of parameters for these codes and the parameters and the generator polynomials of these codes for length up to 41.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A simple encodable/decodable OFDM QPSK code with low peak-to-mean envelope power ratio The effect of redundancy on measurement Decision directed algorithms for multiuser detection A new modulation scheme using asymmetric error correcting code embedded in optical orthogonal code for optical CDMA Matrix CUSUM: a recursive multi-hypothesis change detection algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1