Skip to Main content Skip to Navigation

Dynamical Systems in the Analysis of Biological Sequences

Abstract : The Chaos Game Representation (CGR) maps a sequence of letters taken from a finite alphabet onto the unit square in $R^2$. While it is a popular tool, few mathematical results have been proved to date. In this report, we show that the CGR gives rise to a limit measure, assuming only the input sequence is stationary ergodic. Some more precise properties are given in the i.i.d. and Markov cases. A new family of statistical tests to characterize the randomness of the inputs is proposed and analyzed. Finally, some basic properties of the CGR are used to generalize the notion of genomic signature
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:07:09 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:10:50 PM


  • HAL Id : inria-00070651, version 1



Peggy Cénac, Guy Fayolle, Jean-Marc Lasgouttes. Dynamical Systems in the Analysis of Biological Sequences. [Research Report] RR-5351, INRIA. 2004, pp.47. ⟨inria-00070651⟩



Record views


Files downloads