Structure, function, and mechanism of HhaI DNA methyltransferases

A vast amount of literature has accumulated on the characterization of DNA methyltransferases. The HhaI DNA methyltransferase, a C5-cytosine methyltransferase, has been the subject of investigation for the last 2 decades. Biochemical and kinetic characterization have led to an understanding of the catalytic and kinetic mechanism of the methyltransfer reaction. The HhaI methyltransferase has also been subjected to extensive structural analysis, with the availability of 12 structures with or without a cofactor and a variety of DNA substrates. The mechanism of base flipping, first described for the HhaI methyltransferase, is conserved among all DNA methyltransferases and is also found to occur in numerous DNA repair enzymes. Studies with other methyltransferase reveal a significant structural and functional similarity among different types of methyltransferases. This review aims to summarize the available information on the HhaI DNA methyltransferase.

Localisation of discrete change in a transformer winding: a network-function-loci approach

An entirely different approach for localisation of winding deformation based on terminal measurements is presented. Within the context of this study, winding deformation means, a discrete and specific change externally imposed at a particular position on the winding. The proposed method is based on pre-computing and plotting the complex network-function loci e.g. driving-point impedance (DPI)] at a selected frequency, for a meaningful range of values for each element (increasing and decreasing) of the ladder network which represents the winding. This loci diagram is called the nomogram. After introducing a discrete change, amplitude and phase of DPI are measured. By plotting this single measurement on the nomogram, it is possible to estimate the location and identify the extent of change. In contrast to the existing approach, the proposed method is fast, non-iterative and yields reasonably good localisation. Experimental results for actual transformer windings (interleaved and continuous disc) are presented.

Special Issue: Engineering applications of representations of function, Part 1

In engineering design, the end goal is the creation of an artifact, product, system, or process that fulfills some functional requirements at some desired level of performance. As such, knowledge of functionality is essential in a wide variety of tasks in engineering activities, including modeling, generation, modification, visualization, explanation, evaluation, diagnosis, and repair of these artifacts and processes. A formal representation of functionality is essential for supporting any of these activities on computers. The goal of Parts 1 and 2 of this Special Issue is to bring together the state of knowledge of representing functionality in engineering applications from both the engineering and the artificial intelligence (AI) research communities.

The carboxy terminal WD domain of the pre-mRNA splicing factor Prp17p is critical for function

In Saccharomyces cerevisiae, Prp17p is required for the efficient completion of the second step of pre-mRNA splicing. The function and interacting factors for this protein have not been elucidated. We have performed a mutational analysis of yPrp17p to identify protein domains critical for function. A series of deletions were made throughout the region spanning the N-terminal 158 amino acids of the protein, which do not contain any identified structural motifs. The C-terminal portion (amino acids 160–455) contains a WD domain containing seven WD repeats. We determined that a minimal functional Prp17p consists of the WD domain and 40 amino acids N-terminal to it. We generated a three-dimensional model of the WD repeats in Prp17p based on the crystal structure of the [beta]-transducin WD domain. This model was used to identify potentially important amino acids for in vivo functional characterization. Through analysis of mutations in four different loops of Prp17p that lie between [beta] strands in the WD repeats, we have identified four amino acids, 235TETG238, that are critical for function. These amino acids are predicted to be surface exposed and may be involved in interactions that are important for splicing. Temperature-sensitive prp17 alleles with mutations of these four amino acids are defective for the second step of splicing and are synthetically lethal with a U5 snRNA loop I mutation, which is also required for the second step of splicing. These data reinforce the functional significance of this region within the WD domain of Prp17p in the second step of splicing.

Comparative Analysis of Pilot-Assisted Distributed Cophasing Approaches in Wireless Sensor Networks

This paper compares and analyzes the performance of distributed cophasing techniques for uplink transmission over wireless sensor networks. We focus on a time-division duplexing approach, and exploit the channel reciprocity to reduce the channel feedback requirement. We consider periodic broadcast of known pilot symbols by the fusion center (FC), and maximum likelihood estimation of the channel by the sensor nodes for the subsequent uplink cophasing transmission. We assume carrier and phase synchronization across the participating nodes for analytical tractability. We study binary signaling over frequency-flat fading channels, and quantify the system performance such as the expected gains in the received signal-to-noise ratio (SNR) and the average probability of error at the FC, as a function of the number of sensor nodes and the pilot overhead. Our results show that a modest amount of accumulated pilot SNR is sufficient to realize a large fraction of the maximum possible beamforming gain. We also investigate the performance gains obtained by censoring transmission at the sensors based on the estimated channel state, and the benefits obtained by using maximum ratio transmission (MRT) and truncated channel inversion (TCI) at the sensors in addition to cophasing transmission. Simulation results corroborate the theoretical expressions and show the relative performance benefits offered by the various schemes.

Filtered density function for large eddy simulation of turbulent reacting flows

A methodology termed the “filtered density function” (FDF) is developed and implemented for large eddy simulation (LES) of chemically reacting turbulent flows. In this methodology, the effects of the unresolved scalar fluctuations are taken into account by considering the probability density function (PDF) of subgrid scale (SGS) scalar quantities. A transport equation is derived for the FDF in which the effect of chemical reactions appears in a closed form. The influences of scalar mixing and convection within the subgrid are modeled. The FDF transport equation is solved numerically via a Lagrangian Monte Carlo scheme in which the solutions of the equivalent stochastic differential equations (SDEs) are obtained. These solutions preserve the Itô-Gikhman nature of the SDEs. The consistency of the FDF approach, the convergence of its Monte Carlo solution and the performance of the closures employed in the FDF transport equation are assessed by comparisons with results obtained by direct numerical simulation (DNS) and by conventional LES procedures in which the first two SGS scalar moments are obtained by a finite difference method (LES-FD). These comparative assessments are conducted by implementations of all three schemes (FDF, DNS and LES-FD) in a temporally developing mixing layer and a spatially developing planar jet under both non-reacting and reacting conditions. In non-reacting flows, the Monte Carlo solution of the FDF yields results similar to those via LES-FD. The advantage of the FDF is demonstrated by its use in reacting flows. In the absence of a closure for the SGS scalar fluctuations, the LES-FD results are significantly different from those based on DNS. The FDF results show a much closer agreement with filtered DNS results. © 1998 American Institute of Physics.

