SSMBS: a web server to locate sequentially separated motifs in biological sequences

The identification of sequence (amino acids or nucleotides) motifs in a particular order in biological sequences has proved to be of interest. This paper describes a computing server, SSMBS, which can locate anddisplay the occurrences of user-defined biologically important sequence motifs (a maximum of five) present in a specific order in protein and nucleotide sequences. While the server can efficiently locate motifs specified using regular expressions, it can also find occurrences of long and complex motifs. The computation is carried out by an algorithm developed using the concepts of quantifiers in regular expressions. The web server is available to users around the clock at http://dicsoft1.physics.iisc.ernet.in/ssmbs/.

Recognition and alignment of homologous DNA sequences between minichromosomes and single-stranded DNA promoted by RecA protein

The incorporation of DNA into nucleosomes and higher-order forms of chromatin in vivo creates difficulties with respect to its accessibility for cellular functions such as transcription, replication, repair and recombination. To understand the role of chromatin structure in the process of homologous recombination, we have studied the interaction of nucleoprotein filaments, comprised of RecA protein and ssDNA, with minichromosomes. Using this paradigm, we have addressed how chromatin structure affects the search for homologous DNA sequences, and attempted to distinguish between two mutually exclusive models of DNA-DNA pairing mechanisms. Paradoxically, we found that the search for homologous sequences, as monitored by unwinding of homologous or heterologous duplex DNA, was facilitated by nucleosomes, with no discernible effect on homologous pairing. More importantly, unwinding of minichromosomes required the interaction of nucleoprotein filaments and led to the accumulation of circular duplex DNA sensitive to nuclease P1. Competition experiments indicated that chromatin templates and naked DNA served as equally efficient targets for homologous pairing. These and other findings suggest that nucleosomes do not impede but rather facilitate the search for homologous sequences and establish, in accordance with one proposed model, that unwinding of duplex DNA precedes alignment of homologous sequences at the level of chromatin. The potential application of this model to investigate the role of chromosomal proteins in the alignment of homologous sequences in the context of cellular recombination is considered.

A Method to Find Sequentially Separated Motifs in Biological Sequences (SSMBS)

Sequence motifs occurring in a particular order in proteins or DNA have been proved to be of biological interest. In this paper, a new method to locate the occurrences of up to five user-defined motifs in a specified order in large proteins and in nucleotide sequence databases is proposed. It has been designed using the concept of quantifiers in regular expressions and linked lists for data storage. The application of this method includes the extraction of relevant consensus regions from biological sequences. This might be useful in clustering of protein families as well as to study the correlation between positions of motifs and their functional sites in DNA sequences.

A discrete wavelet transform approach to multiresolution complex SAR image generation

We present a signal processing approach using discrete wavelet transform (DWT) for the generation of complex synthetic aperture radar (SAR) images at an arbitrary number of dyadic scales of resolution. The method is computationally efficient and is free from significant system-imposed limitations present in traditional subaperture-based multiresolution image formation. Problems due to aliasing associated with biorthogonal decomposition of the complex signals are addressed. The lifting scheme of DWT is adapted to handle complex signal approximations and employed to further enhance the computational efficiency. Multiresolution SAR images formed by the proposed method are presented.

Expanding the Peptide beta-Turn in alpha gamma Hybrid Sequences: 12 Atom Hydrogen Bonded Helical and Hairpin Turns

Hybrid peptide segments containing contiguous alpha and gamma amino acid residues can form C-12 hydrogen bonded turns which may be considered as backbone expanded analogues of C-10 beta-turns) found in alpha alpha segments. Exploration of the regular hydrogen bonded conformations accessible for hybrid alpha gamma sequences is facilitated by the use of a stereochemically constrained gamma amino acid residue gabapentin (1-aminomethylcyclohexaneacetic acid, Gpn), in which the two torsion angles about C-gamma-C-beta (theta(1)) and C-beta-C-alpha (theta(2)) are predominantly restricted to gauche conformations. The crystal structures of the octapeptides Boc-Gpn-Aib-Gpn-Aib-Gpn-Aib-Gpn-Aib-OMe (1) and Boc-Leu-Phe-Val-Aib-Gpn-Leu-Phe-Val-OMe (2) reveal two distinct conformations for the Aib-Gpn segment. Peptide 1 forms a continuous helix over the Aib(2)-Aib(6) segment, while the peptide 2 forms beta-hairpin structure stabilized by four cross-strand hydrogen bonds with the Aib-Gpn segment forming a nonhelical C-12 turn. The robustness of the helix in peptide 1 in solution is demonstrated by NMR methods. Peptide 2 is conformationally fragile in solution with evidence of beta-hairpin conformations being obtained in methanol. Theoretical calculations permit delineation of the various C-12 hydrogen bonded structures which are energetically feasible in alpha gamma and gamma alpha sequences.

