An algorithm to find similar internal sequence repeats

In recent years, identification of sequence patterns has been given immense importance to understand better their significance with respect to genomic organization and evolutionary processes. To this end, an algorithm has been derived to identify all similar sequence repeats present in a protein sequence. The proposed algorithm is useful to correlate the three-dimensional structure of various similar sequence repeats available in the Protein Data Bank against the same sequence repeats present in other databases like SWISS-PROT, PIR and Genome databases.

Prediction of protein-protein interactions between Helicobacter pylori and a human host

A lack of information on protein-protein interactions at the host-pathogen interface is impeding the understanding of the pathogenesis process. A recently developed, homology search-based method to predict protein-protein interactions is applied to the gastric pathogen, Helicobacter pylori to predict the interactions between proteins of H. pylori and human proteins in vitro. Many of the predicted interactions could potentially occur between the pathogen and its human host during pathogenesis as we focused mainly on the H. pylori proteins that have a transmembrane region or are encoded in the pathogenic island and those which are known to be secreted into the human host. By applying the homology search approach to protein-protein interaction databases DIP and iPfam, we could predict in vitro interactions for a total of 623 H. pylori proteins with 6559 human proteins. The predicted interactions include 549 hypothetical proteins of as yet unknown function encoded in the H. pylori genome and 13 experimentally verified secreted proteins. We have recognized 833 interactions involving the extracellular domains of transmembrane proteins of H. pylori. Structural analysis of some of the examples reveals that the interaction predicted by us is consistent with the structural compatibility of binding partners. Examples of interactions with discernible biological relevance are discussed.

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 self-adaptive migration model genetic algorithm for data mining applications

Data mining involves nontrivial process of extracting knowledge or patterns from large databases. Genetic Algorithms are efficient and robust searching and optimization methods that are used in data mining. In this paper we propose a Self-Adaptive Migration Model GA (SAMGA), where parameters of population size, the number of points of crossover and mutation rate for each population are adaptively fixed. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions and a set of actual classification datamining problems. Michigan style of classifier was used to build the classifier and the system was tested with machine learning databases of Pima Indian Diabetes database, Wisconsin Breast Cancer database and few others. The performance of our algorithm is better than others.

A cooperative game theoretic approach to prototype selection

In this paper we consider the task of prototype selection whose primary goal is to reduce the storage and computational requirements of the Nearest Neighbor classifier while achieving better classification accuracies. We propose a solution to the prototype selection problem using techniques from cooperative game theory and show its efficacy experimentally.

Cascade PSI-BLAST web server: a remote homology search tool for relating protein domains

Owing to high evolutionary divergence, it is not always possible to identify distantly related protein domains by sequence search techniques. Intermediate sequences possess sequence features of more than one protein and facilitate detection of remotely related proteins. We have demonstrated recently the employment of Cascade PSI-BLAST where we perform PSI-BLAST for many 'generations', initiating searches from new homologues as well. Such a rigorous propagation through generations of PSI-BLAST employs effectively the role of intermediates in detecting distant similarities between proteins. This approach has been tested on a large number of folds and its performance in detecting superfamily level relationships is similar to 35% better than simple PSI-BLAST searches. We present a web server for this search method that permits users to perform Cascade PSI-BLAST searches against the Pfam, SCOP and SwissProt databases. The URL for this server is http://crick.mbu.iisc.ernet.in/similar to CASCADE/CascadeBlast.html.

A neural network based CBIR system using STI features and relevance feedback

Multimedia mining primarily involves, information analysis and retrieval based on implicit knowledge. The ever increasing digital image databases on the Internet has created a need for using multimedia mining on these databases for effective and efficient retrieval of images. Contents of an image can be expressed in different features such as Shape, Texture and Intensity-distribution(STI). Content Based Image Retrieval(CBIR) is an efficient retrieval of relevant images from large databases based on features extracted from the image. Most of the existing systems either concentrate on a single representation of all features or linear combination of these features. The paper proposes a CBIR System named STIRF (Shape, Texture, Intensity-distribution with Relevance Feedback) that uses a neural network for nonlinear combination of the heterogenous STI features. Further the system is self-adaptable to different applications and users based upon relevance feedback. Prior to retrieval of relevant images, each feature is first clustered independent of the other in its own space and this helps in matching of similar images. Testing the system on a database of images with varied contents and intensive backgrounds showed good results with most relevant images being retrieved for a image query. The system showed better and more robust performance compared to existing CBIR systems

A denotational semantics for the generalized ER model and a simple ER algebra