Multigroup-Decodable STBCs from Clifford Algebras

A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt=2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a2(a−1), which is, equivalently, a class of Single-Symbol Decodable codes, (ii) A class of (2a−2)-group decodable with rate (a−1)2(a−2), i.e., a class of Double-Symbol Decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known Quasi-Orthogonal Designs.

Chimeras of Escherichia coli and Mycobacterium tuberculosis Single-Stranded DNA Binding Proteins: Characterization and Function in Escherichia coli

Single stranded DNA binding proteins (SSBs) are vital for the survival of organisms. Studies on SSBs from the prototype, Escherichia coli (EcoSSB) and, an important human pathogen, Mycobacterium tuberculosis (MtuSSB) had shown that despite significant variations in their quaternary structures, the DNA binding and oligomerization properties of the two are similar. Here, we used the X-ray crystal structure data of the two SSBs to design a series of chimeric proteins (m beta 1, m beta 1'beta 2, m beta 1-beta 5, m beta 1-beta 6 and m beta 4-beta 5) by transplanting beta 1, beta 1'beta 2, beta 1-beta 5, beta 1-beta 6 and beta 4-beta 5 regions, respectively of the N-terminal (DNA binding) domain of MtuSSB for the corresponding sequences in EcoSSB. In addition, m beta 1'beta 2(ESWR) SSB was generated by mutating the MtuSSB specific `PRIY' sequence in the beta 2 strand of m beta 1'beta 2 SSB to EcoSSB specific `ESWR' sequence. Biochemical characterization revealed that except for m beta 1 SSB, all chimeras and a control construct lacking the C-terminal domain (Delta C SSB) bound DNA in modes corresponding to limited and unlimited modes of binding. However, the DNA on MtuSSB may follow a different path than the EcoSSB. Structural probing by protease digestion revealed that unlike other SSBs used, m beta 1 SSB was also hypersensitive to chymotrypsin treatment. Further, to check for their biological activities, we developed a sensitive assay, and observed that m beta 1-beta 6, MtuSSB, m beta 1'beta 2 and m beta 1-beta 5 SSBs complemented E. coli Delta ssb in a dose dependent manner. Complementation by the m beta 1-beta 5 SSB was poor. In contrast, m beta 1'beta 2(ESWR) SSB complemented E. coli as well as EcoSSB. The inefficiently functioning SSBs resulted in an elongated cell/filamentation phenotype of E. coli. Taken together, our observations suggest that specific interactions within the DNA binding domain of the homotetrameric SSBs are crucial for their biological function.

Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

Abstract Characteristic Function

The characteristic function for a contraction is a classical complete unitary invariant devised by Sz.-Nagy and Foias. Just as a contraction is related to the Szego kernel k(S)(z, w) = ( 1 - z(w)over bar)- 1 for |z|, |w| < 1, by means of (1/k(S))( T, T *) = 0, we consider an arbitrary open connected domain Omega in C(n), a kernel k on Omega so that 1/k is a polynomial and a tuple T = (T(1), T(2), ... , T(n)) of commuting bounded operators on a complex separable Hilbert spaceHsuch that (1/k)( T, T *) >= 0. Under some standard assumptions on k, it turns out that whether a characteristic function can be associated with T or not depends not only on T, but also on the kernel k. We give a necessary and sufficient condition. When this condition is satisfied, a functional model can be constructed. Moreover, the characteristic function then is a complete unitary invariant for a suitable class of tuples T.

Structure-function relationship in serine hydroxymethyltransferase

Serine hydroxymethyltransferase (SHMT), a pyridoxal-5V-phosphate (PLP)-dependent enzyme catalyzes thetetrahydrofolate (H4-folate)- dependent retro-aldol cleavage of serine to form 5,10-methylene H4-folate and glycine. The structure–function relationship of SHMT wasstudied in our laboratory initially by mutation of residues that are conserved in all SHMTs and later by structure-based mutagenesis of residues located in the active site. The analysis of mutants showed that K71, Y72, R80, D89, W110, S202, C203, H304, H306 and H356 residues are involved in maintenance of the oligomeric structure. The mutation of D227, a residue involved in charge relay system, led to the formation of inactive dimers, indicating that this residue has a role in maintaining the tetrameric structure and catalysis. E74, a residue appropriately positioned in the structure of the enzyme to carry out proton abstraction, was shown by characterization of E74Q and E74K mutants to be involved in conversion of the enzyme from an ‘open’ to ‘closed’ conformation rather than proton abstraction from the hydroxylgroup of serine. K256, the residue involved in the formation of Schiffs base with PLP, also plays a crucial role in the maintenance of the tetrameric structure. Mutation of R262 residue established the importance of distal interactions in facilitating catalysis and Y82 is not involved in the formaldehyde transfer via the postulated hemiacetal intermediate but plays a role in stabilizing the quinonoid intermediate.The mutational analysis of scSHMT along with the structure of recombinant Bacillus stearothermophilus SHMT and its substrate(s)complexes was used to provide evidence for a direct transfer mechanism rather than retro-aldol cleavage for the reaction catalyzed by SHMT.