Changes in the Activities of two membrane-bound enzymes during solar eclipse on February 16, 1980

ON Saturday February 16, 1980 total solar eclipse Occurred for a period of 2-3 min in a belt of 135 km during the eclipse from 14'17 to 17'00 hrs across peninsular India. The city of Bangalore, being just outside this belt, had witnessed 92% eclipse for about 2. 1/2 min at the peak period of 15.44 hr at which time a temperature drop of 2' C and a considerable dimness of the light were experienced. In view of the interest in our laboratory on biochemical adaptation under conditions of environmental stress, we designed an experiment to study the possible changes in enzyme activities during the solar eclipse on February 16, 1980.

Structures of mannose-6-phosphate isomerase from Salmonella typhimurium bound to metal atoms and substrate: implications for catalytic mechanism

Mannose-6-phosphate isomerase (MPI) catalyzes the inter-conversion of mannose 6-phosphate and fructose 6-phosphate. X-ray crystal structures of MPI from Salmonella typhimurium in the apo form (with no metal bound) and in the holo form (with bound Zn2+) and two other structures with yttrium bound at an inhibitory site and complexed with Zn2+ and fructose 6-phosphate (F6P) were determined in order to gain insights into the structure and the isomerization mechanism. Isomerization involves acid/base catalysis with proton transfer between the C1 and C2 atoms of the substrate. His99, Lys132, His131 and Asp270 are close to the substrate and are likely to be the residues involved in proton transfer. The interactions observed at the active site suggest that the ring-opening step is probably catalyzed by His99 and Asp270. An active-site loop consisting of residues 130-133 undergoes conformational changes upon substrate binding. Zn2+ binding induces structural order in the loop consisting of residues 50-54. The metal atom appears to play a role in substrate binding and is probably also important for maintaining the architecture of the active site. Isomerization probably follows the previously suggested cis-enediol mechanism.

Purification of Antibodies Specific to a Dinucleotide Using the Hapten Bound to Deae Cellulose as an Affinity Column

The dinucleotide dpTpA held electrostatically on DEAE cellulose was used as an affinity column for the purification of dpTpA specific antibodies. Chromatography of the y-globulin fraction from dpTpA specific antisera on this column resulted in the retention of dpTpA specific antibodies which were later eluted along with the bound dpTpA using 1M NaC1. Dextran coated charcoal was the method of choice for the dissociation and removal of dpTpA bound to the antibodies. This method may extend itself to the purification of antibodies specific for other oligonucleotides.

An investigation of bond formation in the weakly bound first excited 1Σ and lowest 3Σ states of HeH+

The role of the electronic kinetic energy and its Cartesian components is examined during the formation of the first excited 1�£ and the lowest 3�£ states of HeH+ employing wavefunctions of multi-configuration type with basis orbitals in elliptic coordinates. Results show that the bond formation in these states is preceded primarily by a charge transfer from H to He+ rather than by polarisation of the H-orbital by He+

Improvement On Brooks Chromatic Bound For A Class Of Graphs

Brooks' Theorem says that if for a graph G,Δ(G)=n, then G is n-colourable, unless (1) n=2 and G has an odd cycle as a component, or (2) n>2 and Kn+1 is a component of G. In this paper we prove that if a graph G has none of some three graphs (K1,3;K5−e and H) as an induced subgraph and if Δ(G)greater-or-equal, slanted6 and d(G)<Δ(G), then χ(G)<Δ(G). Also we give examples to show that the hypothesis Δ(G)greater-or-equal, slanted6 can not be non-trivially relaxed and the graph K5−e can not be removed from the hypothesis. Moreover, for a graph G with none of K1,3;K5−e and H as an induced subgraph, we verify Borodin and Kostochka's conjecture that if for a graph G,Δ(G)greater-or-equal, slanted9 and d(G)<Δ(G), then χ(G)<Δ(G).

A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.

Optimal irrigation planning in river basin development: The case of the Upper Cauvery river basin

The study deals with the irrigation planning of the Cauvery river basin in peninsular India which is extensively developed in the downstream reaches and has a high potential for development in the upper reaches. A four-reservoir system is modelled on a monthly basis by using a mathematical programming (LP) formulation to find optimum cropping patterns, subject to land, water and downstream release constraints, and applied to the Cauvery basin. Two objectives, maximizing net economic benefits and maximizing irrigated cropped area, considered in the model are analysed in the context of multiobjective planning and the trade-offs discussed.