A first step toward chromosome analysis by compression algorithms

Eric Rivals, J. Delahaye, M. Dauchet, O. Delgrange
{"title":"A first step toward chromosome analysis by compression algorithms","authors":"Eric Rivals, J. Delahaye, M. Dauchet, O. Delgrange","doi":"10.1109/INBS.1995.404256","DOIUrl":null,"url":null,"abstract":"The authors use Kolmogorov complexity and compression algorithms to study DOS-DNA (DOS: defined ordered sequence). This approach gives quantitative and qualitative explanations of the regularities of apparently regular regions. The authors present the problem of the coding of approximate multiple tandem repeats in order to obtain compression. Then the authors describe an algorithm that allows one to find efficiently approximate multiple tandem repeats. Finally, the authors briefly describe some of their results.<<ETX>>","PeriodicalId":423954,"journal":{"name":"Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings First International Symposium on Intelligence in Neural and Biological Systems. INBS'95","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INBS.1995.404256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

The authors use Kolmogorov complexity and compression algorithms to study DOS-DNA (DOS: defined ordered sequence). This approach gives quantitative and qualitative explanations of the regularities of apparently regular regions. The authors present the problem of the coding of approximate multiple tandem repeats in order to obtain compression. Then the authors describe an algorithm that allows one to find efficiently approximate multiple tandem repeats. Finally, the authors briefly describe some of their results.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用压缩算法进行染色体分析的第一步
作者使用Kolmogorov复杂度和压缩算法来研究DOS- dna (DOS: defined ordered sequence)。这种方法对表面规则区域的规律性给出了定量和定性的解释。为了获得压缩,作者提出了近似多个串联重复序列的编码问题。然后,作者描述了一种算法,可以有效地找到近似的多个串联重复。最后,作者简要描述了他们的一些结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Self-organized learning in multi-layer networks Gene classification artificial neural system Modeling sensory representations in brain: new methods for studying functional architecture reveal unique spatial patterns A genetic algorithm for decomposition type choice in OKFDDs The splicing as an operation on formal languages
×
引用
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