Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis
Open Access
- 2 May 2012
- journal article
- Published by Springer Nature in Algorithms for Molecular Biology
- Vol. 7 (1) , 10
Abstract
Chaos Game Representation (CGR) is an iterated function that bijectively maps discrete sequences into a continuous domain. As a result, discrete sequences can be object of statistical and topological analyses otherwise reserved to numerical systems. Characteristically, CGR coordinates of substrings sharing an L-long suffix will be located within 2 -L distance of each other. In the two decades since its original proposal, CGR has been generalized beyond its original focus on genomic sequences and has been successfully applied to a wide range of problems in bioinformatics. This report explores the possibility that it can be further extended to approach algorithms that rely on discrete, graph-based representations.Keywords
This publication has 47 references indexed in Scilit:
- The human genome: a multifractal analysisBMC Genomics, 2011
- Efficient alignment of pyrosequencing reads for re-sequencing applicationsBMC Bioinformatics, 2011
- Using genomic signatures for HIV-1 sub-typingBMC Bioinformatics, 2010
- Chaos game representation of human pallidal spike trainsJournal of Biological Physics, 2009
- SOAP2: an improved ultrafast tool for short read alignmentBioinformatics, 2009
- Unstable Tandem Repeats in Promoters Confer Transcriptional EvolvabilityScience, 2009
- Fast and accurate short read alignment with Burrows–Wheeler transformBioinformatics, 2009
- Biological sequences as pictures – a generic two dimensional solution for iterated mapsBMC Bioinformatics, 2009
- Next-generation DNA sequencingNature Biotechnology, 2008
- Local Renyi entropic profiles of DNA sequencesBMC Bioinformatics, 2007