Sentence examples for minimum possible sum from inspiring English sources

As mentioned before, in phylogenetic trees, S v (i) denotes the minimum possible sum of substitution costs along all the edges from the vertex v to all the leaves that are reachable from v, given that v is assigned state i and all the vertices reachable from v are each assigned a state.

Then the cost S r (i) denotes the minimum possible sum of substitution costs along all the edges of a traversal tree with one of states assigned for reticulate vertices, plus the sum of the substitution costs along the remaining reticulate edges with the alternate assignment state at the reticulate vertices.

These values represent the minimum and maximum possible summed values for each subscale.

Besides, we assume that n ζ 0 < C n < n ζ p ¯, which means that the sum complexity constraint is less than the worst-case sum complexity n ζ p ¯ while larger than n ζ 0 that is the minimum possible value of the sum complexity of ET-FSD with n users.

An overall score was calculated and transformed into a 0 100 scale using the formula: 100 × [ observed score sum – minimum possible score)/(maximum possible score – minimum possible score)].

That sum was divided by the difference between the maximum total value and the sum of the minimum possible values for each subscale or domain.

In the Parsimony approach, for any given topology the sum of the minimum possible substitutions over all sites is known as the tree length for that topology.

To do this, we totaled the responses, and the resulting figure was subtracted from the sum of the minimum possible values for each subscale or domain.

Scores for the ten items were then summed, yielding a minimum possible score of 10 and a maximum possible score of 50.

Using evolutionary programming (EP), monopulse Cassegrain antennas with four feeds can be designed for the desired sum gain, side lobe level and minimum possible antenna size.

The total MSWS-12 score ranges between 0 100 and is computed by summing the individual item scores, subtracting the minimum possible score (12), dividing by the maximal score (48), and then multiplying the result by 100 [ 6].