Cyclic AMP in Mycobacteria: Characterization and Functional Role of the Rv1647 Ortholog in Mycobacterium smegmatis{triangledown}

Mycobacterial genomes are endowed with many eukaryote-like nucleotide cyclase genes encoding proteins that can synthesize 3',5'-cyclic AMP (cAMP). However, the roles of cAMP and the need for such redundancy in terms of adenylyl cyclase genes remain unknown. We measured cAMP levels in Mycobacterium smegmatis during growth and under various stress conditions and report the first biochemical and functional characterization of the MSMEG_3780 adenylyl cyclase, whose orthologs in Mycobacterium tuberculosis (Rv1647) and Mycobacterium leprae (ML1399) have been recently characterized in vitro. MSMEG_3780 was important for producing cAMP levels in the logarithmic phase of growth, since the {Delta}MSMEG_3780 strain showed lower intracellular cAMP levels at this stage of growth. cAMP levels decreased in wild-type M. smegmatis under conditions of acid stress but not in the {Delta}MSMEG_3780 strain. This was correlated with a reduction in MSMEG_3780 promoter activity, indicating that the effect of the reduction in cAMP levels on acid stress was caused by a decrease in the transcription of MSMEG_3780. Complementation of the {Delta}MSMEG_3780 strain with the genomic integration of MSMEG_3780 or the Rv1647 gene could restore cAMP levels during logarithmic growth. The Rv1647 promoter was also acid sensitive, emphasizing the biochemical and functional similarities in these two adenylyl cyclases. This study therefore represents the first detailed biochemical and functional analysis of an adenylyl cyclase that is important for maintaining cAMP levels in mycobacteria and underscores the subtle roles that these genes may play in the physiology of the organism.

Heritability of the network architecture of intrinsic brain functional connectivity

The brain's functional network exhibits many features facilitating functional specialization, integration, and robustness to attack. Using graph theory to characterize brain networks, studies demonstrate their small-world, modular, and "rich-club" properties, with deviations reported in many common neuropathological conditions. Here we estimate the heritability of five widely used graph theoretical metrics (mean clustering coefficient (γ), modularity (Q), rich-club coefficient (ϕnorm), global efficiency (λ), small-worldness (σ)) over a range of connection densities (k=5-25%) in a large cohort of twins (N=592, 84 MZ and 89 DZ twin pairs, 246 single twins, age 23±2.5). We also considered the effects of global signal regression (GSR). We found that the graph metrics were moderately influenced by genetic factors h2 (γ=47-59%, Q=38-59%, ϕnorm=0-29%, λ=52-64%, σ=51-59%) at lower connection densities (≤15%), and when global signal regression was implemented, heritability estimates decreased substantially h2 (γ=0-26%, Q=0-28%, ϕnorm=0%, λ=23-30%, σ=0-27%). Distinct network features were phenotypically correlated (|r|=0.15-0.81), and γ, Q, and λ were found to be influenced by overlapping genetic factors. Our findings suggest that these metrics may be potential endophenotypes for psychiatric disease and suitable for genetic association studies, but that genetic effects must be interpreted with respect to methodological choices.

Seeing and hearing speech, sounds, and signs: functional magnetic resonance studies on fluent and dyslexic readers

Speech has both auditory and visual components (heard speech sounds and seen articulatory gestures). During all perception, selective attention facilitates efficient information processing and enables concentration on high-priority stimuli. Auditory and visual sensory systems interact at multiple processing levels during speech perception and, further, the classical motor speech regions seem also to participate in speech perception. Auditory, visual, and motor-articulatory processes may thus work in parallel during speech perception, their use possibly depending on the information available and the individual characteristics of the observer. Because of their subtle speech perception difficulties possibly stemming from disturbances at elemental levels of sensory processing, dyslexic readers may rely more on motor-articulatory speech perception strategies than do fluent readers. This thesis aimed to investigate the neural mechanisms of speech perception and selective attention in fluent and dyslexic readers. We conducted four functional magnetic resonance imaging experiments, during which subjects perceived articulatory gestures, speech sounds, and other auditory and visual stimuli. Gradient echo-planar images depicting blood oxygenation level-dependent contrast were acquired during stimulus presentation to indirectly measure brain hemodynamic activation. Lip-reading activated the primary auditory cortex, and selective attention to visual speech gestures enhanced activity within the left secondary auditory cortex. Attention to non-speech sounds enhanced auditory cortex activity bilaterally; this effect showed modulation by sound presentation rate. A comparison between fluent and dyslexic readers' brain hemodynamic activity during audiovisual speech perception revealed stronger activation of predominantly motor speech areas in dyslexic readers during a contrast test that allowed exploration of the processing of phonetic features extracted from auditory and visual speech. The results show that visual speech perception modulates hemodynamic activity within auditory cortex areas once considered unimodal, and suggest that the left secondary auditory cortex specifically participates in extracting the linguistic content of seen articulatory gestures. They are strong evidence for the importance of attention as a modulator of auditory cortex function during both sound processing and visual speech perception, and point out the nature of attention as an interactive process (influenced by stimulus-driven effects). Further, they suggest heightened reliance on motor-articulatory and visual speech perception strategies among dyslexic readers, possibly compensating for their auditory speech perception difficulties.

