The Design and Construction of Synthetic Protein Mimics

A strategy for the modular construction of synthetic protein mimics based on the ability non-protein amino acids to act as stereochemical directors of polypeptide chain folding, is described. The use of alpha-aminoisobutyric acid (Aib) to construct stereochemically rigid helices has been exemplified by crystallographic and spectroscopic studies of several apolar peptides, ranging in length from seven to sixteen residues. The problem of linker design in elaborating alpha,alpha motifs has been considered. Analysis of protein crystal structure data provides a guide to choosing linking sequences. Attempts at constructing linked helical motifs using linking Gly-Pro segments have been described. The use of flexible linkers, like epsilon-aminocaproic acid has been examined and the crystallographic and solution state analysis of a linked helix motif has been presented. The use of bulky sidechain modifications on a helical scaffold, as a means of generating putative binding sites has been exemplified by a crystal structure of a peptide packed in a parallel zipper arrangement.

A facile regioselective construction of spiro epoxy-bridged tetrahydropyranone frameworks

Investigations on the reactivity profile of the transient five-membered-ring cyclic carbonyl ylides, generated from alpha-diazo ketones, in the presence of the C=O group of various simple ketones and symrnetrical/unsymmetrical 1,2-diones were carried out. The reaction of alpha-diazo ketones with 1,2-naphthoquinone furnished interesting diastereomeric cycloadducts in which both the C=O groups acted as dipolarophilic sites. The similar reaction in the presence of several isatin derivatives afforded novel spiro dioxa-bridged indole derivatives as a mixture of diastereomers. The single crystal X-ray structure analysis manifestly revealed the mode of cycloaddition and the stereochemistry of two of the diastereomers. A diverse set of novel spiro epoxy-bridged tetrahydropyranone frameworks have been constructed in good yield via the tandem cyclization-cycloaddition of alpha-diazo ketones with the C=O group as heterodipolarophile in a regioselective manner. (C) 2003 Elsevier Ltd. All rights reserved.

On Reducing Dynamic Web Page Construction Times

Many web sites incorporate dynamic web pages to deliver customized contents to their users. However, dynamic pages result in increased user response times due to their construction overheads. In this paper, we consider mechanisms for reducing these overheads by utilizing the excess capacity with which web servers are typically provisioned. Specifically, we present a caching technique that integrates fragment caching with anticipatory page pre-generation in order to deliver dynamic pages faster during normal operating situations. A feedback mechanism is used to tune the page pre-generation process to match the current system load. The experimental results from a detailed simulation study of our technique indicate that, given a fixed cache budget, page construction speedups of more than fifty percent can be consistently achieved as compared to a pure fragment caching approach.

Steam-cured stabilised soil blocks for masonry construction

Energy-efficient, economical and durable building materials are essential for sustainable construction practices. The paper deals with production and properties of energy-efficient steam-cured stabilised soil blocks used fbr masonry construction. Problems of mixing expansive soil and lime, and production of blocks using soil-lime mixtures have been discussed briefly. Details of steam curing of stabilised soil blocks and properties of such blocks are given. A comparison of energy content of steam-cured soil blocks and burnt bricks is presented. It has been shown that energy-efficient steam cured soil blocks (consuming 35% less thermal energy compared to burnt clay bricks) having high compressive strength can be easily produced in a decentralised manner.

PocketMatch: A new algorithm to compare binding sites in protein structures

Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. Results: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. A comparison with other site matching algorithms is also presented. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless combined with chemical nature of amino acids. Conclusion: A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along with the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250(th) second for one comparison on a single processor. A parallel version on BlueGene has also been implemented.

Efficient Output-Sensitive Construction of Reeb Graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. This paper describes a near-optimal two-step algorithm that constructs the Reeb graph of a Morse function defined over manifolds in any dimension. The algorithm first identifies the critical points of the input manifold, and then connects these critical points in the second step to obtain the Reeb graph. A simplification mechanism based on topological persistence aids in the removal of noise and unimportant features. A radial layout scheme results in a feature-directed drawing of the Reeb graph. Experimental results demonstrate the efficiency of the Reeb graph construction in practice and its applications.

Perception of ultraviolet light by crab spiders and its role in selection of hunting sites

The perception of ultraviolet (UV) light by spiders has so far been only demonstrated in salticids. Crab spiders (Thomisidae) hunt mostly on flowers and need to find appropriate hunting sites. Previous studies have shown that some crab spiders that reflect UV light use UV contrast to enhance prey capture. The high UV contrast can be obtained either by modulation of body colouration or active selection of appropriate backgrounds for foraging. We show that crab spiders (Thomisus sp.)hunting on Spathiphyllum plants use chromatic contrast, especially UV contrast, to make themselves attractive to hymenopteran prey. Apart from that, they are able to achieve high UV contrast by active selection of non-UV reflecting surfaces when given a choice of UV-reflecting and non-UV reflecting surfaces in the absence of odour cues. Honeybees (Apis cerana) approached Spathiphyllum plants bearing crab spiders on which the spiders were high UV-contrast targets with greater frequency than those plants on which the UV-contrast of the spiders was low. Thus, crab spiders can perceive UV and may use it to choose appropriate backgrounds to enhance prey capture, by exploiting the attraction of prey such as honeybees to UV.

