A first step toward chromosome analysis by compression algorithms

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>>

[1]  Jeanette P. Schmidt.  All shortest paths in weighted grid graphs and its application to finding all approximate repeats in strings , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[2]  M. Waterman,et al.  A method for fast database search for all k-nucleotide repeats. , 1994, Nucleic acids research.

[3]  J. Longshore,et al.  Over-representation of the disease associated (CAG) and (CGG) repeats in the human genome. , 1994, Nucleic acids research.

[4]  R. Mott,et al.  Distribution of trinucleotide repeat sequences across a 2 Mbp region containing the Huntington's disease gene. , 1994, Human molecular genetics.

[5]  E. Rivalsy,et al.  Compression and Sequence Comparison , 1994 .

[6]  W. Doerfler,et al.  Triplet repeat sequences in human DNA can be detected by hybridization to a synthetic (5'‐CGG‐3')17 oligodeoxyribonucleotideag] , 1993, FEBS letters.

[7]  Aleksandar Milosavljevic,et al.  Discovering simple DNA sequences by the algorithmic significance method , 1993, Comput. Appl. Biosci..

[8]  Gad M. Landau,et al.  An Algorithm for Approximate Tandem Repeats , 1993, CPM.

[9]  Lars Kai Hansen,et al.  On the Robustness of Maximum Entropy Relationships for Complexity Distributions of Nucleotide Sequences , 1993, Comput. Chem..

[10]  Stéphane Grumbach,et al.  Compression of DNA sequences , 1993, [Proceedings] DCC `93: Data Compression Conference.

[11]  S Karlin,et al.  Assessments of DNA inhomogeneities in yeast chromosome III. , 1993, Nucleic acids research.

[12]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[13]  H. P. Yockey,et al.  Information Theory And Molecular Biology , 1992 .

[14]  S Karlin,et al.  An efficient algorithm for identifying matches with errors in multiple long molecular sequences. , 1991, Journal of molecular biology.

[15]  E. Gilson,et al.  Palindromic units are part of a new bacterial interspersed mosaic element (BIME). , 1991, Nucleic acids research.

[16]  G. Bernardi,et al.  The isochore organization of the human genome. , 1989, Annual review of genetics.

[17]  D. Tautz,et al.  Cryptic simplicity in DNA is a major source of genetic variation , 1986, Nature.