Evolution of sequence specificity in a restriction endonuclease by a point mutation

Restriction endonucleases (REases) protect bacteria from invading foreign DNAs and are endowed with exquisite sequence specificity. REases have originated from the ancestral proteins and evolved new sequence specificities by genetic recombination, gene duplication, replication slippage, and transpositional events. They are also speculated to have evolved from nonspecific endonucleases, attaining a high degree of sequence specificity through point mutations. We describe here an example of generation of exquisitely site-specific REase from a highly-promiscuous one by a single point mutation.

A model based factorization approach for dense 3D recovery from monocular video

Feature track matrix factorization based methods have been attractive solutions to the Structure-front-motion (Sfnl) problem. Group motion of the feature points is analyzed to get the 3D information. It is well known that the factorization formulations give rise to rank deficient system of equations. Even when enough constraints exist, the extracted models are sparse due the unavailability of pixel level tracks. Pixel level tracking of 3D surfaces is a difficult problem, particularly when the surface has very little texture as in a human face. Only sparsely located feature points can be tracked and tracking error arc inevitable along rotating lose texture surfaces. However, the 3D models of an object class lie in a subspace of the set of all possible 3D models. We propose a novel solution to the Structure-from-motion problem which utilizes the high-resolution 3D obtained from range scanner to compute a basis for this desired subspace. Adding subspace constraints during factorization also facilitates removal of tracking noise which causes distortions outside the subspace. We demonstrate the effectiveness of our formulation by extracting dense 3D structure of a human face and comparing it with a well known Structure-front-motion algorithm due to Brand.

Sequence design for symbol-asynchronous CDMA with power or rate constraints

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.

Amino acid sequence of the winged bean (Psophocarpus tetragonolobus) basic lectin. Adenine binding and identification of the active-site tryptophan residue

The complete amino acid sequence of winged bean basic agglutinin (WBA I) was obtained by a combination of manual and gas-phase sequencing methods. Peptide fragments for sequence analyses were obtained by enzymatic cleavages using trypsin and Staphylococcus aureus V8 endoproteinase and by chemical cleavages using iodosobenzoic acid, hydroxylamine, and formic acid. COOH-terminal sequence analysis of WBA I and other peptides was performed using carboxypeptidase Y. The primary structure of WBA I was homologous to those of other legume lectins and more so to Erythrina corallodendron. Interestingly, the sequence shows remarkable identities in the regions involved in the association of the two monomers of E. corallodendron lectin. Other conserved regions are the double metal-binding site and residues contributing to the formation of the hydrophobic cavity and the carbohydrate-binding site. Chemical modification studies both in the presence and absence of N-acetylgalactosamine together with sequence analyses of tryptophan-containing tryptic peptides demonstrate that tryptophan 133 is involved in the binding of carbohydrate ligands by the lectin. The location of tryptophan 133 at the active center of WBA I for the first time subserves to explain a role for one of the most conserved residues in legume lectins.

Detection,amplification and sequence homology of sodC in clinical isolates of Salmonella sp

Background & objectives: Periplasmic copper and zinc superoxide dismutase (Cu,Zn-SOD or SodC) is an important component of the antioxidant shield which protects bacteria from the phagocytic oxidative burst. Cu,Zn-SODs protect Gram-negative bacteria against oxygen damage which have also been shown to contribute to the pathogenicity of these bacterial species. We report the presence of SodC in drug resistant Salmonella sp. isolated from patients suffering from enteric fever. Further sodC was amplified, cloned into Escherichia coli and the nucleotide sequence and amino acid sequence homology were compared with the standard strain Salmonella Typhimurium 14028. Methods: Salmonella enterica serovar Typhi (S. Typhi) and Salmonellaenterica serovar Paratyphi (S. Paratyphi) were isolated and identified from blood samples of the patients. The isolates were screened for the presence of Cu, Zn-SOD by PAGE using KCN as inhibitor of Cu,Zn-SOD. The gene (sodC) was amplified by PCR, cloned and sequenced. The nucleotide and amino acid sequences of sodC were compared using CLUSTAL X.Results: SodC was detected in 35 per cent of the Salmonella isolates. Amplification of the genomic DNA of S. Typhi and S. Paratyphi with sodC specific primers resulted in 519 and 515 bp amplicons respectively. Single mutational difference at position 489 was observed between thesodC of S. Typhi and S. Paratyphi while they differed at 6 positions with the sodC of S. Typhimurium 14028. The SodC amino acid sequences of the two isolates were homologous but 3 amino acid difference was observed with that of standard strain S. Typhimurium 14028.Interpretation & conclusions: The presence of SodC in pathogenic bacteria could be a novel candidate as phylogenetic marker.