Low correlation sequences over AM-PSK and QAM alphabets

A construction for a family of sequences over the 8-ary AM-PSK constellation that has maximum nontrivial correlation magnitude bounded as theta(max) less than or similar to root N is presented here. The famfly is asymptotically optimal with respect to the Welch bound on maximum magnitude of correlation. The 8-ary AM-PSK constellation is a subset of the 16-QAM constellation. We also construct two families of sequences over 16-QAM with theta(max) less than or similar to root 2 root N. These families are constructed by interleaving sets of sequences. A construction for a famBy of low-correlation sequences over QAM alphabet of size 2(2m) is presented with maximum nontrivial normalized correlation parameter bounded above by less than or similar to a root N, where N is the period of the sequences in the family and where a ranges from 1.61 in the case of 16-QAM modulation to 2.76 for large m. When used in a CDMA setting, the family will permit each user to modulate the code sequence with 2m bits of data. Interestingly, the construction permits users on the reverse link of the CDMA channel to communicate using varying data rates by switching between sequence famflies; associated to different values of the parameter m. Other features of the sequence families are improved Euclidean distance between different data symbols in comparison with PSK signaling and compatibility of the QAM sequence families with sequences belonging to the large quaternary sequence families {S(p)}.

Eye-view: A retinal image acquisition system

This paper presents a low cost but high resolution retinal image acquisition system of the human eye. The images acquired by a CMOS image sensor are communicated through the Universal Serial Bus (USB) interface to a personal computer for viewing and further processing. The image acquisition time was estimated to be 2.5 seconds. This system can also be used in telemedicine applications.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

Memory-efficient spatial prediction image compression scheme

In prediction phase, the hierarchical tree structure obtained from the test image is used to predict every central pixel of an image by its four neighboring pixels. The prediction scheme generates the predicted error image, to which the wavelet/sub-band coding algorithm can be applied to obtain efficient compression. In quantization phase, we used a modified SPIHT algorithm to achieve efficiency in memory requirements. The memory constraint plays a vital role in wireless and bandwidth-limited applications. A single reusable list is used instead of three continuously growing linked lists as in case of SPIHT. This method is error resilient. The performance is measured in terms of PSNR and memory requirements. The algorithm shows good compression performance and significant savings in memory. (C) 2006 Elsevier B.V. All rights reserved.

Urban satellite image classification using biologically inspired techniques

This paper focuses on optimisation algorithms inspired by swarm intelligence for satellite image classification from high resolution satellite multi- spectral images. Amongst the multiple benefits and uses of remote sensing, one of the most important has been its use in solving the problem of land cover mapping. As the frontiers of space technology advance, the knowledge derived from the satellite data has also grown in sophistication. Image classification forms the core of the solution to the land cover mapping problem. No single classifier can prove to satisfactorily classify all the basic land cover classes of an urban region. In both supervised and unsupervised classification methods, the evolutionary algorithms are not exploited to their full potential. This work tackles the land map covering by Ant Colony Optimisation (ACO) and Particle Swarm Optimisation (PSO) which are arguably the most popular algorithms in this category. We present the results of classification techniques using swarm intelligence for the problem of land cover mapping for an urban region. The high resolution Quick-bird data has been used for the experiments.

Automatic Road Extraction using High Resolution Satellite Image Based on Texture Progressive Analysis and Normalized Cut Method

In this paper the approach for automatic road extraction for an urban region using structural, spectral and geometric characteristics of roads has been presented. Roads have been extracted based on two levels: Pre-processing and road extraction methods. Initially, the image is pre-processed to improve the tolerance by reducing the clutter (that mostly represents the buildings, parking lots, vegetation regions and other open spaces). The road segments are then extracted using Texture Progressive Analysis (TPA) and Normalized cut algorithm. The TPA technique uses binary segmentation based on three levels of texture statistical evaluation to extract road segments where as, Normalizedcut method for road extraction is a graph based method that generates optimal partition of road segments. The performance evaluation (quality measures) for road extraction using TPA and normalized cut method is compared. Thus the experimental result show that normalized cut method is efficient in extracting road segments in urban region from high resolution satellite image.

Polypeptide Helices in Hybrid Peptide Sequences