Investigation of dye functional group on the photocatalytic degradation of dyes by nano-TiO2

The photocatalytic degradation of five anionic, eight cationic and three solvent dyes using combustion-synthesized nano-TiO2 (CSTiO2) and commercial Degussa P-25 TiO2 (DP-25) were evaluated to determine the effect of the functional group in the dye. The degradation of the dyes was quantified using the initial rate of decolorization and mineralization. The decolorization of the anionic dyes with CSTiO2 followed the order: indigo carmine > eosin Y > amido black 10B > alizarin cyanine green > orange G. The decolorization of the cationic dyes with DP-25 followed the order: malachite green > pyronin Y > rhodamine 6G > azure B > nile blue sulfate > auramine O approximate to acriflavine P approximate to safranin O. CSTiO2 showed higher rates of decolorization and mineralization for all the anionic dyes compared to DP-25, while DP-25 was better in terms of decolorization for most of the cationic dyes. The solvent dyes exhibited adsorption dependent decolorization. The order of decolorization and mineralization of the anionic and cationic dyes (a) with CS TiO2 and DP-25 was different and correlated with the surface properties of these catalysts (b) were rationalized with the molecular structure of the dye and the degradation pathway of the dye. (C) 2009 Elsevier B.V. All rights reserved.

Enantioselective syntheses of cis, syn, cis- and cis, anti, cis-linear triquinanes

Enantioselective syntheses of both cis, syn, cis- and cis, anti, cis-linear triquinanes, starting from the readily available (S)-campholenaldehyde, employing an RCM reaction-based cyclopentannulation strategy, are described.

Localization of handwritten text in documents using moment invariants and Delaunay triangulation

This paper describes an approach based on Zernike moments and Delaunay triangulation for localization of hand-written text in machine printed text documents. The Zernike moments of the image are first evaluated and we classify the text as hand-written using the nearest neighbor classifier. These features are independent of size, slant, orientation, translation and other variations in handwritten text. We then use Delaunay triangulation to reclassify the misclassified text regions. When imposing Delaunay triangulation on the centroid points of the connected components, we extract features based on the triangles and reclassify the text. We remove the noise components in the document as part of the preprocessing step so this method works well on noisy documents. The success rate of the method is found to be 86%. Also for specific hand-written elements such as signatures or similar text the accuracy is found to be even higher at 93%.

Linear time algorithms for Abelian group isomorphism and related problems

We consider the problem of determining if two finite groups are isomorphic. The groups are assumed to be represented by their multiplication tables. We present an O(n) algorithm that determines if two Abelian groups with n elements each are isomorphic. This improves upon the previous upper bound of O(n log n) [Narayan Vikas, An O(n) algorithm for Abelian p-group isomorphism and an O(n log n) algorithm for Abelian group isomorphism, J. Comput. System Sci. 53 (1996) 1-9] known for this problem. We solve a more general problem of computing the orders of all the elements of any group (not necessarily Abelian) of size n in O(n) time. Our algorithm for isomorphism testing of Abelian groups follows from this result. We use the property that our order finding algorithm works for any group to design a simple O(n) algorithm for testing whether a group of size n, described by its multiplication table, is nilpotent. We also give an O(n) algorithm for determining if a group of size n, described by its multiplication table, is Abelian. (C) 2007 Elsevier Inc. All rights reserved.

Cluster based training for scaling non-linear support vector machines

