Research ArticleOpen AccessGoogle Scholar indexed

Simulation for chaos game representation of genomes by recurrent iterated function systems

¹ School of Mathematics and Computational Science, Xiangtan University,Hunan 411105, China.
² School of Mathematics and Computational Science, Xiangtan University,Hunan 411105, China.
³ School of Mathematics and Computational Science, Xiangtan University,Hunan 411105, China.
⁴ School of Mathematical Sciences, Queensland University of Technology,GPO Box 2434, Brisbane, Q 4001, Australia.

Journal of Biomedical Science and Engineering·Volume 01 (2008)·Pages 44–51·Published 1 May 2008·DOI10.4236/jbise.2008.11007

Abstract

Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequences from complete genomes: whole genome DNA sequences, linked coding DNA sequences and linked protein sequences. Some fractal patterns are found in these CGRs. A recurrent iterated function systems (RIFS) model is proposed to simulate the CGRs of these sequences from genomes and their induced measures. Numerical results on 50 genomes show that the RIFS model can simulate very well the CGRs and their induced measures. The parameters estimated in the RIFS model reflect information on species classification.

KeywordsGenomeschaos game representationrecurrent iterated function systems.

J.S. Almeida, J.A. Carrico, A. Maretzek, P.A. Noble, M. Fletcher, “Analysis of genomic sequences by Chaos Game Representation”. Bioinformatics,17( 2001), pp 429-437.
V.V. Anh, K.S. Lau, and Z.G. Yu, “Recognition of an organism from fragments of its complete genome”, Phys. Rev. E, 66 (2002), art. no..031910 , pp. 1-9.
V.V. Anh, Z.G. Yu, J.A. Wanliss, and S.M. Watson, “Prediction of magnetic storm events using the Dst index”, Nonlin. Processes Geophys., 12 (2005), pp. 799-806.
M.F. Barnley, J.H. Elton, and D.P. Hardin, “Recurrent iterated function systems”, Constr. Approx. B, 5 (1989), pp. 3-31.
M.F. Barnsley, and S. Demko, “Iterated function systems and the global construction of fractals”, Proc. R. Soc. London, Ser. A, 399 (1985), pp. 243-275.
S. Basu, A. Pan, C. Dutta and J. Das, “Chaos game representation of proteins”. J. Mol. Graphics and Modelling, 15 (1998), pp. 279-289.
T.A. Brown, Genetics (3rd Edition). CHAPMAN & HALL,London, 1998.
P.J. Deschavanne, A Giron, J. Vilain, G. Fagot and B. Fertil, “Genomics signature: Characterization and classification of species assessed by chaos game representation of sequences”. Mol. Biol. Evol. 16(1999), pp 1391-1399.
K.A.Dill, “Theory for the folding and stability of globular Proteins”, Biochemistry, 24 (1985), pp. 1501-1509.
K. Falconer, Techniques in Fractal Geometry, Wiley, 1997.
A. Fiser, GE Tusnady and I. Simon, “Chaos game representation of protein structures”. J. Mol. Graphics, 12 (1994), pp. 302-304.
N. Goldman, “Nucleotide, dinucleotide and trinucleotide frequencies explain patterns observed in chaos game representations of DNA sequences.
H.J. Jeffrey, “Chaos game representation of gene structure”. Nucleic Acids Research, 18(8): (1990), pp. 2163-2170.
J.Joseph, R. Sasikumar, “Chaos game representation for comparision of whole genomes”. BMC Bioinformatics, 7(2006), pp 243: 1-10.
E.R. Vrscay, “Iterated function systems: theory, applications and inverse problem”, in: Fractal Geometry and Analysis, edited by: Belair, J. and Dubuc, S., Kluwer, Dordrecht, pp. 405-468, 1991.
J. Wang and W. Wang, “Modeling study on the validity of a possibly simplified representation of proteins”, Phys. Rev. E, 61 (2000), pp. 6981-6986.

Menu

Simulation for chaos game representation of genomes by recurrent iterated function systems

Abstract

References (22)