Biological sequences as pictures – a generic two dimensional solution for iterated maps
Open Access
- 31 March 2009
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 10 (1) , 100
Abstract
Representing symbolic sequences graphically using iterated maps has enjoyed an enduring popularity since it was first proposed in Jeffrey 1990 as chaos game representation (CGR). The usefulness of this representation goes beyond the convenience of a scale independent representation, it provides a variable memory length representation of transition. This includes the representation of succession with non-integer order, which comes with the promise of generalizing Markovian formalisms. The original proposal targeted genomic sequences only but since then several generalizations have been proposed, many specifically designed to handle protein data.Keywords
This publication has 29 references indexed in Scilit:
- Exploring an alignment free approach for protein classification and structural class predictionBiochimie, 2008
- Local Renyi entropic profiles of DNA sequencesBMC Bioinformatics, 2007
- Scaling theory of transport in complex biological networksProceedings of the National Academy of Sciences, 2007
- Test on the Structure of Biological Sequences via Chaos Game RepresentationStatistical Applications in Genetics and Molecular Biology, 2005
- Rényi continuous entropy of DNA sequencesJournal of Theoretical Biology, 2004
- Father of fractalsNature, 2004
- Chaos game representation of protein structuresJournal of Molecular Graphics, 1994
- Entropic Profiles of DNA Sequences Through Chaos-game-derived ImagesJournal of Theoretical Biology, 1993
- Mathematical characterization of Chaos Game RepresentationJournal of Molecular Biology, 1992
- Chaos game visualization of sequencesComputers & Graphics, 1992