Minimal entropy probability paths between genome families.
We develop a metric for probability distributions with applications to biological sequence analysis. Our distance metric is obtained by minimizing a functional defined on the class of paths over probability measures on N categories. The underlying mathematical theory is connected to a constrained problem in the calculus of variations. The solution presented is a numerical solution, which approximates the true solution in a set of cases called rich paths where none of the components of the path is zero. The functional to be minimized is motivated by entropy considerations, reflecting the idea that nature might efficiently carry out mutations of genome sequences in such a way that the increase in entropy involved in transformation is as small as possible. We characterize sequences by frequency profiles or probability vectors, in the case of DNA where N is 4 and the components of the probability vector are the frequency of occurrence of each of the bases A, C, G and T. Given two probability vectors a and b, we define a distance function based as the infimum of path integrals of the entropy function H( p) over all admissible paths p(t), 0 < or = t< or =1, with p(t) a probability vector such that p(0)=a and p(1)=b. If the probability paths p(t) are parameterized as y(s) in terms of arc length s and the optimal path is smooth with arc length L, then smooth and "rich" optimal probability paths may be numerically estimated by a hybrid method of iterating Newton's method on solutions of a two point boundary value problem, with unknown distance L between the abscissas, for the Euler-Lagrange equations resulting from a multiplier rule for the constrained optimization problem together with linear regression to improve the arc length estimate L. Matlab code for these numerical methods is provided which works only for "rich" optimal probability vectors. These methods motivate a definition of an elementary distance function which is easier and faster to calculate, works on non-rich vectors, does not involve variational theory and does not involve differential equations, but is a better approximation of the minimal entropy path distance than the distance //b-a//(2). We compute minimal entropy distance matrices for examples of DNA myostatin genes and amino-acid sequences across several species. Output tree dendograms for our minimal entropy metric are compared with dendograms based on BLAST and BLAST identity scores.
Ahlbrandt
Calvin
C
Department of Mathematics, University of Missouri, Columbia, MO 65211-0001, USA. calvin@math.missouri.edu
Benson
Gary
G
Casey
William
W
D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D004247:DNA / Q000737:chemistry / Q000235:genetics; D019277:Entropy; D016678:Genome; D006801:Humans; D020407:Internet; D015233:Models, Statistical; D055435:Myostatin; D010802:Phylogeny; D011336:Probability; D016415:Sequence Alignment / Q000379:methods*; D012984:Software; D016212:Transforming Growth Factor beta / Q000235:genetics
C525911:MSTN protein, human; D055435:Myostatin; D016212:Transforming Growth Factor beta; D004247:DNA