<title>Background</title> <p>Automatic analysis of biological sequences is crucial for the treatment of massive genomic outputs. Our understanding of more than 90 % of protein sequences stored in public databases, deduced from automatic translation of gene sequences, will not result from direct experimentation, but from our ability to predict informative features using <italic>in silico </italic>workflows [##REF##16243268##1##,##UREF##0##2##]. An underlying postulate is that the molecular sequences determined in biological individuals or species, which have evolved from a common ancestor sequence and are therefore homologous, have conserved enough of the original features to be similar. Popular sequence alignment methods, such as Blast [##REF##2231712##3##] or Smith-Waterman [##REF##7265238##4##] algorithms are used as a starting point for homology searches. All these methods computes a score <italic>s</italic>(<italic>a</italic>, <italic>b</italic>) between two sequences <italic>a </italic>and <italic>b</italic>. They use scoring matrices to maximize the summed scores of compared residues and find optimal local alignments, computed with a dynamic programming procedure [##REF##2231712##3##,##REF##7265238##4##]. Scoring matrices have been found to be similarity matrices as well [##UREF##1##5##]. Many similarity matrices are available [##UREF##2##6##, ####REF##1438297##7##, ##REF##15948633##8####15948633##8##] and evaluation studies led to the conclusion that all can be considered as log-odds ratio matrices, including the BLOSUM family [##REF##1438297##7##] and the PAM family [##UREF##2##6##]. Log-odds ratio matrices are defined by  where <italic>ω</italic>(<italic>i</italic>, <italic>j</italic>) is the joint probability of the amino acid pair (<italic>i</italic>, <italic>j</italic>), and <italic>ν</italic>(<italic>i</italic>) and <italic>ν</italic>(<italic>j</italic>) the probabilities of the amino acids <italic>i </italic>and <italic>j </italic>in the two aligned sequences.</p> <p>Because re-examination of alignments obtained after massive comparisons is not manageable, confidence in alignment score probabilities is critical for automatic sequence comparisons, clustering of orthologs and paralogs, homology-based annotations or phylogeny reconstructions based on pairwise alignments [##UREF##0##2##]. Assessing whether a computed alignment is evolutionarily relevant or whether it could have arisen simply by chance is therefore a question that has been extensively studied (for review: [##REF##14630646##9##]). Two major methods have been proposed.</p> <p>The first and oldest method, proposed by Lipman and Pearson [##REF##2983426##10##] and described extensively by Comet et al. [##REF##10627144##11##] and others [##REF##11459354##12##, ####REF##14990449##13##, ##REF##15757521##14####15757521##14##], uses Monte Carlo simulations to investigate the significance of a score, <italic>s </italic>calculated from the alignment of two real sequences <italic>a </italic>and <italic>b</italic>. This method consists in computing <italic>η </italic>alignments of <italic>a </italic>with sequences obtained after shuffling <italic>b </italic>[##REF##6842586##15##]. The random sequence corresponding to the shuffled sequence <italic>b </italic>is termed <italic>B</italic>. The <italic>η </italic>alignments allow an estimate of an empirical mean score () and standard deviation () from the distribution of the random variable <italic>S</italic>(<italic>a</italic>, <italic>B</italic>). A <italic>Z</italic>-<italic>value </italic>is then defined as:</p> <p></p> <p>where * indicates the sequence that was submitted to randomization.</p> <p>In practice, the computation of <italic>Z</italic>(<italic>a</italic>, <italic>b*</italic>) is known to be convergent and depends on the accuracy of the estimation of <italic>μ </italic>and <italic>σ</italic>, and therefore on <italic>η</italic>, ranging usually from 100 to 1000 [##REF##10627144##11##,##REF##12144171##16##]. Bacro and Comet [##REF##11459354##12##] showed that the asymptotic law of the <italic>Z-value </italic>(when <italic>η </italic>→ ∞) was independent of the length and composition of sequences. Bastien et al. [##REF##14990449##13##] further demonstrated that regardless of the distribution of the random variable <italic>S</italic>(<italic>a</italic>, <italic>B</italic>), the relation</p> <p></p> <p>is true. This relation, known as the TULIP theorem, shows that the <italic>Z</italic>-<italic>value </italic>computed for pairwise sequence alignments 1) provides an upper bound of alignment score probability [##REF##14990449##13##], 2) can be used to reconstruct molecular phylogenies [##REF##15757521##14##] and 3) is an accurate clustering criterion to reduce the diversity of protein sequence databases [##REF##15961444##17##]. Here we call <italic>T-value </italic>the upper bound deduced from the TULIP theorem, <italic>i.e. </italic>1/<italic>Z</italic>(<italic>a</italic>, <italic>b</italic>*)<sup>2</sup>.</p> <p>Simulations of <italic>Z</italic>-<italic>value </italic>distribution [##REF##10627144##11##,##REF##9514730##18##] shows that it fits a Gumbel distribution, suggesting that the distribution of alignment scores might follow a Gumbel distribution as well [##UREF##3##19##].</p> <p>The second and most popular method proposed by Karlin and Altschul [##REF##2315319##20##] is an estimate of the probability of an observed local ungapped alignment score according to an extreme value distribution (or EVD; for review: [##UREF##3##19##]), <italic>i.e. </italic>a Gumbel distribution, in the asymptotic limit of long sequences. The remarkable Karlin-Altschul formula is the consequence of interpreting the number of highest scoring matching regions above a threshold by a Poisson distribution. Briefly, considering <italic>A </italic>and <italic>B </italic>two random sequences, <italic>m </italic>and <italic>n </italic>their lengths, given the distribution of individual residues (<italic>i.e. </italic>amino acids), and given a scoring matrix, the number of distinct local alignments with score values of at least <italic>s </italic>is approximately Poisson distributed with mean</p> <p></p> <p>where <italic>λ </italic>and <italic>K </italic>can be calculated from the scoring matrix and average sequence compositions based on the Poisson distribution hypothesis. <italic>E</italic>(<italic>s</italic>) is known as the <italic>E-value</italic>. As a consequence, if <italic>s </italic>is the score obtained after aligning two real sequences <italic>a </italic>and <italic>b </italic>(with <italic>m </italic>and <italic>n </italic>their respective lengths), the probability of finding an ungapped segment pair with a score lower than or equal to <italic>s</italic>, follows a Gumbel distribution:</p> <p></p> <p>where <italic>S</italic>(<italic>A</italic>, <italic>B</italic>) is the random variable corresponding to the score of two random sequences. The <italic>P-value</italic>, defined as the probability of finding an ungapped segment pair with a score higher than <italic>s</italic>, is simply given by 1-<italic>P</italic>(S(<italic>A</italic>, <italic>B</italic>) ≤ <italic>s</italic>). Using the Taylor Expansion of equation (4), the <italic>P-value </italic>is approximated by the <italic>E-value </italic>when <italic>E</italic>(<italic>s</italic>) &lt; 0.01. The validity of the Karlin-Altschul model depends on restrictive conditions: firstly, the residue distributions in the compared sequences should not be "too dissimilar" and secondly, the sequence lengths (<italic>m </italic>an <italic>n</italic>) should "grow at roughly equal rates" [##REF##2315319##20##]. The length dependency of alignment scores has been discussed [##REF##2315319##20##,##REF##8289235##21##]. In particular, it has been demonstrated that the growth of the best matching score of gapped alignments was linear when gap penalties were small, becoming logarithmic when increasing sequence length and for larger gap penalties [##REF##8289235##21##]. Although the Karlin-Altschul formula given by equation (4) is not valid for gapped alignments and although no asymptotic score distribution has been analytically established for local alignments allowing gaps, simulations [##REF##10627144##11##,##REF##9514730##18##,##REF##11139604##22##,##REF##11751224##23##] showed that, for both local and global alignments, the Gumbel law was well-suited to the distribution of scores after pragmatic estimation of the <italic>λ </italic>and <italic>K </italic>parameters.</p> <p>Noticeably, this model relies on the fact that <italic>λ </italic>is the unique positive solution to the equation , for the 20 × 20 combinations of <italic>i </italic>and <italic>j </italic>amino acids, with <italic>ν</italic><sub><italic>a</italic></sub>(<italic>i</italic>) and <italic>ν</italic><sub><italic>b</italic></sub>(<italic>j</italic>) the probabilities of amino acids <italic>i </italic>and <italic>j </italic>in sequences <italic>a </italic>and <italic>b </italic>respectively and <italic>s</italic>(<italic>i</italic>, <italic>j</italic>) the score in the substitution matrix. From a theoretic point of view, and regardless of the practical performance of the Karlin and Altschul [##REF##2315319##20##] model, the fact that an observed distribution (the distribution of scores of real compared sequences) depends on a presupposed and pre-calculated parameter is not satisfactory. It would be more satisfactory if <italic>λ </italic>arose as a property of a biological process and/or features. We addressed therefore the question of the missing biological rationale to parameters, particularly <italic>λ </italic>and <italic>K</italic>, that proved to be valid in pragmatic terms.</p> <p>In this paper, we deduced biological rationale for the Gumbel-like distribution of sequence alignment scores and <italic>Z-values</italic>, based on a limited number of assumptions on sequences evolution. An ancestral sequence is the origin of a lineage of homologous sequences that are subjected to evolutionary mechanisms. We considered homologous sequences as entities sharing structural features, in particular some conserved or functionally similar amino acids detected by alignment methods. Features that are preserved in two homologous sequences are estimated by a shared amount of information (SAI). In this model, the amount of information shared between an initial sequence and the sequences in its lineage (<italic>i.e.</italic>, mutual information in Information Theory) is a decreasing function of time: over time, some substitutions of amino acids by others having redundant properties (SAI at the residue level) may be permitted without functional break down, but leads to a decrease of the SAI between the sequences. Classically, molecular evolution is formalized with Markovian models for residue substitutions, allowing the backward reconstruction of sequences' evolution with the assumption that the proteins have been selected for a functional conservation. Here, proteins were considered as systems, with a high level of structural redundancy, which components may "age" over evolution, and "die" in case of loss of the initial amount of information required to operate accurately for a given biological function. Assumptions are therefore generalist regarding the process of sequence evolution, should it be strictly Markovian or not, but they give a formalism to the reliability of the sequences reflecting the functional status of the folded and maturated protein, and being a criterion on which positive selection pressure might act. We introduced therefore principles of the <italic>reliability theory of aging and longevity </italic>[##REF##11742523##24##], that apply to a wide range of other systems, from artificial machines to biological population or organisms, applied here to molecular sequences. Based on the deduced model, we could provide biological basis for the <italic>Z-value </italic>Gumbel distribution, and significance for the corresponding Gumbel parameters (termed <italic>K' </italic>and <italic>λ'</italic>). Moreover, the assumption that the score between two sequences <italic>a </italic>and <italic>b </italic>should be the highest possible score between <italic>a </italic>and <italic>b </italic>is not necessary to observe an extreme values distribution for sequence alignment scores.</p> <p>Major points of the following demonstration are:</p> <p>i. The evolution of biological sequence is formalized by the evolution of the SAI between an initial sequence and sequences of its lineage. It is known that for two sequences <italic>a </italic>and <italic>b</italic>, this is measured by the mutual information I(<italic>a</italic>; <italic>b</italic>), based on Information Theory and is exactly the score s(<italic>a</italic>, <italic>b</italic>) computed with standard methods in sequences comparisons [##REF##15757521##14##].</p> <p>ii. If a sequence evolves, the probability that it stays near its "last" position in the sequence space is low and the longest the sequence, the lowest this probability (consequence of the concentration in a high dimensionality space [##UREF##4##25##]). The amount of information shared between an initial sequence and the sequences in its lineage decreases with time: as a consequence, one can indifferently use I(<italic>a</italic>; <italic>b</italic>) as a measure of the divergence time.</p>
<title>Methods</title> <p>Mathematical demonstrations are detailed in the Results section. Histograms and curves were built using the R package software (Statistics Department of the University of Auckland).</p>
<title>Results and discussion</title> <title>Assumptions for a model of sequences' evolution</title> <p>A basic process in the evolution of proteins is the change of amino acids over time. In the simplest view, these changes lead to amino acid substitutions, insertions or deletions. Dayhoff et al. [##UREF##2##6##] introduced the description of this process as a continuous-time Markov chain with a matrix of transition probabilities for the substitutions of any amino acid into another through time. This model allows forward and backward expressions of sequence evolution, under time homogeneity assumption, and is therefore an important tool for phylogeny reconstructions. Given a transition matrix and an equilibrium distribution of amino acids, then a matrix of amino acid substitution scores, in the sense of sequences' comparison, can be deduced [##REF##11382360##26##,##REF##11752185##27##].</p> <p>In the generalist model described here, assumptions regarding the process of sequence evolution were not formalized, should this process be strictly Markovian or not. Given two sequences, one can, one the one hand, compute a score using dynamic algorithms [##REF##2231712##3##,##REF##7265238##4##] and deduce the distribution of random scores from transition matrices under the hypothesis that the two sequences have evolved according to a continuous-time Markov chains process. On the other hand, Henikoff et al. [##REF##1438297##7##] demonstrated the possibility to calculate efficient log-odd matrices without the need of this assumption. Altschul [##REF##2051488##28##] and Bastien et al. [##REF##15757521##14##] demonstrated that log-odd matrices could be reformulated in the Information Theory framework. In particular, a score between two amino acids <italic>i </italic>and <italic>j </italic>can be interpreted as the mutual information between these two residues. At the 3D folded protein level, a molecular function emerges from the information encrypted in the amino acid sequence, and positive selection pressure acts therefore at the sequence level, maintaining a sufficient portion of the initial information, and consequently the functional status of the folded and maturated protein. We therefore focused on the evolution of the information shared between an initial sequence and the sequences of its lineage through time.</p> <title>Reliability theory and biological sequences evolution</title> <p>The Reliability Theory is a general theory about systems aging, in which the failure rate (the rate by which systems deteriorate) is related to the systems longevity (For review, [##REF##11742523##24##]). The system can be a machine with structured components, or a living entity or population. "Reliability" of a system (or of one of its components) refers to its ability to operate properly according to a standard [##UREF##5##29##]. The relation between the age of a system and its failure rate shows that aging is a direct consequence of redundancies within the system. For instance, when applied to a biological system in which redundant vital structures ensure a function, damage of a component that is compensated by another redundant intact one, does not lead to a complete impairment of the system. Defects do accumulate, resulting in redundancy exhaustion and giving rise to the phenomenon of aging. As the system (or one of its components) degenerates into a system with no redundancy, new defects can eventually lead to death. Reliability of the system (or component) is described by the "reliability function" <italic>R</italic>(<italic>x</italic>), also named "survival function", which is the probability that the system (or component) will carry out its mission through time <italic>x </italic>[##UREF##6##30##], expressed as the probability that the failure time <italic>X </italic>is beyond time <italic>x</italic>:</p> <p></p> <p>where <italic>F</italic>(<italic>x</italic>) = <italic>P</italic>(<italic>X </italic>≤ <italic>x</italic>) is a cumulative distribution function [##REF##11742523##24##] reflecting the resistance of the system to failures (at time <italic>x</italic>, distribution of the probability that the system could have failed previously). <italic>R</italic>(<italic>x</italic>) evaluates therefore the probability that the systems becomes completely defective after a time <italic>x </italic>(<italic>x </italic>can be a direct measure of time <italic>t </italic>or an increasing function of time).</p> <p>The "hazard rate"<italic>h</italic>(<italic>x</italic>), also called "failure rate", is defined as the relative rate for reliability function decline:</p> <p></p> <p>Hazard rate is equivalent to mortality force in demography [##UREF##7##31##,##REF##18202874##32##]. When <italic>h</italic>(<italic>x</italic>) is a constant <italic>h</italic>, the system does not deteriorate more often with age, and is therefore a <italic>non-aging </italic>system. In this case, a simple integration of equation (6) leads to</p> <p></p> <p>which is the exponential distribution that characterizes non-aging systems. Interestingly, a system with redundant <italic>non-aging components </italic>can be an <italic>aging system</italic>. That is to say the hazard rate of a system of components depends can depends of time whereas the hazard rate of components do not</p> <p>As discussed by Gavrilov and Gravrilova [##REF##11742523##24##], the "reliability theory" provided explanations for some fundamental problems regarding aging, longevity, death of organisms within populations. Organisms or populations are considered as systems in which categories of components (molecules, biological processes, cells, individuals, etc.) can be highly redundant, and be key elements for the system longevity.</p> <p>Here, we propose to consider the particular case of <italic>protein sequences as a system</italic>, in which redundancy is ensured:</p> <p>i. by the number of residue positions involved in the evolution process.</p> <p>ii. at the residue level by the existence of functionally redundant amino acids (<italic>e.g. </italic>after a DNA damage that leads to a genetic mutation, an aspartic acid may be substituted by a functionally redundant glutamic acid), <italic>i.e. </italic>the existence of a SAI for all amino acids pairs.</p> <p>In this model, evolutionary time is negatively correlated to the amount of information shared between an initial sequence and sequences in its lineage (SAI decreases with time, see below).</p> <title>The conservation rate: a mathematical tool to study the evolution of the information shared by biological sequences</title> <p>To measure the rate of conservation of a shared structure/function relationship at time <italic>x </italic>within a system of homologous proteins (<italic>i.e. </italic>the time of observation), we considered that the decay of information shared between an original sequence and sequences of its lineage was a function of time, and therefore a mean to measure time. Evolutionary time is therefore measured here in information units. We defined an <italic>information conservation rate </italic>Ψ as follows:</p> <title>Definition</title> <p>Given the cumulative distribution function <italic>F</italic>(<italic>x</italic>) = <italic>P</italic>(<italic>X </italic>≤ <italic>x</italic>) (Probability that the system shared less than <italic>x </italic>information units with a reference), supposed continuously differentiable, the <italic>conservation rate </italic>Ψ is given by:</p> <p></p> <p>The <italic>conservation rate </italic>is simply related to the hazard function, measuring a quantity that decreases over time (shared information) instead of a quantity that increases over time (age). Given <italic>f</italic>(<italic>x</italic>) = <italic>dF</italic>(<italic>x</italic>)/<italic>dx </italic>the density function of <italic>x</italic>, this conservation rate has the following properties.</p> <p></p> <p>and as corollaries:</p> <p></p> <p></p> <p></p> <title>Derivation of the distribution of sequence alignment scores based on the distribution of mutual information between amino acids</title> <p>Dobzhansky [##UREF##8##33##] and Wu et al. [##REF##4369316##34##] established that <italic>information </italic>harbored by a protein 1) emerged from the three-dimensional self organization of its residues (<italic>i.e. </italic>the sequence of amino acids) and had to do with information harbored by amino acids, and 2) was submitted through time to evolutionary pressure (achievement of a minimal functional level fitting environmental and species survival conditions). Using previous empirical results [##UREF##2##6##,##REF##1438297##7##,##REF##3221397##35##], Bastien et al. [##REF##15757521##14##] have shown that the alignment score of two homologous sequences <italic>a </italic>and <italic>b </italic>was proportional to the estimate of the SAI due to their common origin and parallel evolution under similar conservative pressure, <italic>i.e. </italic>the <italic>mutual information I</italic>(<italic>a</italic>; <italic>b</italic>) between the two events <italic>a </italic>and <italic>b </italic>in the sense of Hartley [##UREF##9##36##,##UREF##10##37##]:</p> <p></p> <p>with <italic>ξ </italic>a constant defining the unity (<italic>ξ </italic>= 1, in bits) and <italic>s</italic>(<italic>a</italic>, <italic>b</italic>) the sum of the elementary scores for all aligned positions (including gap opening and gap extension penalties). Mutual information between two events <italic>a </italic>and <italic>b </italic>(differing from the mutual information defined between random variables, see [##REF##15757521##14##,##UREF##11##38##]) measures the information gained by the knowledge of event <italic>a </italic>on the occurrence of event <italic>b</italic>. The mutual information being additive, <italic>I</italic>(<italic>a</italic>; <italic>b</italic>) is the sum of the mutual information of aligned residues, <italic>reflecting the magnitude of the redundancy between the sequences at the amino acid level</italic>. Mutual information between residues is therefore simply deduced from the 20 × 20 amino acid substitution matrix [##UREF##2##6##, ####REF##1438297##7##, ##REF##15948633##8####15948633##8##,##REF##3221397##35##] used to compute the alignment.</p> <p>Inside a given sequence, mutual information was also shown to <italic>reflect the dependency of close or remote amino acids</italic>, a phenomenon known as the residue co-evolution, due to their co-contribution to the sequence function [##REF##16254389##39##,##REF##16254390##40##].</p> <p>Considering a <italic>protein </italic>as a <italic>system</italic>, which <italic>components </italic>are <italic>amino acids</italic>, we examined the mutual information between the original components and their descendants, and how amino acid mutation affected the evolution of mutual information between proteins. We simply hypothesized that an amino acid may mutate over time following random DNA mutations and look at the behavior of the entire system, namely the protein which can be measured here by the mutual information between the initial residues and the new ones, <italic>i.e. </italic>the corresponding substitution scores in a 20 × 20 substitution matrix. The substitution matrix is considered as an estimate of the mutual information between residues because it was computed from real sequences' data [##UREF##2##6##, ####REF##1438297##7##, ##REF##15948633##8####15948633##8##,##REF##3221397##35##].</p> <p>Over time, an amino acid <italic>i </italic>is either conserved or substituted. The similarity of <italic>i </italic>in an initial sequence compared with residues at the same position in protein descendants is therefore either that of identity (the diagonal term in the scoring matrix) or a lower value(no score is higher than that of identity). In average, the magnitude of the similarity of <italic>i </italic>compared with its descendants, related to mutual information following equation (13), is therefore a decreasing function of elapsed time. On a functional point of view, the probability that <italic>i </italic>was mutated into a residue with a score <italic>S</italic><sub><italic>i </italic></sub>lower than a threshold <italic>s</italic><sub><italic>i </italic></sub>defined to allow the component to operate like <italic>i</italic>, can be deduced from the distribution of substitution scores. For most amino acids (F, P, W, Y, V, E, G, H, I, L, K, R, N, D and C), the distribution of scores deduced from BLOSUM 62 fits an exponential distribution (see the case of valine in Figure ##FIG##0##1A##. For five amino acids (M, S, T, A and Q), the distribution of scores does not fit an exponential distribution (see the case of Threonine in Figure ##FIG##0##1B##). Taking the average situation, the distribution of scores deduced from the BLOSUM 62 matrix is exponential-like (Figure ##FIG##0##1C##) supporting a general model for amino acids mutual information distribution: The probability <italic>P</italic><sub><italic>r </italic></sub>that a residue <italic>i </italic>is mutated into a residue with mutual information below <italic>s</italic><sub><italic>i </italic></sub>is:</p> <p></p> <p>where <italic>λ</italic><sub><italic>i </italic></sub>is the <italic>constant information hazard rate, or failure rate, for reliability function decline of the amino acid mutual information</italic>.</p> <p>Given a sequence <italic>a</italic>, what is the probability that any of its <italic>m </italic>residues (termed <italic>i</italic>) had previously mutated into the <italic>n </italic>residues (termed <italic>j</italic>) of a sequence <italic>b </italic>and leads to the observed mutual information between sequence <italic>a </italic>and sequence <italic>b</italic>? We can consider <italic>m </italic>≠ <italic>n </italic>due to insertion or deletion events. If <italic>m </italic>and <italic>n </italic>are large, we can state the following asymptotic approximations: <italic>S </italic>≈ <italic>m </italic>⟨<italic>S</italic><sub><italic>i</italic></sub>⟩, with  and <italic>s </italic>≈ <italic>m </italic>⟨<italic>s</italic><sub><italic>i</italic></sub>⟩, with  where <italic>s </italic>(respectively <italic>S</italic>) is the score between the sequence <italic>a </italic>(respectively <italic>A</italic>) and the sequence <italic>b </italic>(respectively <italic>B</italic>) (for discussion of these approximations, see [##UREF##12##41##]). In the asymptotic limit of long sequences, we can envisage different scenarios for the evolution of <italic>a </italic>into <italic>b</italic>:</p> <p>In a first step (Figure ##FIG##1##2##, step 1), the probability that one residue <italic>a</italic><sub>1 </sub>is mutated into a residue <italic>b</italic><sub>1 </sub>with mutual information below <italic>s</italic><sub><italic>i </italic></sub>is given:</p> <p></p> <p>Considering one possible evolutionary scenario, <italic>i.e. </italic>one alignment (Figure ##FIG##1##2##, step 2), residues are considered as independent and the probability is the product of elementary probabilities for each positions aligned in this scenario. For the alignment of the <italic>m </italic>amino acids of sequence <italic>a</italic>, we obtain the following probability:</p> <p></p> <p>Alternative scenarios are also possible (Figure ##FIG##1##2##, step 3). The final probability is therefore computed taking into account all possible evolutionary paths (all possible alignments, Figure ##FIG##1##2##, step 3) and using <italic>K'</italic>&lt;1 a correcting factor for edge effects, deletion and insertion points:</p> <p></p> <p>Considering the approximation of ⟨<italic>S</italic><sub><italic>i</italic></sub>⟩ and ⟨<italic>s</italic><sub><italic>i</italic></sub>⟩ respectively by <italic>S</italic>/<italic>m </italic>and <italic>s</italic>/<italic>m</italic>, we deduce the final formula:</p> <p></p> <p>The density function <italic>f</italic>(<italic>s</italic>) is therefore given by:</p> <p></p> <p>with  the density of the probability <italic>P</italic><sub><italic>r</italic></sub>(<italic>S </italic>≤ <italic>s</italic>) that a residue is mutated into another</p> <p>with mutual information below <italic>s</italic>. We can then deduce the <italic>homology longevity rate </italic>Ψ, defined earlier as a function of the pairwise alignment score:</p> <p></p> <p>Using the expression of <italic>P</italic><sub><italic>i</italic></sub>(<italic>S</italic><sub><italic>i </italic></sub>≤ <italic>s</italic><sub><italic>i</italic></sub>) given by Equation (14) implies that:</p> <p></p> <p>Asymptotically, the information conservation rate is therefore given by</p> <p></p> <p>Using equation (12), we deduce that the distribution of alignment scores should respect the general form of the Karlin-Altschul formula:</p> <p></p> <title>Applications and Conclusion</title> <p>We built a model of evolution of the information shared between an initial molecular sequence and the sequences of its lineage (<italic>i.e. </italic>homologous sequences). Sequences were considered as systems, which components are the amino acids that can independently be damaged by random DNA mutations. Residues harbor a functional redundancy reflected by the amino acid substitution scores.</p> <p>From these assumptions, we deduced that the pairwise sequence alignment score should follow a Gumbel distribution (equation (22)). The <italic>λ' </italic>parameter is the information hazard rate for the reliability of amino acids' mutual information: it depends 1) on the distribution of the amino acids and 2) on the distribution of amino acid similarities deduced from a substitution matrix. The <italic>K</italic>' parameter has a more complex meaning, because it depends on likelihood of an alignment of two sequences, with edge effects, gaps, length difference and repartition of the information (the local score) in the alignment. It reflects therefore internal structural constraints on the evolution of sequences.</p> <p>The Gumbel parameters for score alignments can be estimated by two kinds of simulations. First is by adjusting EVD to the simulated distribution of scores [##UREF##3##19##,##REF##11139604##22##]. In that case, it is simpler to express the Gumbel law as</p> <p></p> <p>with  and . The estimate of Gumbel parameters is achieved by determining <italic>β </italic>and <italic>θ</italic>, allowing an easy estimate of the <italic>λ' </italic>and <italic>K</italic>' parameters of equation (23). Second estimation of the Gumbel parameters is by computing the <italic>Z-value </italic>corresponding to the simulation of score distribution. Using the fact that for a Gumbel distribution, <italic>μ </italic>= <italic>θ </italic>+ <italic>γβ </italic>and , then the <italic>Z-value </italic>allows a computation of the <italic>β </italic>and <italic>θ </italic>constants.</p> <p>Simulations of <italic>Z</italic>-<italic>value </italic>distribution [##REF##10627144##11##,##REF##9514730##18##] showed that it fitted with a Gumbel law. Based on the Gumbel distribution of scores (equations (24) and (25)) and by an appropriate change of variable with equation (1), then the distribution of <italic>Z</italic>-<italic>values </italic>should respect the following equality:</p> <p></p> <p>with <italic>γ </italic>the Euler-Mascheroni constant (<italic>γ </italic>≈ 0.5772). Equation (25) is the precise expression of the distribution of <italic>Z-values </italic>deduced by Pearson [##REF##9514730##18##] from simulations. It is important to note that this expression of the <italic>Z-value </italic>distribution is independent of sequence lengths and amino acid distributions.</p> <p>This consideration has practical implications, since it allows a refined estimate of the <italic>P-value </italic>based on <italic>Z-value </italic>computation, and a real gain over available methods, particularly in some documented cases where the Karlin-Altschul formula failed to assess the significance of an alignment. Table ##TAB##0##1## shows for instance the different statistical estimates for the alignment of two homologous TFIIA gamma sequences from <italic>Plasmodium falciparum </italic>and <italic>Arabidopsis thaliana</italic>. The compositional bias in the proteome of <italic>Plasmodium falciparum</italic>, the malarial parasite, is known to limit the use of Karlin-Altschul statistics for pairwise comparisons with unbiased proteins such as those of <italic>Arabidopsis thaliana </italic>[##REF##15246528##42##]. The TFIIA gamma subunit sequence of <italic>Plasmodium </italic>could not be deduced from BLASTP-based homology searches [##REF##16042788##43##]. The Blastp apparent search failure was due to the overestimate of the <italic>P-value </italic>following the Karlin-Altschul formula (0.008, using unfiltered BLASTP, see Table ##TAB##0##1##). Alignment score <italic>Z-value</italic>, computed with either Blastp (P. Ortet, unpublished algorithm) or Smith-Waterman was above 10. The upper bound for the <italic>P-value </italic>based on the TULIP theorem, given by the formula <italic>T-value </italic>= 1/<italic>Z-value</italic><sup>2 </sup>[##REF##14990449##13##], was therefore below 10<sup>-2</sup>. Eventually, the <italic>P-value </italic>deduced from the <italic>Z-value </italic>Gumbel distribution was below 10<sup>-6 </sup>(see Table ##TAB##0##1##) indicating that, for both the Blastp and Smith-Waterman methods, the homology could be statistically assessed, even in the limit case of unbiased vs biased sequence comparisons. We noticed that the asymmetric DirAtPf100 matrix specified for <italic>Plasmodium </italic>vs. <italic>Arabidopsis </italic>comparisons that we developed earlier [##REF##15948633##8##] allowed an additional gain in estimating this missed homology.</p> <p>Besides a theoretical support for pragmatic observations, this report shows therefore that the alignment score Gumbel distribution is a particular and general evolutionary law for molecular sequences taken as dynamical systems. This model can be parameterized using the Karlin-Altschul or the <italic>Z-Value </italic>form. If Karlin-Altschul model parameters are well-estimated (using simulations for example), both forms are equivalent in practice as reported by Hulsen et al. [##REF##17038163##44##]. This model shows that an extreme value distribution of alignment scores can arise not only by considering high scoring segments pairs. Indeed, derivation of a Gumbel distribution from maximum independent random variables is a well-known technique [##UREF##3##19##] and the Karlin-Altschul theorem was first demonstrated, based on this consideration [##REF##2315319##20##]. We can now state that this distribution allows a different interpretation in the light of the Reliability Theory, reflecting the redundancy of information between sequences due to both the number of residues and the shared information between these residues. The model elaboration described here additionally provides a link between concepts of biological sequence analysis and the emerging field of systems biology, with a generalization of the aging concepts to all scales of the living world.</p>
<title>Results and discussion</title> <title>Assumptions for a model of sequences' evolution</title> <p>A basic process in the evolution of proteins is the change of amino acids over time. In the simplest view, these changes lead to amino acid substitutions, insertions or deletions. Dayhoff et al. [##UREF##2##6##] introduced the description of this process as a continuous-time Markov chain with a matrix of transition probabilities for the substitutions of any amino acid into another through time. This model allows forward and backward expressions of sequence evolution, under time homogeneity assumption, and is therefore an important tool for phylogeny reconstructions. Given a transition matrix and an equilibrium distribution of amino acids, then a matrix of amino acid substitution scores, in the sense of sequences' comparison, can be deduced [##REF##11382360##26##,##REF##11752185##27##].</p> <p>In the generalist model described here, assumptions regarding the process of sequence evolution were not formalized, should this process be strictly Markovian or not. Given two sequences, one can, one the one hand, compute a score using dynamic algorithms [##REF##2231712##3##,##REF##7265238##4##] and deduce the distribution of random scores from transition matrices under the hypothesis that the two sequences have evolved according to a continuous-time Markov chains process. On the other hand, Henikoff et al. [##REF##1438297##7##] demonstrated the possibility to calculate efficient log-odd matrices without the need of this assumption. Altschul [##REF##2051488##28##] and Bastien et al. [##REF##15757521##14##] demonstrated that log-odd matrices could be reformulated in the Information Theory framework. In particular, a score between two amino acids <italic>i </italic>and <italic>j </italic>can be interpreted as the mutual information between these two residues. At the 3D folded protein level, a molecular function emerges from the information encrypted in the amino acid sequence, and positive selection pressure acts therefore at the sequence level, maintaining a sufficient portion of the initial information, and consequently the functional status of the folded and maturated protein. We therefore focused on the evolution of the information shared between an initial sequence and the sequences of its lineage through time.</p> <title>Reliability theory and biological sequences evolution</title> <p>The Reliability Theory is a general theory about systems aging, in which the failure rate (the rate by which systems deteriorate) is related to the systems longevity (For review, [##REF##11742523##24##]). The system can be a machine with structured components, or a living entity or population. "Reliability" of a system (or of one of its components) refers to its ability to operate properly according to a standard [##UREF##5##29##]. The relation between the age of a system and its failure rate shows that aging is a direct consequence of redundancies within the system. For instance, when applied to a biological system in which redundant vital structures ensure a function, damage of a component that is compensated by another redundant intact one, does not lead to a complete impairment of the system. Defects do accumulate, resulting in redundancy exhaustion and giving rise to the phenomenon of aging. As the system (or one of its components) degenerates into a system with no redundancy, new defects can eventually lead to death. Reliability of the system (or component) is described by the "reliability function" <italic>R</italic>(<italic>x</italic>), also named "survival function", which is the probability that the system (or component) will carry out its mission through time <italic>x </italic>[##UREF##6##30##], expressed as the probability that the failure time <italic>X </italic>is beyond time <italic>x</italic>:</p> <p></p> <p>where <italic>F</italic>(<italic>x</italic>) = <italic>P</italic>(<italic>X </italic>≤ <italic>x</italic>) is a cumulative distribution function [##REF##11742523##24##] reflecting the resistance of the system to failures (at time <italic>x</italic>, distribution of the probability that the system could have failed previously). <italic>R</italic>(<italic>x</italic>) evaluates therefore the probability that the systems becomes completely defective after a time <italic>x </italic>(<italic>x </italic>can be a direct measure of time <italic>t </italic>or an increasing function of time).</p> <p>The "hazard rate"<italic>h</italic>(<italic>x</italic>), also called "failure rate", is defined as the relative rate for reliability function decline:</p> <p></p> <p>Hazard rate is equivalent to mortality force in demography [##UREF##7##31##,##REF##18202874##32##]. When <italic>h</italic>(<italic>x</italic>) is a constant <italic>h</italic>, the system does not deteriorate more often with age, and is therefore a <italic>non-aging </italic>system. In this case, a simple integration of equation (6) leads to</p> <p></p> <p>which is the exponential distribution that characterizes non-aging systems. Interestingly, a system with redundant <italic>non-aging components </italic>can be an <italic>aging system</italic>. That is to say the hazard rate of a system of components depends can depends of time whereas the hazard rate of components do not</p> <p>As discussed by Gavrilov and Gravrilova [##REF##11742523##24##], the "reliability theory" provided explanations for some fundamental problems regarding aging, longevity, death of organisms within populations. Organisms or populations are considered as systems in which categories of components (molecules, biological processes, cells, individuals, etc.) can be highly redundant, and be key elements for the system longevity.</p> <p>Here, we propose to consider the particular case of <italic>protein sequences as a system</italic>, in which redundancy is ensured:</p> <p>i. by the number of residue positions involved in the evolution process.</p> <p>ii. at the residue level by the existence of functionally redundant amino acids (<italic>e.g. </italic>after a DNA damage that leads to a genetic mutation, an aspartic acid may be substituted by a functionally redundant glutamic acid), <italic>i.e. </italic>the existence of a SAI for all amino acids pairs.</p> <p>In this model, evolutionary time is negatively correlated to the amount of information shared between an initial sequence and sequences in its lineage (SAI decreases with time, see below).</p> <title>The conservation rate: a mathematical tool to study the evolution of the information shared by biological sequences</title> <p>To measure the rate of conservation of a shared structure/function relationship at time <italic>x </italic>within a system of homologous proteins (<italic>i.e. </italic>the time of observation), we considered that the decay of information shared between an original sequence and sequences of its lineage was a function of time, and therefore a mean to measure time. Evolutionary time is therefore measured here in information units. We defined an <italic>information conservation rate </italic>Ψ as follows:</p> <title>Definition</title> <p>Given the cumulative distribution function <italic>F</italic>(<italic>x</italic>) = <italic>P</italic>(<italic>X </italic>≤ <italic>x</italic>) (Probability that the system shared less than <italic>x </italic>information units with a reference), supposed continuously differentiable, the <italic>conservation rate </italic>Ψ is given by:</p> <p></p> <p>The <italic>conservation rate </italic>is simply related to the hazard function, measuring a quantity that decreases over time (shared information) instead of a quantity that increases over time (age). Given <italic>f</italic>(<italic>x</italic>) = <italic>dF</italic>(<italic>x</italic>)/<italic>dx </italic>the density function of <italic>x</italic>, this conservation rate has the following properties.</p> <p></p> <p>and as corollaries:</p> <p></p> <p></p> <p></p> <title>Derivation of the distribution of sequence alignment scores based on the distribution of mutual information between amino acids</title> <p>Dobzhansky [##UREF##8##33##] and Wu et al. [##REF##4369316##34##] established that <italic>information </italic>harbored by a protein 1) emerged from the three-dimensional self organization of its residues (<italic>i.e. </italic>the sequence of amino acids) and had to do with information harbored by amino acids, and 2) was submitted through time to evolutionary pressure (achievement of a minimal functional level fitting environmental and species survival conditions). Using previous empirical results [##UREF##2##6##,##REF##1438297##7##,##REF##3221397##35##], Bastien et al. [##REF##15757521##14##] have shown that the alignment score of two homologous sequences <italic>a </italic>and <italic>b </italic>was proportional to the estimate of the SAI due to their common origin and parallel evolution under similar conservative pressure, <italic>i.e. </italic>the <italic>mutual information I</italic>(<italic>a</italic>; <italic>b</italic>) between the two events <italic>a </italic>and <italic>b </italic>in the sense of Hartley [##UREF##9##36##,##UREF##10##37##]:</p> <p></p> <p>with <italic>ξ </italic>a constant defining the unity (<italic>ξ </italic>= 1, in bits) and <italic>s</italic>(<italic>a</italic>, <italic>b</italic>) the sum of the elementary scores for all aligned positions (including gap opening and gap extension penalties). Mutual information between two events <italic>a </italic>and <italic>b </italic>(differing from the mutual information defined between random variables, see [##REF##15757521##14##,##UREF##11##38##]) measures the information gained by the knowledge of event <italic>a </italic>on the occurrence of event <italic>b</italic>. The mutual information being additive, <italic>I</italic>(<italic>a</italic>; <italic>b</italic>) is the sum of the mutual information of aligned residues, <italic>reflecting the magnitude of the redundancy between the sequences at the amino acid level</italic>. Mutual information between residues is therefore simply deduced from the 20 × 20 amino acid substitution matrix [##UREF##2##6##, ####REF##1438297##7##, ##REF##15948633##8####15948633##8##,##REF##3221397##35##] used to compute the alignment.</p> <p>Inside a given sequence, mutual information was also shown to <italic>reflect the dependency of close or remote amino acids</italic>, a phenomenon known as the residue co-evolution, due to their co-contribution to the sequence function [##REF##16254389##39##,##REF##16254390##40##].</p> <p>Considering a <italic>protein </italic>as a <italic>system</italic>, which <italic>components </italic>are <italic>amino acids</italic>, we examined the mutual information between the original components and their descendants, and how amino acid mutation affected the evolution of mutual information between proteins. We simply hypothesized that an amino acid may mutate over time following random DNA mutations and look at the behavior of the entire system, namely the protein which can be measured here by the mutual information between the initial residues and the new ones, <italic>i.e. </italic>the corresponding substitution scores in a 20 × 20 substitution matrix. The substitution matrix is considered as an estimate of the mutual information between residues because it was computed from real sequences' data [##UREF##2##6##, ####REF##1438297##7##, ##REF##15948633##8####15948633##8##,##REF##3221397##35##].</p> <p>Over time, an amino acid <italic>i </italic>is either conserved or substituted. The similarity of <italic>i </italic>in an initial sequence compared with residues at the same position in protein descendants is therefore either that of identity (the diagonal term in the scoring matrix) or a lower value(no score is higher than that of identity). In average, the magnitude of the similarity of <italic>i </italic>compared with its descendants, related to mutual information following equation (13), is therefore a decreasing function of elapsed time. On a functional point of view, the probability that <italic>i </italic>was mutated into a residue with a score <italic>S</italic><sub><italic>i </italic></sub>lower than a threshold <italic>s</italic><sub><italic>i </italic></sub>defined to allow the component to operate like <italic>i</italic>, can be deduced from the distribution of substitution scores. For most amino acids (F, P, W, Y, V, E, G, H, I, L, K, R, N, D and C), the distribution of scores deduced from BLOSUM 62 fits an exponential distribution (see the case of valine in Figure ##FIG##0##1A##. For five amino acids (M, S, T, A and Q), the distribution of scores does not fit an exponential distribution (see the case of Threonine in Figure ##FIG##0##1B##). Taking the average situation, the distribution of scores deduced from the BLOSUM 62 matrix is exponential-like (Figure ##FIG##0##1C##) supporting a general model for amino acids mutual information distribution: The probability <italic>P</italic><sub><italic>r </italic></sub>that a residue <italic>i </italic>is mutated into a residue with mutual information below <italic>s</italic><sub><italic>i </italic></sub>is:</p> <p></p> <p>where <italic>λ</italic><sub><italic>i </italic></sub>is the <italic>constant information hazard rate, or failure rate, for reliability function decline of the amino acid mutual information</italic>.</p> <p>Given a sequence <italic>a</italic>, what is the probability that any of its <italic>m </italic>residues (termed <italic>i</italic>) had previously mutated into the <italic>n </italic>residues (termed <italic>j</italic>) of a sequence <italic>b </italic>and leads to the observed mutual information between sequence <italic>a </italic>and sequence <italic>b</italic>? We can consider <italic>m </italic>≠ <italic>n </italic>due to insertion or deletion events. If <italic>m </italic>and <italic>n </italic>are large, we can state the following asymptotic approximations: <italic>S </italic>≈ <italic>m </italic>⟨<italic>S</italic><sub><italic>i</italic></sub>⟩, with  and <italic>s </italic>≈ <italic>m </italic>⟨<italic>s</italic><sub><italic>i</italic></sub>⟩, with  where <italic>s </italic>(respectively <italic>S</italic>) is the score between the sequence <italic>a </italic>(respectively <italic>A</italic>) and the sequence <italic>b </italic>(respectively <italic>B</italic>) (for discussion of these approximations, see [##UREF##12##41##]). In the asymptotic limit of long sequences, we can envisage different scenarios for the evolution of <italic>a </italic>into <italic>b</italic>:</p> <p>In a first step (Figure ##FIG##1##2##, step 1), the probability that one residue <italic>a</italic><sub>1 </sub>is mutated into a residue <italic>b</italic><sub>1 </sub>with mutual information below <italic>s</italic><sub><italic>i </italic></sub>is given:</p> <p></p> <p>Considering one possible evolutionary scenario, <italic>i.e. </italic>one alignment (Figure ##FIG##1##2##, step 2), residues are considered as independent and the probability is the product of elementary probabilities for each positions aligned in this scenario. For the alignment of the <italic>m </italic>amino acids of sequence <italic>a</italic>, we obtain the following probability:</p> <p></p> <p>Alternative scenarios are also possible (Figure ##FIG##1##2##, step 3). The final probability is therefore computed taking into account all possible evolutionary paths (all possible alignments, Figure ##FIG##1##2##, step 3) and using <italic>K'</italic>&lt;1 a correcting factor for edge effects, deletion and insertion points:</p> <p></p> <p>Considering the approximation of ⟨<italic>S</italic><sub><italic>i</italic></sub>⟩ and ⟨<italic>s</italic><sub><italic>i</italic></sub>⟩ respectively by <italic>S</italic>/<italic>m </italic>and <italic>s</italic>/<italic>m</italic>, we deduce the final formula:</p> <p></p> <p>The density function <italic>f</italic>(<italic>s</italic>) is therefore given by:</p> <p></p> <p>with  the density of the probability <italic>P</italic><sub><italic>r</italic></sub>(<italic>S </italic>≤ <italic>s</italic>) that a residue is mutated into another</p> <p>with mutual information below <italic>s</italic>. We can then deduce the <italic>homology longevity rate </italic>Ψ, defined earlier as a function of the pairwise alignment score:</p> <p></p> <p>Using the expression of <italic>P</italic><sub><italic>i</italic></sub>(<italic>S</italic><sub><italic>i </italic></sub>≤ <italic>s</italic><sub><italic>i</italic></sub>) given by Equation (14) implies that:</p> <p></p> <p>Asymptotically, the information conservation rate is therefore given by</p> <p></p> <p>Using equation (12), we deduce that the distribution of alignment scores should respect the general form of the Karlin-Altschul formula:</p> <p></p> <title>Applications and Conclusion</title> <p>We built a model of evolution of the information shared between an initial molecular sequence and the sequences of its lineage (<italic>i.e. </italic>homologous sequences). Sequences were considered as systems, which components are the amino acids that can independently be damaged by random DNA mutations. Residues harbor a functional redundancy reflected by the amino acid substitution scores.</p> <p>From these assumptions, we deduced that the pairwise sequence alignment score should follow a Gumbel distribution (equation (22)). The <italic>λ' </italic>parameter is the information hazard rate for the reliability of amino acids' mutual information: it depends 1) on the distribution of the amino acids and 2) on the distribution of amino acid similarities deduced from a substitution matrix. The <italic>K</italic>' parameter has a more complex meaning, because it depends on likelihood of an alignment of two sequences, with edge effects, gaps, length difference and repartition of the information (the local score) in the alignment. It reflects therefore internal structural constraints on the evolution of sequences.</p> <p>The Gumbel parameters for score alignments can be estimated by two kinds of simulations. First is by adjusting EVD to the simulated distribution of scores [##UREF##3##19##,##REF##11139604##22##]. In that case, it is simpler to express the Gumbel law as</p> <p></p> <p>with  and . The estimate of Gumbel parameters is achieved by determining <italic>β </italic>and <italic>θ</italic>, allowing an easy estimate of the <italic>λ' </italic>and <italic>K</italic>' parameters of equation (23). Second estimation of the Gumbel parameters is by computing the <italic>Z-value </italic>corresponding to the simulation of score distribution. Using the fact that for a Gumbel distribution, <italic>μ </italic>= <italic>θ </italic>+ <italic>γβ </italic>and , then the <italic>Z-value </italic>allows a computation of the <italic>β </italic>and <italic>θ </italic>constants.</p> <p>Simulations of <italic>Z</italic>-<italic>value </italic>distribution [##REF##10627144##11##,##REF##9514730##18##] showed that it fitted with a Gumbel law. Based on the Gumbel distribution of scores (equations (24) and (25)) and by an appropriate change of variable with equation (1), then the distribution of <italic>Z</italic>-<italic>values </italic>should respect the following equality:</p> <p></p> <p>with <italic>γ </italic>the Euler-Mascheroni constant (<italic>γ </italic>≈ 0.5772). Equation (25) is the precise expression of the distribution of <italic>Z-values </italic>deduced by Pearson [##REF##9514730##18##] from simulations. It is important to note that this expression of the <italic>Z-value </italic>distribution is independent of sequence lengths and amino acid distributions.</p> <p>This consideration has practical implications, since it allows a refined estimate of the <italic>P-value </italic>based on <italic>Z-value </italic>computation, and a real gain over available methods, particularly in some documented cases where the Karlin-Altschul formula failed to assess the significance of an alignment. Table ##TAB##0##1## shows for instance the different statistical estimates for the alignment of two homologous TFIIA gamma sequences from <italic>Plasmodium falciparum </italic>and <italic>Arabidopsis thaliana</italic>. The compositional bias in the proteome of <italic>Plasmodium falciparum</italic>, the malarial parasite, is known to limit the use of Karlin-Altschul statistics for pairwise comparisons with unbiased proteins such as those of <italic>Arabidopsis thaliana </italic>[##REF##15246528##42##]. The TFIIA gamma subunit sequence of <italic>Plasmodium </italic>could not be deduced from BLASTP-based homology searches [##REF##16042788##43##]. The Blastp apparent search failure was due to the overestimate of the <italic>P-value </italic>following the Karlin-Altschul formula (0.008, using unfiltered BLASTP, see Table ##TAB##0##1##). Alignment score <italic>Z-value</italic>, computed with either Blastp (P. Ortet, unpublished algorithm) or Smith-Waterman was above 10. The upper bound for the <italic>P-value </italic>based on the TULIP theorem, given by the formula <italic>T-value </italic>= 1/<italic>Z-value</italic><sup>2 </sup>[##REF##14990449##13##], was therefore below 10<sup>-2</sup>. Eventually, the <italic>P-value </italic>deduced from the <italic>Z-value </italic>Gumbel distribution was below 10<sup>-6 </sup>(see Table ##TAB##0##1##) indicating that, for both the Blastp and Smith-Waterman methods, the homology could be statistically assessed, even in the limit case of unbiased vs biased sequence comparisons. We noticed that the asymmetric DirAtPf100 matrix specified for <italic>Plasmodium </italic>vs. <italic>Arabidopsis </italic>comparisons that we developed earlier [##REF##15948633##8##] allowed an additional gain in estimating this missed homology.</p> <p>Besides a theoretical support for pragmatic observations, this report shows therefore that the alignment score Gumbel distribution is a particular and general evolutionary law for molecular sequences taken as dynamical systems. This model can be parameterized using the Karlin-Altschul or the <italic>Z-Value </italic>form. If Karlin-Altschul model parameters are well-estimated (using simulations for example), both forms are equivalent in practice as reported by Hulsen et al. [##REF##17038163##44##]. This model shows that an extreme value distribution of alignment scores can arise not only by considering high scoring segments pairs. Indeed, derivation of a Gumbel distribution from maximum independent random variables is a well-known technique [##UREF##3##19##] and the Karlin-Altschul theorem was first demonstrated, based on this consideration [##REF##2315319##20##]. We can now state that this distribution allows a different interpretation in the light of the Reliability Theory, reflecting the redundancy of information between sequences due to both the number of residues and the shared information between these residues. The model elaboration described here additionally provides a link between concepts of biological sequence analysis and the emerging field of systems biology, with a generalization of the aging concepts to all scales of the living world.</p>
<title>Applications and Conclusion</title> <p>We built a model of evolution of the information shared between an initial molecular sequence and the sequences of its lineage (<italic>i.e. </italic>homologous sequences). Sequences were considered as systems, which components are the amino acids that can independently be damaged by random DNA mutations. Residues harbor a functional redundancy reflected by the amino acid substitution scores.</p> <p>From these assumptions, we deduced that the pairwise sequence alignment score should follow a Gumbel distribution (equation (22)). The <italic>λ' </italic>parameter is the information hazard rate for the reliability of amino acids' mutual information: it depends 1) on the distribution of the amino acids and 2) on the distribution of amino acid similarities deduced from a substitution matrix. The <italic>K</italic>' parameter has a more complex meaning, because it depends on likelihood of an alignment of two sequences, with edge effects, gaps, length difference and repartition of the information (the local score) in the alignment. It reflects therefore internal structural constraints on the evolution of sequences.</p> <p>The Gumbel parameters for score alignments can be estimated by two kinds of simulations. First is by adjusting EVD to the simulated distribution of scores [##UREF##3##19##,##REF##11139604##22##]. In that case, it is simpler to express the Gumbel law as</p> <p></p> <p>with  and . The estimate of Gumbel parameters is achieved by determining <italic>β </italic>and <italic>θ</italic>, allowing an easy estimate of the <italic>λ' </italic>and <italic>K</italic>' parameters of equation (23). Second estimation of the Gumbel parameters is by computing the <italic>Z-value </italic>corresponding to the simulation of score distribution. Using the fact that for a Gumbel distribution, <italic>μ </italic>= <italic>θ </italic>+ <italic>γβ </italic>and , then the <italic>Z-value </italic>allows a computation of the <italic>β </italic>and <italic>θ </italic>constants.</p> <p>Simulations of <italic>Z</italic>-<italic>value </italic>distribution [##REF##10627144##11##,##REF##9514730##18##] showed that it fitted with a Gumbel law. Based on the Gumbel distribution of scores (equations (24) and (25)) and by an appropriate change of variable with equation (1), then the distribution of <italic>Z</italic>-<italic>values </italic>should respect the following equality:</p> <p></p> <p>with <italic>γ </italic>the Euler-Mascheroni constant (<italic>γ </italic>≈ 0.5772). Equation (25) is the precise expression of the distribution of <italic>Z-values </italic>deduced by Pearson [##REF##9514730##18##] from simulations. It is important to note that this expression of the <italic>Z-value </italic>distribution is independent of sequence lengths and amino acid distributions.</p> <p>This consideration has practical implications, since it allows a refined estimate of the <italic>P-value </italic>based on <italic>Z-value </italic>computation, and a real gain over available methods, particularly in some documented cases where the Karlin-Altschul formula failed to assess the significance of an alignment. Table ##TAB##0##1## shows for instance the different statistical estimates for the alignment of two homologous TFIIA gamma sequences from <italic>Plasmodium falciparum </italic>and <italic>Arabidopsis thaliana</italic>. The compositional bias in the proteome of <italic>Plasmodium falciparum</italic>, the malarial parasite, is known to limit the use of Karlin-Altschul statistics for pairwise comparisons with unbiased proteins such as those of <italic>Arabidopsis thaliana </italic>[##REF##15246528##42##]. The TFIIA gamma subunit sequence of <italic>Plasmodium </italic>could not be deduced from BLASTP-based homology searches [##REF##16042788##43##]. The Blastp apparent search failure was due to the overestimate of the <italic>P-value </italic>following the Karlin-Altschul formula (0.008, using unfiltered BLASTP, see Table ##TAB##0##1##). Alignment score <italic>Z-value</italic>, computed with either Blastp (P. Ortet, unpublished algorithm) or Smith-Waterman was above 10. The upper bound for the <italic>P-value </italic>based on the TULIP theorem, given by the formula <italic>T-value </italic>= 1/<italic>Z-value</italic><sup>2 </sup>[##REF##14990449##13##], was therefore below 10<sup>-2</sup>. Eventually, the <italic>P-value </italic>deduced from the <italic>Z-value </italic>Gumbel distribution was below 10<sup>-6 </sup>(see Table ##TAB##0##1##) indicating that, for both the Blastp and Smith-Waterman methods, the homology could be statistically assessed, even in the limit case of unbiased vs biased sequence comparisons. We noticed that the asymmetric DirAtPf100 matrix specified for <italic>Plasmodium </italic>vs. <italic>Arabidopsis </italic>comparisons that we developed earlier [##REF##15948633##8##] allowed an additional gain in estimating this missed homology.</p> <p>Besides a theoretical support for pragmatic observations, this report shows therefore that the alignment score Gumbel distribution is a particular and general evolutionary law for molecular sequences taken as dynamical systems. This model can be parameterized using the Karlin-Altschul or the <italic>Z-Value </italic>form. If Karlin-Altschul model parameters are well-estimated (using simulations for example), both forms are equivalent in practice as reported by Hulsen et al. [##REF##17038163##44##]. This model shows that an extreme value distribution of alignment scores can arise not only by considering high scoring segments pairs. Indeed, derivation of a Gumbel distribution from maximum independent random variables is a well-known technique [##UREF##3##19##] and the Karlin-Altschul theorem was first demonstrated, based on this consideration [##REF##2315319##20##]. We can now state that this distribution allows a different interpretation in the light of the Reliability Theory, reflecting the redundancy of information between sequences due to both the number of residues and the shared information between these residues. The model elaboration described here additionally provides a link between concepts of biological sequence analysis and the emerging field of systems biology, with a generalization of the aging concepts to all scales of the living world.</p>
<p>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/2.0"/>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p> <title>Background</title> <p>Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic data. Two statistical models have been proposed. In the asymptotic limit of long sequences, the Karlin-Altschul model is based on the computation of a <italic>P-value</italic>, assuming that the number of high scoring matching regions above a threshold is Poisson distributed. Alternatively, the Lipman-Pearson model is based on the computation of a <italic>Z-value </italic>from a random score distribution obtained by a Monte-Carlo simulation. <italic>Z-values </italic>allow the deduction of an upper bound of the <italic>P-value </italic>(1/<italic>Z-value</italic><sup>2</sup>) following the TULIP theorem. Simulations of <italic>Z</italic>-<italic>value </italic>distribution is known to fit with a Gumbel law. This remarkable property was not demonstrated and had no obvious biological support.</p> <title>Results</title> <p>We built a model of evolution of sequences based on aging, as meant in Reliability Theory, using the fact that the amount of information shared between an initial sequence and the sequences in its lineage (<italic>i.e.</italic>, mutual information in Information Theory) is a decreasing function of time. This quantity is simply measured by a sequence alignment score. In systems aging, the failure rate is related to the systems longevity. The system can be a machine with structured components, or a living entity or population. "Reliability" refers to the ability to operate properly according to a standard. Here, the "reliability" of a sequence refers to the ability to conserve a sufficient functional level at the folded and maturated protein level (positive selection pressure). Homologous sequences were considered as systems 1) having a high redundancy of information reflected by the magnitude of their alignment scores, 2) which components are the amino acids that can independently be damaged by random DNA mutations. From these assumptions, we deduced that information shared at each amino acid position evolved with a constant rate, corresponding to the information hazard rate, and that pairwise sequence alignment scores should follow a Gumbel distribution, which parameters could find some theoretical rationale. In particular, one parameter corresponds to the information hazard rate.</p> <title>Conclusion</title> <p>Extreme value distribution of alignment scores, assessed from high scoring segments pairs following the Karlin-Altschul model, can also be deduced from the Reliability Theory applied to molecular sequences. It reflects the redundancy of information between homologous sequences, under functional conservative pressure. This model also provides a link between concepts of biological sequence analysis and of systems biology.</p>
<title>Abbreviations</title> <p>SAI: shared amount of information; TULIP: theorem of the upper limit of a score probability; EVD: extreme values distribution</p> <title>Authors' contributions</title> <p>OB conceived the main theoretical model, designed and developed all demonstrations and drafted the manuscript. EM participated in the design of the study and helped to draft the manuscript. All authors read and approved the final manuscript.</p>
<title>Acknowledgements</title> <p>Authors whish to thank Philippe Ortet for computing facilities, particularly for the use of an unpublished implementation of the <italic>Z-value </italic>statistical model using Blastp. This work was made possible by the financial support of Agence Nationale de la Recherche (Plasmoexplore project ANR-06-CIS6-MDCA-14-01) and the French Ministry of Foreign Affairs (SAFE-ITC program).</p>
<fig position="float" id="F1"><label>Figure 1</label><caption><p><bold>Aging properties of amino acids</bold>. Protein sequences are considered as systems, which components are amino acids. Over time, either amino acids are conserved (similarity of a residue with its descendant is that of identity, diagonal term of a substitution matrix) or modified due to random DNA mutations. Similarity decreases therefore with time, since no similarity is higher than that of identity. When the similarity falls below a threshold that is necessary for the residue to operate according to a standard (functional conservation), the component is damaged. <bold>(A) Score distribution corresponding to valine substitution. </bold>In this case, the score distribution is exponential, suggesting that valine (V) is a non-aging component. Based on BLOSUM62, residues of this type are V, F, P, W, Y, E, G, H, I, L, K, R, N, D and C <bold>(B) Score distribution corresponding to threonine substitution. </bold>The score distribution shows a peak, indicating a probable accelerated process of aging (functional damage) when the residue is substituted by random mutation in some other amino acids. Based on BLOSUM62, residues of this type are T, S, M, A and Q. <bold>(C) Score distribution in the BLOSUM62 similarity matrix. </bold>The complete distribution in the BLOSUM62 matrix is exponential (0.287.exp(-0.287.(<italic>s</italic>+4))), supporting a general model of amino acids as nonaging components. The exponential law for positive scores is characterized by the same parameter (<italic>λ' </italic>= 0.287). The original residue is termed <italic>i</italic>; its descent is termed <italic>j</italic>.</p></caption></fig> <fig position="float" id="F2"><label>Figure 2</label><caption><p><bold>Computing of the probability that the amount of information shared by two sequences, <italic>S</italic>, is lower than a threshold <italic>s</italic></bold>. Given an initial sequence <italic>a</italic>, we can envisage different scenarios for its evolution into another sequence <italic>b</italic>. In a first step (<bold>Step 1</bold>), an elementary probability is computed by taking into account the evolution of just one residue (here <italic>a</italic><sub>1 </sub>into <italic>b</italic><sub>1</sub>). Considering one possible evolutionary scenario (<bold>Step 2</bold>), residues are considered as independent and the probability is the product of elementary probabilities for each positions aligned in this scenario, with approximations in the asymptotic limit of long sequences. The final probability (<bold>Step 3</bold>) is then estimated by taking into account all the possible evolutionary scenarios.</p></caption></fig>
<table-wrap position="float" id="T1"><label>Table 1</label><caption><p>Alignment statistics of the homologous Transcription initiation factor IIA (TFIIA) gamma chain sequences from <italic>Plasmodium falciparum </italic>and <italic>Arabidopsis thaliana</italic>.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Alignment method</td><td align="center">Blastp</td><td align="center" colspan="2">Smith-Waterman</td></tr></thead><tbody><tr><td align="left">Substitution matrix</td><td align="center">BLOSUM62</td><td align="center">BLOSUM62</td><td align="center">DirAtPf100</td></tr><tr><td colspan="4"><hr/></td></tr><tr><td align="left">Statistics</td><td/><td/><td/></tr><tr><td align="right"><italic>P-value </italic>(Karlin-Altschul)</td><td align="center">0.008</td><td align="center">NA</td><td align="center">NA</td></tr><tr><td align="right"><italic>Z-value </italic>(Pearson-Lipman)</td><td align="center">10</td><td align="center">11</td><td align="center">12</td></tr><tr><td align="right"><italic>T-value </italic>(TULIP theorem)</td><td align="center">0.01</td><td align="center">8.10<sup>-3</sup></td><td align="center">7.10<sup>-3</sup></td></tr><tr><td align="right"><italic>P-value </italic>(this work)</td><td align="center">1.5.10<sup>-6</sup></td><td align="center">3.7.10<sup>-7</sup></td><td align="center">1.10<sup>-7</sup></td></tr></tbody></table></table-wrap>
<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" name="1471-2105-9-332-i1" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>s</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>log</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mfrac><mml:mrow><mml:mi>ω</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>ν</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>ν</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" name="1471-2105-9-332-i2" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>μ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" name="1471-2105-9-332-i3" overflow="scroll"><mml:semantics><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM1"><label>(1)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" name="1471-2105-9-332-i4" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>Z</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mo>∗</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>s</mml:mi><mml:mo>−</mml:mo><mml:mover accent="true"><mml:mi>μ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:mrow><mml:mover accent="true"><mml:mi>σ</mml:mi><mml:mo>^</mml:mo></mml:mover></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM2"><label>(2)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" name="1471-2105-9-332-i5" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo><mml:mo>≤</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mi>Z</mml:mi><mml:msup><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mo>∗</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM3"><label>(3)</label><italic>E</italic>(<italic>s</italic>) ≈ <italic>K</italic>.<italic>m</italic>.<italic>n</italic>.exp(-<italic>λ</italic>.<italic>s</italic>)</disp-formula> <disp-formula id="bmcM4"><label>(4)</label><italic>P</italic>(<italic>S</italic>(<italic>A</italic>, <italic>B</italic>) ≤ <italic>s</italic>) ≈ exp(-<italic>K</italic>.<italic>m</italic>.<italic>n</italic>.exp(-<italic>λ</italic>.<italic>s</italic>))</disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6" name="1471-2105-9-332-i6" overflow="scroll"><mml:semantics><mml:mrow><mml:mstyle displaystyle="true"><mml:munder><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:munder><mml:mrow><mml:msub><mml:mi>ν</mml:mi><mml:mi>a</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>ν</mml:mi><mml:mi>b</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo>{</mml:mo><mml:mi>λ</mml:mi><mml:mo>.</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>}</mml:mo><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM5"><label>(5)</label><italic>R</italic>(<italic>x</italic>) = <italic>P</italic>(<italic>X </italic>&gt; <italic>x</italic>) = 1 - <italic>P</italic>(<italic>X </italic>≤ <italic>x</italic>) = 1 - <italic>F</italic>(<italic>x</italic>)</disp-formula> <disp-formula id="bmcM6"><label>(6)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M7" name="1471-2105-9-332-i7" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mo>−</mml:mo><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mo>−</mml:mo><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>log</mml:mi><mml:mo>⁡</mml:mo><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM7"><label>(7)</label><italic>R</italic>(<italic>x</italic>) = <italic>R</italic>(0)exp(-<italic>h</italic>.<italic>x</italic>)</disp-formula> <disp-formula id="bmcM8"><label>(8)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M8" name="1471-2105-9-332-i8" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>ψ</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mi>lim</mml:mi><mml:mo>⁡</mml:mo></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi><mml:mo>→</mml:mo><mml:mn>0</mml:mn></mml:mrow></mml:munder><mml:mfrac><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>−</mml:mo><mml:mi>d</mml:mi><mml:mi>x</mml:mi><mml:mo>&lt;</mml:mo><mml:mi>X</mml:mi><mml:mo>≤</mml:mo><mml:mi>x</mml:mi><mml:mo>/</mml:mo><mml:mi>X</mml:mi><mml:mo>≤</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM9"><label>(9)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M9" name="1471-2105-9-332-i9" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>ψ</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo>≤</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM10"><label>(10)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M10" name="1471-2105-9-332-i10" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>ψ</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>log</mml:mi><mml:mo>⁡</mml:mo><mml:mi>F</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM11"><label>(11)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M11" name="1471-2105-9-332-i11" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>X</mml:mi><mml:mo>≤</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mstyle displaystyle="true"><mml:mrow><mml:munderover><mml:mo>∫</mml:mo><mml:mi>x</mml:mi><mml:mrow><mml:mo>+</mml:mo><mml:mi>∞</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mi>ψ</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>d</mml:mi><mml:mi>u</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM12"><label>(12)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M12" name="1471-2105-9-332-i12" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>ψ</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mstyle displaystyle="true"><mml:mrow><mml:munderover><mml:mo>∫</mml:mo><mml:mi>x</mml:mi><mml:mrow><mml:mo>+</mml:mo><mml:mi>∞</mml:mi></mml:mrow></mml:munderover><mml:mrow><mml:mi>ψ</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>u</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>d</mml:mi><mml:mi>u</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM13"><label>(13)</label><italic>s</italic>(<italic>a</italic>, <italic>b</italic>) = <italic>ξ</italic>.<italic>I </italic>(<italic>a</italic>; <italic>b</italic>)</disp-formula> <disp-formula id="bmcM14"><label>(14)</label><italic>P</italic><sub><italic>r</italic></sub>(<italic>S</italic><sub><italic>i </italic></sub>≤ <italic>s</italic><sub><italic>i</italic></sub>) = 1-exp(-<italic>λ</italic><sub><italic>i</italic></sub>.<italic>s</italic><sub><italic>i</italic></sub>)</disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M13" name="1471-2105-9-332-i13" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>〈</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>〉</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mi>lim</mml:mi><mml:mo>⁡</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>→</mml:mo><mml:mi>∞</mml:mi></mml:mrow></mml:munder><mml:mfrac><mml:mi>S</mml:mi><mml:mi>m</mml:mi></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M14" name="1471-2105-9-332-i14" overflow="scroll"><mml:semantics><mml:mrow><mml:mo>〈</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>〉</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mrow><mml:mi>lim</mml:mi><mml:mo>⁡</mml:mo></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>→</mml:mo><mml:mo>+</mml:mo><mml:mi>∞</mml:mi></mml:mrow></mml:munder><mml:mfrac><mml:mi>s</mml:mi><mml:mi>m</mml:mi></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM15"><label>(15)</label><italic>P</italic><sub><italic>r</italic></sub>(<italic>S</italic><sub><italic>i </italic></sub>≤ <italic>s</italic><sub><italic>i</italic></sub>) = <italic>P</italic><sub><italic>r</italic></sub>(<italic>S</italic><sub><italic>i </italic></sub>≤ <italic>s</italic>(<italic>a</italic><sub>1</sub>,<italic>b</italic><sub>1</sub>)) ≈ <italic>P</italic><sub><italic>r</italic></sub>(⟨<italic>S</italic><sub><italic>i</italic></sub>⟩ ≤ ⟨<italic>s</italic><sub><italic>i</italic></sub>⟩)</disp-formula> <disp-formula id="bmcM16"><label>(16)</label><italic>P</italic><sub><italic>scenario</italic>1 </sub>(<italic>S </italic>≤ <italic>s</italic>) = (<italic>P</italic><sub><italic>r</italic></sub>(⟨<italic>S</italic><sub><italic>i</italic></sub>⟩ ≤ ⟨<italic>s</italic><sub><italic>i</italic></sub>⟩))<sup><italic>m</italic></sup></disp-formula> <disp-formula id="bmcM17"><label>(17)</label><italic>P</italic>(<italic>S </italic>≤ <italic>s</italic>) = (<italic>P</italic><sub><italic>r</italic></sub>(⟨<italic>S</italic><sub><italic>i</italic></sub>⟩ ≤ ⟨<italic>s</italic><sub><italic>i</italic></sub>⟩))<sup><italic>K</italic>'<italic>mn</italic></sup></disp-formula> <disp-formula id="bmcM18"><label>(18)</label><italic>P</italic>(<italic>S </italic>≤ <italic>s</italic>) = (<italic>P</italic><sub><italic>r</italic></sub>(<italic>S </italic>≤ <italic>s</italic>))<sup><italic>K</italic>'.<italic>m</italic>.<italic>n</italic></sup></disp-formula> <disp-formula id="bmcM19"><label>(19)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M15" name="1471-2105-9-332-i15" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mo>≤</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi><mml:mo>.</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mo>≤</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M16" name="1471-2105-9-332-i16" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>d</mml:mi><mml:msub><mml:mi>P</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>d</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM20"><label>(20)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M17" name="1471-2105-9-332-i17" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>ψ</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>f</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mo>≤</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi><mml:mo>.</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mo>≤</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mo>≤</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM21"><label>(21)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M18" name="1471-2105-9-332-i18" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>ψ</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi><mml:mo>.</mml:mo><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>.</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi><mml:mo>.</mml:mo><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>−</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula id="bmcM22"><label>(22)</label><italic>ψ</italic>(<italic>s</italic>) = <italic>K'</italic>.<italic>m</italic>.<italic>n</italic>.<italic>λ'</italic>.exp(-<italic>λ'</italic>.<italic>s</italic>)</disp-formula> <disp-formula id="bmcM23"><label>(23)</label><italic>P</italic>(<italic>S </italic>≤<italic> s</italic>) ≈ exp(<italic>K</italic>'.<italic>m</italic>.<italic>n</italic>.exp(-<italic>λ'</italic>.<italic>s</italic>))</disp-formula> <disp-formula id="bmcM24"><label>(24)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M19" name="1471-2105-9-332-i19" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>S</mml:mi><mml:mo>≤</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>≈</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mfrac><mml:mrow><mml:mi>s</mml:mi><mml:mo>−</mml:mo><mml:mi>θ</mml:mi></mml:mrow><mml:mi>β</mml:mi></mml:mfrac><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></disp-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M20" name="1471-2105-9-332-i20" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>β</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M21" name="1471-2105-9-332-i21" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>θ</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mfrac><mml:mi>log</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>λ</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:msup><mml:mi>K</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>.</mml:mo><mml:mi>m</mml:mi><mml:mo>.</mml:mo><mml:mi>n</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M22" name="1471-2105-9-332-i22" overflow="scroll"><mml:semantics><mml:mrow><mml:msup><mml:mi>σ</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mi>π</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mn>6</mml:mn></mml:mfrac><mml:msup><mml:mi>β</mml:mi><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula id="bmcM25"><label>(25)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M23" name="1471-2105-9-332-i23" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>Z</mml:mi><mml:mo>≤</mml:mo><mml:mi>z</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mo>.</mml:mo><mml:mi>exp</mml:mi><mml:mo>⁡</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mo>−</mml:mo><mml:mi>z</mml:mi><mml:mfrac><mml:mi>π</mml:mi><mml:mrow><mml:msqrt><mml:mn>6</mml:mn></mml:msqrt></mml:mrow></mml:mfrac><mml:mo>−</mml:mo><mml:mi>γ</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:semantics></mml:math></disp-formula>
<table-wrap-foot><p>TFIIA gamma sequences from <italic>Plasmodium </italic>(UniProtKB Q8I4S7_PLAF7) and <italic>Arabidopsis </italic>(UniProtKB T2AG_ARATH) were aligned with Blastp and Smith-Waterman methods. Statistics were computed following the Karlin-Altschul model (as implemented in the Blastp algorithm) or the Lipman-Pearson <italic>Z-value </italic>model. The upper bound for the <italic>P-value </italic>based on the TULIP theorem is given following the formula: <italic>T-value </italic>= 1/<italic>Z-value</italic><sup>2</sup>. The <italic>P-value </italic>deduced from the <italic>Z-value </italic>Gumbel distribution was computed following the model presented here. Substitution matrices were either BLOSUM62, or the asymmetric DirAtPf100 matrix specified for <italic>Plasmodium vs. Arabidopsis </italic>comparisons. NA: not applicable.</p></table-wrap-foot>
<graphic xlink:href="1471-2105-9-332-1"/> <graphic xlink:href="1471-2105-9-332-2"/>
[{"surname": ["Bastien", "Ortet", "Roy", "Marechal"], "given-names": ["O", "P", "S", "E"], "article-title": ["The configuration space of homologous proteins: A theoretical and practical framework to reduce the diversity of the protein sequence space after massive all-by-all sequence comparisons"], "source": ["Fut Gen Comput Syst"], "year": ["2007"], "volume": ["23"], "fpage": ["410"], "lpage": ["427"], "pub-id": ["10.1016/j.future.2006.07.016"]}, {"surname": ["Setubal", "Meidanis"], "given-names": ["J", "J"], "source": ["Introduction to Computational Molecular Biology"], "year": ["1997"], "publisher-name": ["Boston : Pws Publishing Company"]}, {"surname": ["Dayhoff", "Schwartz", "Orcutt"], "given-names": ["MO", "RM", "BC"], "article-title": ["A Model of Evolutionary Change in Proteins"], "source": ["Atlas Prot Seq Struct"], "year": ["1978"], "volume": ["5"], "fpage": ["345"], "lpage": ["352"]}, {"surname": ["Coles"], "given-names": ["S"], "source": ["An introduction to Statistical Modeling of Extreme Values"], "year": ["2001"], "publisher-name": ["New York: Springer-Verlag"]}, {"surname": ["Lespinats"], "given-names": ["S"], "article-title": ["Style du genome explore par analyse textuelle de l'ADN"], "source": ["PhD thesis"], "year": ["2006"], "publisher-name": ["Paris VI University, Department of Epidemiology and Health Informatics"]}, {"surname": ["Crowder", "Kimber", "Smith", "Sweeting"], "given-names": ["MJ", "AC", "RL", "TJ"], "source": ["Statistical analysis of reliability data"], "year": ["1991"], "publisher-name": ["London: Chapman and Hall"]}, {"surname": ["Rigdon", "Basu"], "given-names": ["SE", "AP"], "source": ["Statistical methods for the reliability of repairable systems"], "year": ["2000"], "publisher-name": ["New-York: Wiley and Son"]}, {"surname": ["Valleron"], "given-names": ["AJ"], "source": ["Introduction \u00e0 la Biostatistique"], "year": ["1998"], "publisher-name": ["Paris: Masson"]}, {"surname": ["Dobzhansky"], "given-names": ["T"], "source": ["Studies in the Philosophy of Biology: Reduction and Related Problems"], "year": ["1974"], "publisher-name": ["Los Angeles: University of California Press"]}, {"surname": ["Hartley"], "given-names": ["RVL"], "article-title": ["Transmission of Information"], "source": ["Bell System Technical Journal"], "year": ["1928"], "volume": ["3"], "fpage": ["535"], "lpage": ["564"]}, {"surname": ["Shannon"], "given-names": ["CE"], "article-title": ["A Mathematical Theory of Communication"], "source": ["Bell System Technical Journal"], "year": ["1948"], "volume": ["27"], "fpage": ["379"], "lpage": ["423"], "comment": ["623\u2013656."]}, {"surname": ["Cover", "Thomas"], "given-names": ["TM", "JA"], "source": ["Elements of Information Theory"], "year": ["1991"], "publisher-name": ["New-York: Wiley and Son"]}, {"surname": ["Waterman"], "given-names": ["MS"], "source": ["Introduction to computational biology"], "year": ["1995"], "publisher-name": ["London: Chapman and Hall"]}]
BMC Bioinformatics. 2008 Aug 7; 9:332