• CONTACT
  • LAST ISSUE
  • IN PROGRESS
  • EARLY VIEW
  • ACCEPTED PAPERS
GET_pdf delibra

Volume 13 (1) 2007, 5-12

Information Weights of Nucleotides in DNA Sequences

Dudek Mirosław R. 1, Cebrat Stanisław 2, Kowalczuk Maria 2, Mackiewicz Paweł 2, Nowicka Aleksandra 3, Mackiewicz Dorota 2, Dudkiewicz Małgorzata 3

1Institute of Physics, University of Zielona Góra, ul. A. Szafrana 4a, 65-516 Zielona Góra, Poland
2Division of Genomics, University of Wroclaw, ul. Przybyszewskiego 63/77, 54-148 Wroclaw, Poland
3Faculty of Agriculture, Department of Biometrics, SGGW, Warszawa, Poland

Received:

Rec. Juny 22, 2005

DOI:   10.12921/cmst.2007.13.01.05-12

OAI:   oai:lib.psnc.pl:626

Abstract:

The protein sequence is coded with the help of the triplets of nucleotides, each corresponding to one amino acid in a protein sequence. The triplet code of the coding sequences possesses some informative redundancy. Some triplets are more probable than others. The analogous redundancies appear in all natural languages. The non-equal frequency of the characters in plain text makes possible that entire words can be predicted given the context of the plain text. This is typical problem in cryptanalysis that a plain text is compressed before encrypting it in order to reduce the language redundancies. The nucleotides represent the natural units to discuss the redundancies in the coding sequences of natural genomes. The mutation pressure and selection pressure are the main factors responsible for the observed redundancies. Then, the nucleotide frequency in DNA seems to be the natural information weight. We show, that the probability of a nucleotide to stay nonmutated becomes another, the more efficient information weight. It has smaller redundancy although it is correlated with the nucleotide frequency. We have found the values of probability for nucleotide to stay non-mutated in the particular case of the Borrellia burgdorferi genome. In order to examine the usefulness of the new frequencies we used them in a problem of bit-string packing in a channel with a given capacity. We performed a computer experiment, in which we have generated all possible oligomers consisting of k nucleotides and we have shown, that if the number of bits of the information carried out by the oligomers does not exceed a given threshold value, the same as calculated for genes of the Borrelia burgdorferi genome, then the distribution of the generated oligomers resembles the one used by these genes.

Key words:

Borrelia burgdorferi genome, codon, oligomers, protein sequence

References:

[1] F. H. C. Crick, F. R. S. Leslie Barnett, S. Brenner and R. J. Watts-Tobin, Nature 192, 1227-1232 (1961).
[2] B. Dujon, Trends Genet. 12, 263-270 (1996).
[3] S. Cebrat and M. R. Dudek, Trends Genet. 12, 12 (1996).
[4] B. Dujon and A. Goffeau, Trends Genet. 12, Poster (1996).
[5] R. Román-Roldán, P. Bernaola-Galván and J. L. Oliver, Pattern Recogn. 29, 1187-1194 (1996).
[6] H. P. Yockey, Computers and Chemistry 24, 105-123 (2000)
[7] C. E. Shannon, Bell Syst. Tech. J. 27, 379-424, 623-656 (1948).
[8] D. T. Jones, W. R. Taylor and J. M. Thornton, In CABIOS, 8(3), 275-282 (1992).
[9] S. Cebrat, M. R. Dudek, P. Mackiewicz, M. Kowalczuk and M. Fita, Microbial & Comparative Genomics 2(4) 259-268 (1997).
[10] S. Cebrat and M. R. Dudek, Eur. Phys. J. B3, 271-276 (1998)
[11] Diana Duplij and Steven Duplij, Biophys. Bull. No 497, 1-7 (2000), Visnyk Khark. Univ.
[12] A. Marathe, A. E. Condon and R. M. Corn, J. Comp. Biol. 8, 201-219 (2001).
[13] M. Kowalczuk, P. Mackiewicz, D. Szczepanik, A. Nowicka, M. Dudkiewicz, M. R. Dudek and S. Cebrat, Int. J. Mod. Phys. C12, 1043-1053 (2001).
[14] P. Mackiewicz, M. Kowalczuk, D. Mackiewicz, A. Nowicka, M. Dudkiewicz, A. Łaszkiewicz, M. R. Dudek and S. Cebrat, Physica A314, 646-654 (2002).
[15] M. Kowalczuk, P. Mackiewicz, D. Mackiewicz, A. Nowicka, M. Dudkiewicz, M. R. Dudek and S. Cebrat, BMC Evolutionary Biology 1(1), 13 (2001).
[16] M. Kimura, The Neutral Theory of Molecular Evolution, Cambridge University Press, Cambridge (1983).
[17] A. Nowicka, P. Mackiewicz, M. Dudkiewicz, D. Mackiewicz, M. Kowalczuk, S. Cebrat and M. R. Dudek, in Computational Conference ICCS 2003, Melbourne and St. Petersburg, June 24, 2003, P. M. A. Sloot et al. (Eds.): Lecture Notes in Computer Science 2658, 650-657 (2003), see also cond-mat/0301214.
[18] M. F. Barnsley, Fractals Everywhere, Springer-Verlag. New York (1988).
[19] H. J. Jeffrey, Nucleic Acids Res. 18, 2163-2170 (1990).
[20] B.-L. Hao, H. C. Lee and S. Zhang, Chaos, Solitons, Fractals 11, 825-836 (2000).
[21] A. Nowicka, M. R. Dudek, S. Cebrat, M. Kowalczuk, P. Mackiewicz, M. Dudkiewicz and D. Szczepanik CMST 6, 65-71 (2000).
[22] S. V. Buldyrev, N. V. Dokholyan, S. Havlin, H. E. Stanley and R. H. R. Stanley, Physica A273, 19-32 (1999).
[23] M. Kowalczuk, A. Gierlik, P. Mackiewicz, S. Cebrat and M. R. Dudek, Physica A273, 116-131 (1999).
[24] R. N. Mantegna, S. V. Buldyrev, A. L. Goldberger, S. Havlin, C.-K. Peng, M. Simons and H. E. Stanley, Phys. Rev. Lett. 233169-3172 (1994).
[25] N. Vandewalle, M. Ausloos, Physica A 268, 240-249 (1999).

  • JOURNAL MENU

    • AIMS AND SCOPE
    • EDITORS
    • EDITORIAL BOARD
    • NOTES FOR AUTHORS
    • CONTACT
    • IAN SNOOK PRIZES 2015
    • IAN SNOOK PRIZES 2016
    • IAN SNOOK PRIZES 2017
    • IAN SNOOK PRIZES 2018
    • IAN SNOOK PRIZES 2019
    • IAN SNOOK PRIZES 2020
    • IAN SNOOK PRIZES 2021
    • IAN SNOOK PRIZES 2024
  • GALLERY

    CMST_vol_26_2_2020_okladka_
  • LAST ISSUE

  • MANUSCRIPT SUBMISSION

    • SUBMIT A MANUSCRIPT
  • FUTURE ISSUES

    • ACCEPTED PAPERS
    • EARLY VIEW
    • Volume 31 (1) – in progress
  • ALL ISSUES

    • 2024
      • Volume 30 (3–4)
      • Volume 30 (1–2)
    • 2023
      • Volume 29 (1–4)
    • 2022
      • Volume 28 (4)
      • Volume 28 (3)
      • Volume 28 (2)
      • Volume 28 (1)
    • 2021
      • Volume 27 (4)
      • Volume 27 (3)
      • Volume 27 (2)
      • Volume 27 (1)
    • 2020
      • Volume 26 (4)
      • Volume 26 (3)
      • Volume 26 (2)
      • Volume 26 (1)
    • 2019
      • Volume 25 (4)
      • Volume 25 (3)
      • Volume 25 (2)
      • Volume 25 (1)
    • 2018
      • Volume 24 (4)
      • Volume 24 (3)
      • Volume 24 (2)
      • Volume 24 (1)
    • 2017
      • Volume 23 (4)
      • Volume 23 (3)
      • Volume 23 (2)
      • Volume 23 (1)
    • 2016
      • Volume 22 (4)
      • Volume 22 (3)
      • Volume 22 (2)
      • Volume 22 (1)
    • 2015
      • Volume 21 (4)
      • Volume 21 (3)
      • Volume 21 (2)
      • Volume 21 (1)
    • 2014
      • Volume 20 (4)
      • Volume 20 (3)
      • Volume 20 (2)
      • Volume 20 (1)
    • 2013
      • Volume 19 (4)
      • Volume 19 (3)
      • Volume 19 (2)
      • Volume 19 (1)
    • 2012
      • Volume 18 (2)
      • Volume 18 (1)
    • 2011
      • Volume 17 (1-2)
    • 2010
      • Volume SI (2)
      • Volume SI (1)
      • Volume 16 (2)
      • Volume 16 (1)
    • 2009
      • Volume 15 (2)
      • Volume 15 (1)
    • 2008
      • Volume 14 (2)
      • Volume 14 (1)
    • 2007
      • Volume 13 (2)
      • Volume 13 (1)
    • 2006
      • Volume SI (1)
      • Volume 12 (2)
      • Volume 12 (1)
    • 2005
      • Volume 11 (2)
      • Volume 11 (1)
    • 2004
      • Volume 10 (2)
      • Volume 10 (1)
    • 2003
      • Volume 9 (1)
    • 2002
      • Volume 8 (2)
      • Volume 8 (1)
    • 2001
      • Volume 7 (2)
      • Volume 7 (1)
    • 2000
      • Volume 6 (1)
    • 1999
      • Volume 5 (1)
    • 1998
      • Volume 4 (1)
    • 1997
      • Volume 3 (1)
    • 1996
      • Volume 2 (1)
      • Volume 1 (1)
  • DATABASES

    • AUTHORS BASE
  • CONTACT
  • LAST ISSUE
  • IN PROGRESS
  • EARLY VIEW
  • ACCEPTED PAPERS

© 2025 CMST