# Studying the Polypeptide Sequence (α-Code) of Escherichia coli

Authors: Vladimir R. Rosenfeld
Journal: Journal of Theoretical Chemistry
 (2013)

---

## Abstract

This paper is devoted to algebraically simulating theα-code of bacterium Escherichia coli
and studying contrast factors (words) in its polypeptide sequence. We utilize the methods of
spectral theory of graphs which were previously employed by us for enumerating De Bruijn
and Kautz sequences. The empirical material is borrowed from the computer investigation of
contrast factors in the polypeptide sequences of prokaryotes.


---

## Body

## 1. Introduction

It was proposed [1, 2] to divide 19 out of all the 20 amino acids into two subgroups, an alanine subgroup (of fatty amino acids: alanine, phenylamine, isoleucine, leucine, methionine, proline, threonine, and valine) and a glycine subgroup (of more polar amino acids: cysteine, aspartic acid, glutamic acid, glycine, histidine, lysine, asparagine, glutamine, arginine, tryptophan, and tyrosine), while serine remains a spare element in the full classification thereof. In a shorthand notation, this gives a, f, i, l, m, p, t, and v (an alanine subgroup); c, d, e, g, h, k, n, q, r, w, and y (a glycine subgroup); and s (a free character). The three numbers 1, 2, and 3 were picked to represent the main two subgroups and the character s, respectively.Brute statistics, under the natural ratio of 1s to 2s being 0.526: 0.474, had predicted an almost regular distribution (alternation) of the two ciphers. To check such a hypothesis, there were found the frequencies of all2l (1≤l≤11) possible substrings of the length l in the genomic sequence of E. coli. The results at once showed that the respective perfectly alternating substrings are in fact the least frequent ones, in the entire genomic sequence. However, visual observation allowed suspecting that the main condition for near-to-statistical distribution of the two subgroups of amino acids may be disguised in grouping equal ciphers (either 1 or 2) representing the respective subgroups in adjacent pairs thereof. That is, in lieu of the code 121212⋯12 it should be 112211⋯22, where general ratio of ciphers stays thus unaltered.The situation with pairing of equal ciphers reminded us of the phenomenon of the so-calledα-code in polypeptides. According to it, one turn of polypeptide spiral involves 3.5 amino acids on an average. Since the nearest to 3.5 multiple integer equals 7, it was of interest to interpret the α-code as a one in which all structural features are due to conditionally grouping amino acids into consecutive sevens thereof.Merging the ideas of sevens (which suit well for interpreting theα-code) and pairs (which better obey the natural proportion of amino acids and follow experimental observation) allows us to set forward a universal model of the α-code. In this, the distribution of amino acids along the entire polypeptide sequence should maximize a mean number of pairs of equal integers (1 or 2) that are contained in consecutive sevens of it. Thus, the optimal case is that one has 3 pairs (11 and/or 22) and one unpaired number (1 or 2) which can either be between any two pairs out of the three or be outside of these (e.g., it may comprise a pair with an equal number of the adjacent seven). However, it is more interesting to consider the case when the window of length 7 cuts out a substring without 3 such pairs; this is also a necessary pattern in the sequence.Logically, we could readily establish that the optimalα-code should have not less than 2 pairs of adjacent equal numbers in every window of length 7. Another criterion that seemed to be of use was that the α-code should reject the subsequences 1212 and 2121 since these allow no more than one pair 11 or 22 in most seven-cipher substrings that contain them. Experimentally, there was the third (and strongest of all we know) criterion; the α-code should avoid the inclusion of the palindrome of the type 1211121; however, here, very serious reservations must be made concerning the fact that substituting 2 for 1 (and conversely) in this palindrome produces (longer) substrings that are, on the contrary, not very frequent in the natural sequence of E. coli. In case of longer palindromes including 1211121 (or 2122212), the situation may seem rather ambiguous.That is why we first tried to attest the simplest (for implementation) mathematical criterion of the above; the prohibition of 1212 and 2121, in a modelα-code. Here, we shall turn to some rigorous mathematical matters.


## 2. Preliminaries

