1.H. Driven IFS and Data Analysis

IFS Driven by DNA Sequences

Here is an example first explored by H. Joel Jeffrey. The genetic code is written in an alphabet of four characters: C, A, T, and G. A sequence of several billion of these makes each of us. A sequence of 3957 symbols is needed to encode the formation of the enzyme amylase.

How can we convert a DNA sequence into an IFS picture?

Read the sequence in order, and

apply T₁ whenever C is encountered,

apply T₂ whenever A is encountered,

apply T₃ whenever T is encountered, and

apply T₄ whenever G is encountered,

for example.

On the left is the picture that results. Note there are very few points in the region with address GA. (Remember the ordering of the addresses.)

On the right is a picture that results when 3957 points are generated randomly, except that T₄ never immediately follows T₁.

Not an exact match, but certainly suggestive. Here are a few more examples.

Return to Driven IFS and Data Analysis.