The recent spurt of research activities in Entity-Relationship Approach to databases calls for a close scrutiny of the semantics of the underlying Entity-Relationship models, data manipulation languages, data definition languages, etc. For reasons well known, it is very desirable and sometimes imperative to give formal description of the semantics. In this paper, we consider a specific ER model, the generalized Entity-Relationship model (without attributes on relationships) and give denotational semantics for the model as well as a simple ER algebra based on the model. Our formalism is based on the Vienna Development Method—the meta language (VDM). We also discuss the salient features of the given semantics in detail and suggest directions for further work.

Secure Concurrency Control in Firm Real-Time Database Systems

Many real-time database applications arise in electronic financial services, safety-critical installations and military systems where enforcing security is crucial to the success of the enterprise. For real-time database systems supporting applications with firm deadlines, we investigate here the performance implications, in terms of killed transactions, of guaranteeing multilevel secrecy. In particular, we focus on the concurrency control (CC) aspects of this issue. Our main contributions are the following: First, we identify which among the previously proposed real-time CC protocols are capable of providing covert-channel-free security. Second, using a detailed simulation model, we profile the real-time performance of a representative set of these secure CC protocols for a variety of security-classified workloads and system configurations. Our experiments show that a prioritized optimistic CC protocol, OPT-WAIT, provides the best overall performance. Third, we propose and evaluate a novel "dual-CC" approach that allows the real-time database system to simultaneously use different CC mechanisms for guaranteeing security and for improving real-time performance. By appropriately choosing these different mechanisms, concurrency control protocols that provide even better performance than OPT-WAIT are designed. Finally, we propose and evaluate GUARD, an adaptive admission-control policy designed to provide fairness with respect to the distribution of killed transactions across security levels. Our experiments show that GUARD efficiently provides close to ideal fairness for real-time applications that can tolerate covert channel bandwidths of upto one bit per second.

A methodology for supporting ``transfer'' in biomimetic design

Biomimetics involves transfer from one or more biological examples to a technical system. This study addresses four questions. What are the essential steps in a biomimetic process? What is transferred? How can the transferred knowledge be structured in a way useful for biologists and engineers? Which guidelines can be given to support transfer in biomimetic design processes? In order to identify the essential steps involved in carrying out biomimetics, several procedures found in the literature were summarized, and four essential steps that are common across these procedures were identified. For identification of mechanisms for transfer, 20 biomimetic examples were collected and modeled according to a model. of causality called the SAPPhIRE model. These examples were then analyzed for identifying the underlying similarity between each biological and corresponding analogue technical system. Based on the SAPPhIRE model, four levels of abstraction at which transfer takes place were identified. Taking into account similarity, the biomimetic examples were assigned to the appropriate levels of abstraction of transfer. Based on the essential steps and the levels of transfer, guidelines for supporting transfer in biomimetic design were proposed and evaluated using design experiments. The 20 biological and analogue technical systems that were analyzed were similar in the physical effects used and at the most abstract levels of description of their functionality, but they were the least similar at the lowest levels of abstraction: the parts involved. Transfer most often was carried out at the physical effect level of abstraction. Compared to a generic set of guidelines based on the literature, the proposed guidelines improved design performance by about 60%. Further, the SAPPhIRE model turned out to be a useful representation for modeling complex biological systems and their functionality. Databases of biological systems, which are structured using the SAPPhIRE model, have the potential to aid biomimetic concept generation.

Rotorcraft research in India: recent developments

Purpose - The purpose of this paper is to discuss published research in rotorcraft which has taken place in India during the last ten years The helicopter research is divided into the following parts health monitoring smart rotor design optimization control helicopter rotor dynamics active control of structural response (ACSR) and helicopter design and development Aspects of health monitoring and smart rotor are discussed in detail Further work needed and areas for international collaboration are pointed out Design/methodology/approach - The archival journal papers on helicopter engineering published from India are obtained from databases and are studied and discussed The contribution of the basic research to the state of the art in helicopter engineering science is brought out Findings - It is found that strong research capabilities have developed in rotor system health and usage monitoring rotor blade design optimization ACSR composite rotor blades and smart rotor development Furthermore rotorcraft modeling and analysis aspects are highly developed with considerable manpower available and being generated in these areas Practical implications - Two helicopter projects leading to the advanced light helicopter and light combat helicopter have been completed by Hindustan Aeronautics Ltd These helicopter programs have benefited from the basic research and also provide platforms for further basic research and deeper industry academic collaborations The development of well trained helicopter engineers is also attractive for international helicopter design and manufacturing companies The basic research done needs to be further developed for practical and commercial applications Originality/value - This is the first comprehensive research on rotorcraft research in India an important emerging market manufacturing and sourcing destination for the industry