First of all, we must introduce an ancillary digraphD′ which is constructed as follows. The vertices of D′ are all the eight ordered triples of 1s and 2s (i.e., 111, 112, 121, 211, 122, 202, 220, and 222) and an arc (a self-loop) goes out of one vertex to another (this same vertex) if the last two ciphers (on the right) in the first triple coincide with the first two ciphers in the second triple. Say there is an arc from 111 to 112 (with two common ciphers: 11) and also an oriented selfloop attached to the vertex 111 (i.e., an arc from 111 into 111 itself).Using the connectivity ofD′, one can mentally travel in it from any vertex v, consecutively traversing arcs and visiting adjacent vertices. So, the passage to any adjacent vertex u along the respective arc (or returning to the original vertex v through the selfloop attached to it, if any) means that one has done a walk of length 1 (et seq.). However, what is very essential is that every walk of the length l, in D′, factually covers l+3 ciphers since every next step increases the number of visited vertices by one but the very first vertex already contained three ciphers, by definition. It is very important to note that the auxiliary digraph D′ allows one to reproduce every sequence of 1s and 2s of length l+3 (l≥0), which also includes sequences containing 1212 and 2121.In order to rule out all forbidden sequences with 1212 and/or 2121, we shall derive fromD′ a “better” working digraph D. Specifically, D is the above digraph D′ less two opposite arcs going from 121 to 212, and vice versa, from 212 to 121. Since now, the problem on enumerating all (model) α-code sequences of length l+3 (l≥3) can be reduced to another one enumerating all walks of length l in the working digraph D.It is not difficult to form the adjacency matrixA=A(D)=[aij]i,j=18 of D, where an entry aij=1 if and only if there is an arc (a selfloop) from the ith vertex to the jth vertex and aij=0, otherwise,  namely,
(1)A=[1000100001000100100010000100010000010010001000010010000000010000].The characteristic polynomialP(D;x) of the digraph D (which is by definition the characteristic polynomial P(A;x) of its adjacency matrix A [3]) is
(2)P(D;x)=x8-2x7+x6-2x5+x4+x2=x2(x-1)(x2+1)(x3-x2-x-1).
The roots of P(D;x) are λ1=1.83929, λ2=1, λ3,4=0, λ5,6=±i, and λ7,8=0.419645±0.6063i, where i=-1. These roots comprise the spectrum (of eigenvalues) of the digraph D [3].Also, we need to construct a derivative matrixA-=J-I-A, where J is the matrix of all 1s while I is a diagonal identity matrix; namely,
(3)A-=[-111101111-1111011010101111010101111100101110110101101110111101110].The matrixA- is the matrix of the complementary digraph D-. The corresponding characteristic polynomial is
(4)P(D-;x)=x8+2x7-15x6-80x5-180x4-232x3-180x2-80x-16.LetHD(t)=∑l=0∞‍Nltl be the generating function of the number of walks in the digraph D, wherein the coefficient Nl of tl is the number of walks of length l, in D. Taking into account that a walk of length l (l≥0) corresponds to a substring of length l+3 of the α-code, one can also write down the generating function S(t) for the number of substrings (of the α-code) of length l as follows:
(5)S(t)=∑l=0∞Nltl+3=t3HD(t).In the next subsection, we shall demonstrate that analytically calculatingS(t) can readily be done with the aid of spectral theory of graphs.


## 3. Main Part