The Line Spectral Frequency Model of a Finite-Length Sequence

The line spectral frequency (LSF) of a causal finite length sequence is a frequency at which the spectrum of the sequence annihilates or the magnitude spectrum has a spectral null. A causal finite-length sequencewith (L + 1) samples having exactly L-LSFs, is referred as an Annihilating (AH) sequence. Using some spectral properties of finite-length sequences, and some model parameters, we develop spectral decomposition structures, which are used to translate any finite-length sequence to an equivalent set of AH-sequences defined by LSFs and some complex constants. This alternate representation format of any finite-length sequence is referred as its LSF-Model. For a finite-length sequence, one can obtain multiple LSF-Models by varying the model parameters. The LSF-Model, in time domain can be used to synthesize any arbitrary causal finite-length sequence in terms of its characteristic AH-sequences. In the frequency domain, the LSF-Model can be used to obtain the spectral samples of the sequence as a linear combination of spectra of its characteristic AH-sequences. We also summarize the utility of the LSF-Model in practical discrete signal processing systems.

Evolution, Homology Conservation, and Identification of Unique Sequence Signatures in GH19 Family Chitinases

The discovery of GH (Glycoside Hydrolase) 19 chitinases in Streptomyces sp. raises the possibility of the presence of these proteins in other bacterial species, since they were initially thought to be confined to higher plants. The present study mainly concentrates on the phylogenetic distribution and homology conservation in GH19 family chitinases. Extensive database searches are performed to identify the presence of GH19 family chitinases in the three major super kingdoms of life. Multiple sequence alignment of all the identified GH19 chitinase family members resulted in the identification of globally conserved residues. We further identified conserved sequence motifs across the major sub groups within the family. Estimation of evolutionary distance between the various bacterial and plant chitinases are carried out to better understand the pattern of evolution. Our study also supports the horizontal gene transfer theory, which states that GH19 chitinase genes are transferred from higher plants to bacteria. Further, the present study sheds light on the phylogenetic distribution and identifies unique sequence signatures that define GH19 chitinase family of proteins. The identified motifs could be used as markers to delineate uncharacterized GH19 family chitinases. The estimation of evolutionary distance between chitinase identified in plants and bacteria shows that the flowering plants are more related to chitinase in actinobacteria than that of identified in purple bacteria. We propose a model to elucidate the natural history of GH19 family chitinases.

Voting Paths

We consider a variant of the popular matching problem here. The input instance is a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$, where vertices in $\mathcal{A}$ are called applicants and vertices in $\mathcal{P}$ are called posts. Each applicant ranks a subset of posts in an order of preference, possibly involving ties. A matching $M$ is popular if there is no other matching $M'$ such that the number of applicants who prefer their partners in $M'$ to $M$ exceeds the number of applicants who prefer their partners in $M$ to $M'$. However, the “more popular than” relation is not transitive; hence this relation is not a partial order, and thus there need not be a maximal element here. Indeed, there are simple instances that do not admit popular matchings. The questions of whether an input instance $G$ admits a popular matching and how to compute one if it exists were studied earlier by Abraham et al. Here we study reachability questions among matchings in $G$, assuming that $G=(\mathcal{A}\cup\mathcal{P},E)$ admits a popular matching. A matching $M_k$ is reachable from $M_0$ if there is a sequence of matchings $\langle M_0,M_1,\dots,M_k\rangle$ such that each matching is more popular than its predecessor. Such a sequence is called a length-$k$ voting path from $M_0$ to $M_k$. We show an interesting property of reachability among matchings in $G$: there is always a voting path of length at most 2 from any matching to some popular matching. Given a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$ with $n$ vertices and $m$ edges and any matching $M_0$ in $G$, we give an $O(m\sqrt{n})$ algorithm to compute a shortest-length voting path from $M_0$ to a popular matching; when preference lists are strictly ordered, we have an $O(m+n)$ algorithm. This problem has applications in dynamic matching markets, where applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case we are required to update it. However, our model demands that we switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence we need to update via a voting path that ends in a popular matching. Thus our algorithm has applications here.