Support Vector Machines(SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involving more than a few thousands of data points. In this paper we propose a novel kernel based incremental data clustering approach and its use for scaling Non-linear Support Vector Machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of Support Vector Machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense.

Four group decodable differential scaled unitary linear space-time codes

Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at both the transmitter and the receiver. Recently Yuen-Guan-Tjhung have proposed Single-Symbol-Decodable Differential Space-Time Modulation based on Quasi-Orthogonal Designs (QODs) by replacing the original unitary criterion by a scaled unitary criterion. These codes were also shown to perform better than differential unitary STBCs from Orthogonal Designs (ODs). However the rate (as measured in complex symbols per channel use) of the codes of Yuen-Guan-Tjhung decay as the number of transmit antennas increase. In this paper, a new class of differential scaled unitary STBCs for all even number of transmit antennas is proposed. These codes have a rate of 1 complex symbols per channel use, achieve full diversity and moreover they are four-group decodable, i.e., the set of real symbols can be partitioned into four groups and decoding can be done for the symbols in each group separately. Explicit construction of multidimensional signal sets that yield full diversity for this new class of codes is also given.

Functional interaction of diphenols with polyphenol oxidase - Molecular determinants of substrate/inhibitor specificity SO FEBS JOURNAL

Polyphenol oxidase (PPO) catalyzes the oxidation of o-diphenols to their respective quinones. The quinones autopolymerize to form dark pigments, an undesired effect. PPO is therefore the target for the development of antibrowning and antimelanization agents. A series of phenolic compounds experimentally evaluated for their binding affinity and inhibition constants were computationally docked to the active site of catechol oxidase. Docking studies suggested two distinct modes of binding, dividing the docked ligands into two groups. Remarkably, the first group corresponds to ligands determined to be substrates and the second group corresponds to reversible inhibitors. Analyses of the complexes provide structural explanations for correlating subtle changes in the position and nature of the substitutions on o-diphenols to their functional properties as substrates and inhibitors. Higher reaction rates and binding are reckoned by additional interactions of the substrates with key residues that line the hydrophobic cavity. The docking results suggest that inhibition of oxidation stems from an interaction between the aromatic carboxylic acid group and the apical His 109 of the four coordinates of the trigonal pyramidal coordination polyhedron of CuA. The spatial orientation of the hydroxyl in relation to the carboxylic group either allows a perfect fit in the substrate cavity, leading to inhibition, or because of a steric clash flips the molecule vertically, facilitating oxidation. This is the first study to explain, at the molecular level, the determinants Of substrate and inhibitor specificity of a catechol oxidase, thereby providing a platform for the design of selective inhibitors useful to both the food and pharmaceutical industries.

Bond-order wave phase, spin solitons, and thermodynamics of a frustrated linear spin-1/2 Heisenberg antiferromagnet

The linear spin-1/2 Heisenberg antiferromagnet with exchanges J(1) and J(2) between first and second neighbors has a bond-order wave (BOW) phase that starts at the fluid-dimer transition at J(2)/J(1)=0.2411 and is particularly simple at J(2)/J(1)=1/2. The BOW phase has a doubly degenerate singlet ground state, broken inversion symmetry, and a finite-energy gap E-m to the lowest-triplet state. The interval 0.4 < J(2)/J(1) < 1.0 has large E-m and small finite-size corrections. Exact solutions are presented up to N = 28 spins with either periodic or open boundary conditions and for thermodynamics up to N = 18. The elementary excitations of the BOW phase with large E-m are topological spin-1/2 solitons that separate BOWs with opposite phase in a regular array of spins. The molar spin susceptibility chi(M)(T) is exponentially small for T << E-m and increases nearly linearly with T to a broad maximum. J(1) and J(2) spin chains approximate the magnetic properties of the BOW phase of Hubbard-type models and provide a starting point for modeling alkali-tetracyanoquinodimethane salts.

Inferring molecular function: contributions from functional linkages

In the current era of high-throughput sequencing and structure determination, functional annotation has become a bottleneck in biomedical science. Here, we show that automated inference of molecular function using functional linkages among genes increases the accuracy of functional assignments by >= 8% and enriches functional descriptions in >= 34% of top assignments. Furthermore, biochemical literature supports >80% of automated inferences for previously unannotated proteins. These results emphasize the benefit of incorporating functional linkages in protein annotation.

On the PAPR of cosets of linear codes

Employing an error control code is one of the techniques to reduce the Peak-to-Average Power Ratio (PAPR) in a Orthogonal Frequency Division Multiplexing system, a well known class of such codes being the cosets of Reed-Muller codes. In this paper, we consider the class of such coset-codes of arbitrary linear codes and present a method of doubling the size of such a code without increasing the PAPR, by combining two such binary coset-codes. We identify the conditions under which we can employ this doubling more than once with no marginal increase in the PAPR value. Given a PAPR and length, our method has enabled to get the best coset-code (in terms of the size). Also, we show that the PAPR information of the coset-codes of the extended codes is obtainable from the PAPR of the corresponding coset-codes of the parent code. We have also shown a special type of lengthening is useful in PAPR studies.