We shall start this subsection with adapting adapted in our notation the following fundamental result (see Theorem 1.11 in [3]).Lemma 1.
LetD be a finite connected (di)graph. Then the generating function HD(t) of the number of walks in D is
(6)HD(t)=1t{(-1)nPD-[-(t+1)/t]PD(1/t)-1},
where n is the number of vertices in D.For practically using (6), one should substitute to the R.H.S. of it the polynomials P(D;x) and P(D-;x) obtained above. After elementary but tedious manipulations (which will be omitted herein) we have arrived at the following formula for our specific digraph D:
(7)HD(t)=∑l=0∞‍Nltl=-2(2t4+3t3+6t2+3t+4t5+t4+2t3+t-1).It should also be noted that along with the exact result given by Theorem 1.11 from [3], there exists a remarkable asymptotic evaluation for Nl, based on Theorem 1.12 in [3]. In our specific case, it gives the following simple formula:
(8)liml→∞Nl=8×1.83929l,
where 8 is the number of vertices in the digraph D while 1.83929 is its eigenvalue λ1 with the maximum modulus (|λ1|>|λs|;2≤s≤8). Thus, there can be deduced the following approximate formula for the entire series HD(t):
(9)HD(x)≈81-1.83929t.From the obtained spectral results for the number of walks, one can immediately derive the respective working formulae for the number of substrings of lengthl (l≥3) of the α-code. So, we arrive at the following final expression:
(10)S(t)=∑l=0∞‍Nltl+3=-2t3(2t4+3t3+6t2+3t+4t5+t4+2t3+t-1)≈8t31-1.83929t,S(t)=8t3+14t4+26t5+48t6+88t7+162t8+298t9+548t10+1008t11+1854t12+3410t13+6272t14+11536t15+21218t16+39026t17+71780t18+132024t19+242830t20+446634t21+821488t22+1510952t23+2779074t24+5111514t25+9401540t26+17292128t27+31805182t28+58498850t29+107596160t30+197900192t31+363995202t32+669491554t33+1231386948t34+2264873704t35+4165752206t36+7662012858t37+14092638768t38+25920403832t39+47675055458t40+87688098058t41+161283557348t42+296646710864t43+545618366270t44+1003548634482t45+1845813711616t46+3394980712368t47+6244343058466t48+11485137482450t49+21124461253284t50+38853941794200t51+71463540529934t52+⋯,S(t)≈8t3+14.714t4+27.064t5+49.778t6+91.557t7+168.4t8+309.74t9+569.69t10+1047.8t11+1927t12+3544.8t13+6519.9t14+11992t15+22057t16+40569t17+74618t18+137240t19+252430t20+464290t21+853970t22+1570700t23+2889000t24+5313700t25+9773400t26+17976000t27+33063000t28+60813000t29+111850000t30+205730000t31+378400000t32+695980000t33+1280100000t34+235450000t35+4330600000t36+7965200000t37+14650000000t38+26946000000t39+49562000000t40+91159000000t41+167670000000t42+308390000000t43+567220000000t44+1043300000000t45+19189000000t46+3529400000000t47+6491600000000t48+11940000000000t49+21961000000000t50+40392000000000t51+74293000000000t52+136650000000000t53+⋯.Beckmann et al. [4] and Brendel et al. [5] studied the measure for evaluating the deviation of the frequency of a string of length n, in a genomic sequence, from its statistically expected magnitude. Here, we shall also adopt their approach [4, 5]. Let w=a1a2⋯an be a sequence of letters, of length n, encoding amino acids in a genome or random sequence (ai∈𝒜20={a,c,d,e,f,g,h,i,k,l,m,n,p,q,r,s,t,v,w,y}, 1≤i≤n). Let further f(w)=f(a1a2⋯an) denote the observed frequency of a string w in a genome. Given the observed frequencies of (n-2)- and (n-1)-mers, one can calculate the expected frequency of n-mers in a genome as follows:
(11)ϕ(a1a2⋯an)=f(a1⋯an-1)f(a2⋯an)f(a2⋯an-1).
To measure the deviation of the observed frequency of string w from its expected occurrence in a genome sequence, one should further define the standard deviation of w as
(12)std(w)=f(w)-ϕ(w)max(ϕ(w),1).
A string is called a contrast factor (or word) if the absolute value of std(w), defined as above, is greater or equal to some threshold value (which is set to be 3.0, in [4, 5]). In other words, a contrast word w should obey the claim |std(w)|≥3.Table1 contains the values std(w) for all 31 8-character contrast factors in the polypeptide sequence of Escherichia coli, wherein the numbers are taken from the full inventory of all possible 256 8-character factors over the two-character alphabet 𝒜2={1,2}, as these follow in the nonincreasing order of the magnitudes of f(w).Table 1
Contrast 8-letter factors in the polypeptide sequence ofEscherichia coli.
Number
w
f
(
w
)
std
(
w
)
Number
w
f
(
w
)
std
(
w
)
1
11111111
10436
4.686098
61
21121112
3489
3.470266
2
11111112
5225
-
6.185607
70
21211111
3439
-
3.430215
3
21111111
5214
-
6.595223
74
21121111
3430
-
3.594918
5
12111111
4886
4.464338
78
11211112
3403
-
3.546551
6
11112111
4852
3.606632
82
12211222
3378
-
3.168103
7
11111121
4835
3.235524
92
21111121
3341
-
4.150119
10
11111122
4126
-
3.226558
94
22211221
3337
7.776085
13
22111111
4064
-
4.725432
110
12111112
3234
-
5.338942
16
11221122
3977
5.215973
119
12121111
3193
3.538106
26
21111112
3749
8.531731
132
21211112
3124
4.053076
29
21112111
3728
-
3.948552
155
12211212
3018
-
3.143041
30
22111112
3726
5.740505
162
21111212
2980
3.490677
33
22112112
3665
-
3.097771
165
12112222
2971
-
4.237803
34
11112112
3639
-
3.956724
177
22122212
2910
3.511413
40
21111122
3618
4.192473
206
22222222
2767
3.071546
41
21112112
3609
4.460223Now we shall consider some conclusions.