Protein sequence design on the basis of topology optimization techniques -Using continuous modeling of discrete amino acid types

The notion of optimization is inherent in protein design. A long linear chain of twenty types of amino acid residues are known to fold to a 3-D conformation that minimizes the combined inter-residue energy interactions. There are two distinct protein design problems, viz. predicting the folded structure from a given sequence of amino acid monomers (folding problem) and determining a sequence for a given folded structure (inverse folding problem). These two problems have much similarity to engineering structural analysis and structural optimization problems respectively. In the folding problem, a protein chain with a given sequence folds to a conformation, called a native state, which has a unique global minimum energy value when compared to all other unfolded conformations. This involves a search in the conformation space. This is somewhat akin to the principle of minimum potential energy that determines the deformed static equilibrium configuration of an elastic structure of given topology, shape, and size that is subjected to certain boundary conditions. In the inverse-folding problem, one has to design a sequence with some objectives (having a specific feature of the folded structure, docking with another protein, etc.) and constraints (sequence being fixed in some portion, a particular composition of amino acid types, etc.) while obtaining a sequence that would fold to the desired conformation satisfying the criteria of folding. This requires a search in the sequence space. This is similar to structural optimization in the design-variable space wherein a certain feature of structural response is optimized subject to some constraints while satisfying the governing static or dynamic equilibrium equations. Based on this similarity, in this work we apply the topology optimization methods to protein design, discuss modeling issues and present some initial results.

Nucleotide-sequence of 5S RNA from mycobacterium-smegmatis

32P labelled 5S RNA isolated fromMycobacterium smegmatis was digested withT 1 and pancreatic ribonucleases separately and fingerprinted by two dimensional high voltage electrophoresis on thin-layer DEAE-cellulose plates. The radioactive spots were sequenced and their molar yields were determined. The chain length of the 5S RNA was found to be 120. It showed resemblances to both prokaryotic and eukaryotic 5S RNAs.

Sequence specificity in spermine-induced structural changes in CG-oligomers

The role of spermine in inducing A-DNA conformation in deoxyoligonucleotides has been studied using CCGG and GGCC as model sequences. It has been found that while CCGG adopts an alternating B-DNA conformation in low salt solution at low temperature, addition of spermine to this medium induces a B --greater than A transition. In contrast, the A-DNA-like structure of GGCC in low salt solution at low temperature does not change under the influence of spermine. This suggests a sequence-dependent behaviour of spermine. Further these results suggest that the A-DNA conformation observed in the crystals of d(iCCGG) and d(GGCC)2 might have been due to the presence of spermine in the crystallization cocktail.

Sequence specificity of Z-DNA formation in oligonucleotides

The sequence specific requirement for B----Z transition in solution was examined in d(CGTGCGCACG), d(CGTACGTACG), d(ACGTACGT) in presence of various Z-inducing factors. Conformational studies show that inspite of the alternating nature of purines and pyrimidines, the aforementioned sequences do not undergo B----Z transition under the influence of NaCl, hexamine cobalt chloride and ethanol. A comparison with the crystal structures of an assorted array of purine and pyrimidine sequences show that the sequence requirement for B----Z transition is much more stringent in solution as compared to the solid state. The disruptive influence of AT base pairs in B to Z transition is discussed.