Cholinergic Muscarinic Receptors in Human Fetal Brain: Ontogeny of [3H]Quinuclidinyl Benzilate Binding Sites in Corpus Striatum, Brainstem, and Cerebellum

The ontogeny of muscarinic receptors was studied in human fetal striatum, brainstem, and cerebellum to investigate general principles of synaptogenesis as well as the physiological balance between various chemical synapses during development in a given region of the brain. [3H]Quinuclidinyl benzilate ([-'H]QNB) binding was assayed in total particulate fraction (TPF) from various parts of brain. In the corpus striatum, QNB binding sites are present at 16 weeks of gestation (average concentration 180 fmol/mg protein of TPF), slowly increase up to 24 weeks (average concentration 217 fmol/mg protein), and rapidly increase during the third trimester to 480 fmol/mg protein of TPF. In contrast, dopaminergic receptors exist as two subpopulations. one with low affinity and the other with high affinity up to the 24th week of gestation; all of them acquire the highaffinity characteristic during the third trimester. In brainstem, the muscarinic receptors show maximum concentration by 16 weeks of age (360 fmolimg protein of TPF). Subsequently the muscarinic receptor concentration shows a gradual decline in the brainstem. In cerebellum, except for a slight increase at 24 weeks (average concentration 90 fmol/mg protein of TPF), the receptor concentration remained nearly constant at about 60-70 fmolimg protein of TPF throughout fetal life. This study demonstrates that the ontogeny of muscarinic receptors varies among the different regions, and the patterns observed suggest that receptor formation occurs principally in the third trimester. Also noteworthy is the finding that the QNB binding sites decreased in all regions of the human brain during adult life. Key Words: Cholinergic muscarinic receptors-Quinuclidinyl benzilate-Corpus striaturn-Brainstem-Cerebellum. Ravikumar B. V. and Sastry P. S. Cholinergic muscarinic receptors in human fetal brain: Ontogeny of [3H]quinuclidinyl benzilate binding sites in corpus striatum, brainstem, and cerebellum. J. Neurochem. 45, 1948- 1950 (1985).

Fluorescent labelling of strychnine: A novel approach for recognition of strychnine binding sites on neuronal membrane

trychnine was coupled to fluorescein isothiocyanate to mark strychnine binding sites in spinal cord of rat. Specific binding of strychnine could be demonstrated in synaptosomal fraction. Addition of glycine to the strychninised membrane led to a decrease in fluorescence indicating same receptor loci.

Systematic Construction of Linear Transform Based Full-Diversity, Rate-One Space-Time Frequency Codes

In this paper, we generalize the existing rate-one space frequency (SF) and space-time frequency (STF) code constructions. The objective of this exercise is to provide a systematic design of full-diversity STF codes with high coding gain. Under this generalization, STF codes are formulated as linear transformations of data. Conditions on these linear transforms are then derived so that the resulting STF codes achieve full diversity and high coding gain with a moderate decoding complexity. Many of these conditions involve channel parameters like delay profile (DP) and temporal correlation. When these quantities are not available at the transmitter, design of codes that exploit full diversity on channels with arbitrary DIP and temporal correlation is considered. Complete characterization of a class of such robust codes is provided and their bit error rate (BER) performance is evaluated. On the other hand, when channel DIP and temporal correlation are available at the transmitter, linear transforms are optimized to maximize the coding gain of full-diversity STF codes. BER performance of such optimized codes is shown to be better than those of existing codes.

Synthetic studies towards the phloroglucin natural product hyperforin: construction of the fully prenylated bicyclic core

An approach towards the highly functionalized bicyclo[3.3.1]nonan-9-one core of the complex PPAP-based natural product hyperforin, with the full complement of prenyl substituents in required stereo-disposition, is delineated.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

Convenient construction of tetrahedral finite elements for the quasi-harmonic equation

It is shown that in the finite-element formulation of the general quasi-harmonic equation using tetrahedral elements, for every member of the element family there exists just one numerical universal matrix indpendent of the size, shape and material properties of the element. Thus the element matrix is conveniently constructed by manipulating this single matrix along with a set of reverse sequence codes at the same time accounting for the size, shape and material properties in a simple manner.

Probing into the role of conserved N-glycosylation sites in the Tyrosinase glycoprotein family

N-linked glycosylation has a profound effect on the proper folding, oligomerization and stability of glycoproteins. These glycans impart many properties to proteins that may be important for their proper functioning, besides having a tendency to exert a chaperone-like effect on them. Certain glycosylation sites in a protein however, are more important than other sites for their function and stability. It has been observed that some N-glycosylation sites are conserved over families of glycoproteins over evolution, one such being the tyrosinase related protein family. The role of these conserved N-glycosylation sites in their trafficking, sorting, stability and activity has been examined here. By scrutinizing the different glycosylation sites on this family of glycoproteins it was inferred that different sites in the same family of polypeptides can perform distinct functions and conserved sites across the paralogues may perform diverse functions.