## 4. Conclusions

The following inferences can be drawn.(1)
The distribution the most contrast factors approximately corresponds to that of the most frequent ones. Say the first 16 out of 31 contrast factors fall into the group of the 41 most frequent factors, whereas 50 of the least frequent factors include no contrast factors whatever. The last, 31st, contrast word is 206th in the complete list of all 8-character sequences over𝒜2.(2)
It is clearly seen that a “nonpolar” alanine subgroup of amino acids, denoted by 1, and a “polar” glycine subgroup, denoted by 2, play asymmetric parts in composing the contrast words. For instance, 1 is the last character of word 12 times while 2 is at the tail 19 times; truly, at the head of word the respective numbers are 14 and 17, whose difference seems to be not so essential. The sums12+14=26 and 19+17=36 also conserve this disbalance of frequencies. Thus, mutually substituting 1s for all 2s, and vice versa, in the words collected in Table 1 is not at all an invariant action on it. Additionally note that out of 8×31=248 characters comprising the 31 contrast words 2 appears only 86 times (or in 34.68% of cases). Separately, the number of occurrences of 2 in Table 1 for the words w with std(w)≥3 is 48 (or 19.35% of cases) and that for the words with std(w)≤-3 is 38 (or 15.32% of cases). Since the share of 2 in a natural polypeptide sequence of  Escherichia coli is 0.474, contrast factors in it can comprise only a minor part of its total length (it is a trivial qualitative fact that is easily deducible from the data in Table 1). But another readily seen fact is of paramount importance. Contrast factors occur chiefly due to the presence of a fattier alanine subgroup of amino acids, denoted by 1.(3)
Since (the most preferable) contrast factorsw with std(w)≥3 and (the most avoidable) contrast factors with std(w)≤-3 have practically equal frequencies in Table 1 (16 and 15, resp.), both types of contrast factors play a commanding role in forming the polypeptide sequence (in particular of Escherichia coli). That is, the synthesis of polypeptides in nature is carried out so as to give preference to the maximum number of admissible “preferable” factors and reject the maximum number of avoidable factors. Though the contrast factors themselves comprise only a minor part of polypeptide sequence (see above), their existence, with the underlined preference of one of them and avoidance of the others, crucially controls the synthesis of polypeptides. Accordingly, noncontrast factors occur in a quite statistical way and thereby ensure the conservation of the natural ratio of polar and fatty amino acids. The current study just emphasizes the significance of compiling a special dictionary of contrast factors for polypeptides.(4)
Thus, the role of noncontrast factors is to be the main building material for the aminoacid sequence ofEscherichia coli and, as we may guess, also of such a sequence of any other organism. Since our proposed mathematical approach is applicable to an arbitrary aminoacid sequence, it would be of interest to check it for different organism, as well as to investigate aminoacid factors of different lengths (longer than 7, as in our present work).The material of this paper has entirely been borrowed from [6]. Additionally, the interested reader may see also unsolved combinatorial problems in our earlier publications [7, 8].



---

*Source: 961378-2013-12-29.xml*