Long distance runners competing in events ranging from 15 to 88 km showed a distance related acute phase response as indicated by significantly raised serum C reactive protein concentrations. In trained athletes only a small rise in C reactive protein concentrations was seen after races of less than 21 km. After an 88 km ultramarathon concentrations comparable to those found in patients with sm...

let $g=(v,e)$ be a connected graph. the eccentric connectivity index of $g$, $xi^{c}(g)$, is defined as $xi^{c}(g)=sum_{vin v(g)}deg(v)ec(v)$, where $deg(v)$ is the degree of a vertex $v$ and $ec(v)$ is its eccentricity. the eccentric distance sum of $g$ is defined as $xi^{d}(g)=sum_{vin v(g)}ec(v)d(v)$, where $d(v)=sum_{uin v(g)}d_{g}(u,v)$ and $d_{g}(u,v)$ is the distance between $u$ and $v$ ...

Supplementary Figure 1. Alternative analysis of cluster centroid juxtaposition with MEGA2 software. A: UPGMA tree based on Euclidean distance between cluster centroids; B: Neighbor-joining tree based on inter-centroid distance matrix; C: UPGMA tree based on average Euclidean distance between cluster elements; D: Neighbor-joining tree based on average Euclidean distance between cluster elements....

Steel composites reinforced with alumina nanoparticles were prepared by powder metallurgy process. Samples containing two different amounts of carbon (0.35 and 0.55 wt.%) and 0-5 wt.% Al2O3 nanoparticles were fabricated by mixing, compacting and sintering of diffusion bonded Distaloy AE powder. The density, hardness and wear tests were performed on the prepared samples. Fu...

The clustering coefficient C of a network, which is a measure of direct connectivity between neighbors of the various nodes, ranges from 0 (for no connectivity) to 1 (for full connectivity). We define extended clustering coefficients C(h) of a small-world network based on nodes that are at distance h from a source node, thus generalizing distance-1 neighborhoods employed in computing the ordina...

A code C F n is s-regular provided, for every vertex x 2 F n , if x is at distance at most s from C then the number of codewords y 2 C at distance i from x depends only on i and the distance from x to C. If denotes the covering radius of C and C is-regular, then C is said to be completely regular. Suppose C is a code with minimum distance d, strength t as an orthogonal array, and dual degree s....

Summary We present Edlib, an open-source C/C ++ library for exact pairwise sequence alignment using edit distance. We compare Edlib to other libraries and show that it is the fastest while not lacking in functionality and can also easily handle very large sequences. Being easy to use, flexible, fast and low on memory usage, we expect it to be easily adopted as a building block for future bioinf...