NMR study of the oil build-up in sunflower seeds

THE use of NMR to investigate the quality of the oil as a function of maturity of the seeds is demonstrated for sunflower seeds. The percentages of the saturated and individual unsaturated aids are determined as a function of time after flowering of the seeds. The percentage of saturated fatty acids is found to decrease with maturity of seeds whereas the extent of the unsaturated acids increases.

Spatial distribution of oil in groundnut and sunflower seeds by nuclear magnetic resonance imaging

The nuclear magnetic resonance imaging technique has been used to obtain images of different transverse and vertical sections in groundnut and sunflower seeds. Separate images have been obtained for oil and water components in the seeds. The spatial distribution of oil and water inside the seed has been obtained from the detailed analysis of the images. In the immature groundnut seeds obtained commercially, complementary oil and water distributions have been observed. Attempts have been made to explain these results.

Development of a probe-based blotting technique for the detection of Tobacco streak virus

Digoxigenin (DIG)-labeled DNA probe was developed for a sensitive and rapid detection of the Tobacco streak virus (TSV) isolates in India by dot-blot and tissue print hybridization techniques. DIG-labeled DNA probe complementary to the coat protein (CP) region of TSV sunflower isolate was designed and used to detect the TSV presence at field levels. Dot-blot hybridization was used to check a large number of TSV isolates with a single probe. In addition, a sensitivity of the technique was examined with the different sample extraction methods. Another technique, the tissue blot hybridization offered a simple, reliable procedure and did not require a sample processing. Thus, both non-radioactively labeled probe techniques could facilitate the sample screening during TSV outbreaks and offer an advantage in quarantine services.

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.