A new class of polypeptide helices in hybrid sequences containing alpha-, beta-, and gamma-residues is described. The molecular conformations in crystals determined for the synthetic peptides Boc-Leu-Phe-Val-Aib-beta Phe-Leu-Phe-Val-OMe 1 (beta Phe: (S)-beta(3)-homophenylalanine) and Boc-Aib-Gpn-AibGpn-OM2(Gpn:1-(aminomethyl)cycl hexaneacetic acid) reveal expanded helical turns in the hybrid sequences (alpha alpha beta)(n) and (ay), In 1, a repetitive helical structure composed Of C-14 hydrogen-bonded units is observed, whereas 2 provides an example of a repetitive C-12 hydrogen-bonded structure. Using experimentally determined backbone torsion angles for the hydrogen-bonded units formed by hybrid sequences, we have generated energetically favorable hybrid helices. Conformational parameters are provided for C-11, C-12, C-13, C-14, and C-15 helices in hybrid sequences.

Multiple conformational states in crystals and in solution in alpha gamma hybrid peptides. Fragility of the C-12 helix in short sequences

The conformational properties of foldamers generated from alpha gamma hybrid peptide sequences have been probed in the model sequence Boc-Aib-Gpn-Aib-Gpn-NHMe. The choice of alpha-aminoisobutyryl (Aib) and gabapentin (Gpn) residues greatly restricts sterically accessible coil formational space. This model sequence was anticipated to be a short segment of the alpha gamma C-12 helix, stabilized by three successive 4 -> 1 hydrogen bonds, corresponding to a backbone-expanded analogue of the alpha polypeptide 3(10)-helix. Unexpectedly, three distinct crystalline polymorphs were characterized in the solid state by X-ray diffraction. In one form, two successive C-12 hydrogen bonds were obtained at the N-terminus, while a novel C-17 hydrogen-bonded gamma alpha gamma turn was observed at the C-terminus. In the other two polymorphs, isolated C-9 and C-7 hydrogen-bonded turns were observed at Gpn (2) and Gpn (4). Isolated C-12 and C-9 turns were also crystallographically established in the peptides Boc-Aib-Gpn-Aib-OMe and Boc-Gpn-Aib-NHMe, respectively. Selective line broadening of NH resonances and the observation of medium range NH(i)<-> NH(i+2) NOEs established the presence of conformational heterogeneity for the tetrapeptide in CDCl3 solution. The NMR results are consistent with the limited population of the continuous C-12 helix conformation. Lengthening of the (alpha gamma)(n) sequences in the nonapeptides Boc-Aib-Gpn-Aib-Gpn-Aib-Gpn-Aib-Gpn-Xxx (Xxx = Aib, Leu) resulted in the observation of all of the sequential NOEs characteristic of an alpha gamma C-12 helix. These results establish that conformational fragility is manifested in short hybrid alpha gamma sequences despite the choice of conformationally constrained residues, while stable helices are formed on chain extension.

The dynamics of solvation of an electron in the image potential state by a layer of polar adsorbates

Recently, ultrafast two-photon photoemission has been used to study electron solvation at a two-dimensional metal/polar adsorbate interfaces [A. Miller , Science 297, 1163 (2002)]. The electron is bound to the surface by the image interaction. Earlier we have suggested a theoretical description of the states of the electron interacting with a two-dimensional layer of the polar adsorbate [K. L. Sebastian , J. Chem. Phys. 119, 10350 (2003)]. In this paper we have analyzed the dynamics of electron solvation, assuming a trial wave function for the electron and the solvent polarization and then using the Dirac-Frenkel variational method to determine it. The electron is initially photoexcited to a delocalized state, which has a finite but large size, and causes the polar molecules to reorient. This reorientation acts back on the electron and causes its wave function to shrink, which will cause further reorientation of the polar molecules, and the process continues until the electron gets self-trapped. For reasonable values for the parameters, we are able to obtain fair agreement with the experimental observations. (c) 2005 American Institute of Physics.

Inhibitory activity of Image -asparaginase from Mycobcacterium tuberculosis on Yoshida ascites sarcoma in rats

The antitumor activity of Image -asparagine amidohydrolases (EC 3.5.1.1) from Mycobacterium tuberculosis H37Rv and H37Ra strains has been tested on Yoshida ascites sarcoma in rats. The enzyme specific to M. tuberculosis H37Ra but not to H37Rv has proved to be effective in inhibiting the growth of the sarcoma. Comparative studies on the activity of this enzyme with that of similar enzyme from Escherichia coli B, has shown that at the same levels the former is more effective than the latter. Long-lived immunity to this tumor in A/IISc Wistar rats following treatment of tumor bearing animals with M. tuberculosis H37Ra, pH 9.6 Image -asparaginase has been observed. Immunity in these rats was demonstrated by tumor rejection and detection of humoral antibodies in the sera to the antigen of the cell-free extract of the tumor. The enzyme was ineffective in inhibiting fibrosarcoma in mice at the dose levels tested.