The gene of NAD`-dependent formate dehydrogenase (FDH) from Mycobacterium vaccae N10 was cloned into Escherichia coli by hybridization with digoxigenin-labeled DNA probes, which were prepared by amplification of the chromosomal DNA from the bacterium by the polymerase chain reaction with degenerate primers. The primers were designed on the basis of the most conserved parts of known sequences of...

The isolation of N10 formylfolic acid' from natural materials has been reported by several groups of workers (Rauen et al., 1952; Rauen and Jaenicke, 1953; Greenberg, 1954a; Silverman et al., 1954). It was concluded that the compound had been derived either from the degradation of a labile intermediate involved in the conversion of a bound (microbiologically inactive) form of folic acid in live...

A cross-sectional study of adolescent growth was undertaken among the Brahmin girls residing in rural and urban areas of Sagar districts, Madhya Pradesh to evaluate the urban-rural differences. Six anthropometric measurements, such as weight, stature, sitting height, head circumference, upper arm circumference and chest girth are taken into consideration. Though the urban girls show consistentl...

In the present study 22 rural athletes of four different states of India have been studied for 23 anthropometric parameters--weight, height, sitting height, six diameters, six circumferences and eight skin and subcutaneous tissue folds. Rural athletes of Punjab and Haryana have been found to be comparable pertaining to all the anthropometric variables. Athletes of Madhya Pradesh show minimum va...

We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an nO(log(n)) upper bound on the Ramsey number of a path wit...

The first polynomial-time algorithm to approximate (with arbitrary precision) the permanent of a non-negative matrix was presented by Jerrum, Sinclair and Vigoda. They designed a simulated annealing algorithm with a running time of O∗(n26) for 0/1 matrices. Subsequently, they improved their analysis, resulting in a O∗(n10) time algorithm. We present a O∗(n7) time algorithm. Our improvement come...