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.<>
作者使用Kolmogorov复杂度和压缩算法来研究DOS- dna (DOS: defined ordered sequence)。这种方法对表面规则区域的规律性给出了定量和定性的解释。为了获得压缩,作者提出了近似多个串联重复序列的编码问题。然后,作者描述了一种算法,可以有效地找到近似的多个串联重复。最后,作者简要描述了他们的一些结果。