Cloning and sequence of a cDNA encoding a novel hybrid prolme-rich protein associated with cytokinin-induced haustoria formation in Cuscuta reflexa

A complete cDNA encoding a novel hybrid Pro-rich protein (HyPRP) was identified by differentially screening 3x10(4) recombinant plaques of a Cuscuta reflexa cytokinin-induced haustorial cDNA library constructed in lambda gt10. The nucleotide (nt) sequence consists of: (i) a 424-bp 5'-non coding region having five start codons (ATGs) and three upstream open reading frames (uORFs); (ii) an ORF of 987 bp with coding potential for a 329-amino-acid (aa) protein of M(r), 35203 with a hydrophobic N-terminal region including a stretch of nine consecutive Phe followed by a Pro-rich sequence and a Cys-rich hydrophobic C terminus; and (iii) a 178-bp 3'-UTR (untranslated region). Comparison of the predicted aa sequence with the NBRF and SWISSPROT databases and with a recent report of an embryo-specific protein of maize [Jose-Estanyol et al., Plant Cell 4 (1992) 413-423] showed it to be similar to the class of HyPRPs encoded by genes preferentially expressed in young tomato fruits, maize embryos and in vitro-cultured carrot embryos. Northern analysis revealed an approx. 1.8-kb mRNA of this gene expressed in the subapical region of the C. reflexa vine which exhibited maximum sensitivity to cytokinin in haustorial induction.

Prediction of protein-protein interactions between human host and a pathogen and its application to three pathogenic bacteria

Molecular understanding of disease processes can be accelerated if all interactions between the host and pathogen are known. The unavailability of experimental methods for large-scale detection of interactions across host and pathogen organisms hinders this process. Here we apply a simple method to predict protein-protein interactions across a host and pathogen organisms. We use homology detection approaches against the protein-protein interaction databases. DIP and iPfam in order to predict interacting proteins in a host-pathogen pair. In the present work, we first applied this approach to the test cases involving the pairs phage T4 - Escherichia coli and phage lambda - E. coli and show that previously known interactions could be recognized using our approach. We further apply this approach to predict interactions between human and three pathogens E. coli, Salmonella enterica typhimurium and Yersinia pestis. We identified several novel interactions involving proteins of host or pathogen that could be thought of as highly relevant to the disease process. Serendipitously, many interactions involve hypothetical proteins of yet unknown function. Hypothetical proteins are predicted from computational analysis of genome sequences with no laboratory analysis on their functions yet available. The predicted interactions involving such proteins could provide hints to their functions. (C) 2011 Elsevier B.V. All rights reserved.

RPS: Repeats in Protein Sequences

Repeats are two or more contiguous segments of amino acid residues that are believed to have arisen as a result of intragenic duplication, recombination and mutation events. These repeats can be utilized for protein structure prediction and can provide insights into the protein evolution and phylogenetic relationship. Therefore, to aid structural biologists and phylogeneticists in their research, a computing resource (a web server and a database), Repeats in Protein Sequences (RPS), has been created. Using RPS, users can obtain useful information regarding identical, similar and distant repeats (of varying lengths) in protein sequences. In addition, users can check the frequency of occurrence of the repeats in sequence databases such as the Genome Database, PIR and SWISS-PROT and among the protein sequences available in the Protein Data Bank archive. Furthermore, users can view the three-dimensional structure of the repeats using the Java visualization plug-in Jmol. The proposed computing resource can be accessed over the World Wide Web at http://bioserver1.physics.iisc.ernet.in/rps/.

BSSB: BLAST Server for Structural Biologists

The Basic Local Alignment Search Tool (BLAST) is one of the most widely used sequence alignment programs with which similarity searches, for both protein and nucleic acid sequences, can be performed against large databases at high speed. A large number of tools exist for processing BLAST output, but none of them provide three-dimensional structure visualization. This shortcoming has been addressed in the proposed tool BLAST Server for Structural Biologists (BSSB), which maps a BLAST output onto the three-dimensional structure of the subject protein. The three-dimensional structure of the subject protein is represented using a three-color coding scheme (identical: red; similar: yellow; and mismatch: white) based on the pairwise alignment obtained. Thus, the user will be able to visualize a possible three-dimensional structure for the query protein sequence. This information can be used to gain a deeper insight into the sequence-structure correlation. Furthermore, the additional structure-level information enables the user to make coherent and logical decisions regarding the type of input model structure or fragment that can be used for molecular replacement calculations. This tool is freely available to all users at http://bioserver1.physics.iisc.ernet.in/bssb/.