Detection of significant patterns by compression algorithms: The case of approximate tandem repeats in dna sequences

Bioinformatics

Volumn 13, Issue 2, 1997, Pages 131-136

  Rivals, E ^a   Delgrange, O ^b   Delahaye, J R ^a   Dauchet, M ^a   Delorme, M O ^c   Henaut, A ^c   Oiiivier, E ^c  

^a ECOLE CENTRALE DE LILLE   (France)

^b UNIVERSITY OF MONS   (Belgium)

^c LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CHROMOSOME; COMPRESSION; DNA SEQUENCE; PRIORITY JOURNAL; TANDEM REPEAT; YEAST;

ALGORITHMS; BASE SEQUENCE; CHROMOSOMES, FUNGAL; DNA; DNA, FUNGAL; EVALUATION STUDIES; MOLECULAR SEQUENCE DATA; REPETITIVE SEQUENCES, NUCLEIC ACID; SACCHAROMYCES CEREVISIAE; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 0030935318     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/13.2.131     Document Type: Article

References (18)

1. Bell, T.C, Clearly, J.G. and Witten, l.H. (1990) Text Compression. Prentice Hall.
2. Benson, G. and Waterman, M.S. (1994) A method for fast database search for all k-nucleotide repeats. In Symposium on Multiple Alignment. USA IEEE Computer Society Press. Seattle.
3. Cover, TM. and ThomasJ.A. (1991) Information Theory. Wiley Series in Telecommunications. A. Wiley-Interscience.
4. Crochemore, M. and Rytter, W. (1994) Text Algoritlims. Oxford University Press.
5. Delahaye, J.-P (1994) Information, complexite et hasard. Hermes, Paris.
6. Fischetti, V., Landau, G., Schmidt.J. and Sellers.P. (1992) Identifying periodic occurrences of a template with applications to protein structure. In 3rd Annual Symposium of Combinatorial Pattern Matching, pp. 111-120.
7. Grumbach, S. and Tahi.F. (1994) A new challenge for compression algorithms: genetic sequences. J. Inf. Process. Manage., 30, 875—886.
8. Han, J., Hsu, C, Zhu, Z, Longshore, J.W. and Finley, W H. (1994) Over-representation of the disease associated (CAG) and (CGG) repeats in the human genome. Nucleic Acids Res., 22, 1735-1740.
9. Karlin, S., Blaisdell.B.E., Sapolsky.R., Cardon.L. and Burge.C. (1993) Assessments of DNA inhomogeneities in yeast chromosome 111. Nucleic Acids Res., 21, 703-711.
10. Li, M. and Vitanyi, P.M.B. (1993) Introduction to Kolmogorov Complexity'. Springer-Verlag.
11. Milosavljevic, A. and Jurka.J. (1993a) Discovering simple DNA sequences by the algorithmic significance method. Comput. Applic. Biosci, 9, 407-411.
12. Milosavljevic, A. and Jurka, J. (1993b) Discovery by minimal length encoding: a case study in molecular evolution. Machine Learn., 12, 69-87.
13. Ollivier, E., Delorme, M.-0. and Henaut, A. (1995) DosDNA occurs along yeast chromosomes, regardless of functional significance of the sequence. C.R. Acad. Sci., 318, 599-608.
14. Rissanen, J. (1995) Minimum description length principle. In Kotz.S. and Johnson.N.L. (eds). Encyclopedia of Statistical Sciences, 5. Wiley, New York, pp. 523-527.
15. Rivals, E. (1996) Algorithmes de compression et applications a 1'analyse de sequences genetiques. PhD Thesis, LIFL, Universite des Sciences et Techniques de Lille, France
16. Rivals, E, Delgrange, O., Delahaye, J.-P. and Dauchet, M. (1995) A first step towards chromosome analysis by compression algorithms. In Bourbakis.N G. (ed), First International IEEE Symposium on Intelligence in Neural and Biological Systems. IEEE Computer Society Press, pp. 233-239.
17. Wells.R.D. and Sinden.R.R. (1993) Genome rearrangement and stability, chapter Defined ordered sequence DNA, DNA structure, and DNA-directed mutation. In Davies.K.E. and Warren, S.T. (eds), Genome Analysis, 7. Cold Spring Harbor Laboratory Press, Cold Spring Harbor, NY.
18. Ziv.J. and Lempel.A. (1978) Compression of individual sequence via variable length coding. IEEE Trans. Inf. Theory, 24, 530-536.