|
Preprints of the Keldysh Institute of Applied Mathematics, 2006, 092, 29 pp.
(Mi ipmp640)
|
|
|
|
Some numeric characteristics of greate genomes
N. N. Kozlov, S. S. Gryaznov
Abstract:
In work results of the calculations for some characteristics of 10 greate genomes C. familiaris, G. gallus, D. rerio, M. musculus, R. norvegicus, A. mellifera, D. melanogaster, A. thaliana, C. elegans, including genome H. sapiens. Full number of investigated genes nearby 200 000. Work is based on the Theorem (Kozlov N.N. DAN (Mathematics), 2007, Т. 412, N 5 (in a press)) which establishes potential of a standard genetic code for the decision of a so-called problem of blocking of genes with reference to the most extensive areas of DNA where each gene codes only one protein. It is shown, that blocking is not casual, not extreme (as minimal and maximal). For human, dog, chicken, mouse, rat and zebra-fish genomes its average value of density of blocking more than three times less than a theoretical maximum and in 2.5 times more a theoretical minimum. Theoretical values are established by the Theorem. It is shown, that plus-chain and a minus-chain of DNA are blocked as a rule equally. Not equiprobable participation terminated codons in blocking is established: TGA it is used more than 50% or nearly so as much as well as both of others ТАА and TAG. The greatest deviation on this and other numerical characteristics (all 5 characteristics are analyzed) are found out in a melliferous bee (Apis Mellifera) as which biologists consider as top of evolution among insects.
Citation:
N. N. Kozlov, S. S. Gryaznov, “Some numeric characteristics of greate genomes”, Keldysh Institute preprints, 2006, 092, 29 pp.
Linking options:
https://www.mathnet.ru/eng/ipmp640 https://www.mathnet.ru/eng/ipmp/y2006/p92
|
|