Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis
<p>Abstract</p> <p>Background</p> <p>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 nu...
Main Authors: | Vinga Susana, Carvalho Alexandra M, Francisco Alexandre P, Russo Luís MS, Almeida Jonas S |
---|---|
Format: | Article |
Language: | English |
Published: |
BMC
2012-05-01
|
Series: | Algorithms for Molecular Biology |
Online Access: | http://www.almob.org/content/7/1/10 |
Similar Items
-
Universal sequence map (USM) of arbitrary discrete sequences
by: Almeida Jonas S, et al.
Published: (2002-02-01) -
Analysis of Similarity/Dissimilarity of DNA Sequences Based on Chaos Game Representation
by: Wei Deng, et al.
Published: (2013-01-01) -
Computing distribution of scale independent motifs in biological sequences
by: Vinga Susana, et al.
Published: (2006-10-01) -
Biological sequences as pictures – a generic two dimensional solution for iterated maps
by: Vinga Susana, et al.
Published: (2009-03-01) -
Chaos game representation for comparison of whole genomes
by: Sasikumar Roschen, et al.
Published: (2006-05-01)