Search

The significance of metabolic pathway prediction is to envision the viable unknown transformations that can occur provided the appropriate enzymes are present. It can facilitate the prediction of the consequences of host-pathogen interactions. In this article, we have proposed a new algorithm Architectural Similarity-based Automated Pathway Prediction (ASAPP) to predict metabolic pathways based on the structural similarity among the metabolites. ASAPP takes two-dimensional structure and molecular weight of metabolites as input, and generates a list of probable transformations without the knowledge of any externally established reactions, with an accuracy of 85.09 percent. ASAPP has also been applied to predict the outcome of pathogen liberated toxins on the carbohydrate and lipid pathways of the hosts. We have analyzed the disruption of host pathways in the presence of toxins, and have found that some metabolites in Glycolysis and the TCA cycle have a high chance of being the breakpoints in the pathway. The tool is available at http://asapp.droppages.com/.

The human brain and its temporal behavior correlated with development, structure, and function is a complex natural system even for its own kind. Coding and automation are necessary for modeling, analyzing and understanding the 86.1 +/- 8.1 +/- billion neurons, an almost equal number of non-neuronal glial cells, and the neuronal networks of the human brain comprising about 100 trillion connections. 'Computational neuroscience' which is heavily dependent on biology, physics, mathematics and computation addresses such problems while the archival, retrieval and merging of the huge amount of generated data in the form of clinical records, scientific literature, and specialized databases are carried out by 'neuroinformatics' approaches. Neuroinformatics is thus an interface between computer science and experimental neuroscience. This article provides an introduction to computational neuroscience and neuroinformatics fields along with their state-ofthe- art tools, software, and resources. Furthermore, it describes a few innovative applications of these fields in predicting and detecting brain network organization, complex brain disorder diagnosis, large-scale 3D simulation of the brain, brain- computer, and brain-to-brain interfaces. It provides an integrated overview of the fields in a non-technical way, appropriate for broad general readership. Moreover, the article is an updated unified resource of the existing knowledge and sources for researchers stepping into these fields.

Performance of clustering algorithms is largely dependent on selected similarity measure. Efficiency in handling outliers is a major contributor to the success of a similarity measure. Better the ability of similarity measure in measuring similarity between genes in the presence of outliers, better will be the performance of the clustering algorithm in forming biologically relevant groups of genes. In the present article, we discuss the problem of handling outliers with different existing similarity measures and introduce the concepts of Relative Sample Outlier (RSO). We formulate new similarity, called Weighted Sample Similarity (WSS), incorporated in Euclidean distance and Pearson correlation coefficient and then use them in various clustering and biclustering algorithms to group different gene expression profiles. Our results suggest that WSS improves performance, in terms of finding biologically relevant groups of genes, of all the considered clustering algorithms.

A large volume of data relevant to immunology research has accumulated due to sequencing of genomes of the human and other model organisms. At the same time, huge amounts of clinical and epidemiologic data are being deposited in various scientific literature and clinical records. This accumulation of the information is like a goldmine for researchers looking for mechanisms of immune function and disease pathogenesis. Thus the need to handle this rapidly growing immunological resource has given rise to the field known as immunoinformatics. Immunoinformatics, otherwise known as computational immunology, is the interface between computer science and experimental immunology. It represents the use of computational methods and resources for the understanding of immunological information. It not only helps in dealing with huge amount of data but also plays a great role in defining new hypotheses related to immune responses. This chapter reviews classical immunology, different databases, and prediction tool. Further, it briefly describes applications of immunoinformatics in reverse vaccinology, immune system modeling, and cancer diagnosis and therapy. It also explores the idea of integrating immunoinformatics with systems biology for the development of personalized medicine. All these efforts save time and cost to a great extent.

In an extension of previous work, here we introduce a second-order optimization method for determining optimal paths from the substrate to a target product of a metabolic network, through which the amount of the target is maximum. An objective function for the said purpose, along with certain linear constraints, is considered and minimized. The basis vectors spanning the null space of the stoichiometric matrix, depicting the metabolic network, are computed, and their convex combinations satisfying the constraints are considered as flux vectors. A set of other constraints, incorporating weighting coefficients corresponding to the enzymes in the pathway, are considered. These weighting coefficients appear in the objective function to be minimized. During minimization, the values of these weighting coefficients are estimated and learned. These values, on minimization, represent an optimal pathway, depicting optimal enzyme concentrations, leading to overproduction of the target. The results on various networks demonstrate the usefulness of the methodology in the domain of metabolic engineering. A comparison with the standard gradient descent and the extreme pathway analysis technique is also performed. Unlike the gradient descent method, the present method, being independent of the learning parameter, exhibits improved results.

The human Wnt signaling pathway contains 57 genes communicating among themselves by 70 experimentally established associations, as given in the KEGG/PATHWAY database. It is responsible for a variety of crucial biological functions such as regulation of cell fate determination, proliferation, differentiation, migration, and apoptosis. Abnormal behavior of its members causes numerous types of human cancers, dramatic changes in bone mass density that lead to diseases such as osteoporosis-pseudo-glioma syndrome, Van-Buchem disease, skeletal malformation, autosomal dominant sclerosteosis, and osteoporosis type I syndromes. So far, single genes have been investigated for their disease-causing properties, and single diseases have been traced backwards to discover foul-play of the system pathways. Differential expression of the whole genome has been mapped by microarray. But how all the genes involved in a pathway affect each other in single/multiple disease state(s) and whether the presence of one disease state makes a person prone to another kind of disease(s) (i.e., co-morbidity among diseases associated with a certain important biological pathway) is still unknown. We have developed a human Wnt signaling pathway diseasome and analyzed it for finding answers to such questions. Data used in constructing the diseasome can be downloaded from the publicly accessible webserver http://www.isical.ac.in/-rajat/diseasome/index.php.

Bioinformatics tools have facilitated the reconstruction and analysis of cellular metabolism of various organisms based on information encoded in their genomes. Characterization of cellular metabolism is useful to understand the phenotypic capabilities of these organisms. It has been done quantitatively through the analysis of pathway operations. There are several in silico approaches for analyzing metabolic networks, including structural and stoichiometric analysis, metabolic flux analysis, metabolic control analysis, and several kinetic modeling based analyses. They can serve as a virtual laboratory to give insights into basic principles of cellular functions. This article summarizes the progress and advances in software and algorithm development for metabolic network analysis, along with their applications relevant to cellular physiology, and metabolic engineering with an emphasis on microbial strain optimization. Moreover, it provides a detailed comparative analysis of existing approaches under different categories., (Copyright © 2013 Elsevier B.V. All rights reserved.)

In-silico metabolic engineering is a very useful branch of systems biology for modeling, analysis and prediction of various outcomes of metabolic pathways. It can also be used for detecting interactions and dynamics within a network. Various protocols have been proposed for modeling a pathway. But most of these protocols have various disadvantages and shortcomings with respect to automated pathway modeling and analysis. In the present article, we have proposed a novel algorithm for automated pathway reconstruction. We have also made a comparative study of our algorithm with other standard protocols and discussed its advantages over others. We present StructurAl Grammar-based automated PAthway Reconstruction (SAGPAR), a fast and robust algorithm that generates any metabolic pathway using some given structural representations of metabolites. Users can model any pathway based on some pre-required features that are asked as an input by the algorithm. The algorithm also takes into considerations various thermodynamic thresholds and structural properties while modeling a pathway. The given algorithm has been tested on the standard pathway datasets of 25 pathways of Mycoplasma pneumoniae M129 and 24 pathways of Homo sapiens. The dataset is taken from KEGG and PubChem Compound data repositories. SAGPAR performs much better than some already present metabolic pathway analysis tools like Copasi, PHT, Gepasi, Jarnac and Path-A.

Genome sequencing of humans and other organisms has led to the accumulation of huge amounts of data, which include immunologically relevant data. A large volume of clinical data has been deposited in several immunological databases and as a result immunoinformatics has emerged as an important field which acts as an intersection between experimental immunology and computational approaches. It not only helps in dealing with the huge amount of data but also plays a role in defining new hypotheses related to immune responses. This article reviews classical immunology, different databases and prediction tools. It also describes applications of immunoinformatics in designing in silico vaccination and immune system modelling. All these efforts save time and reduce cost., (© 2010 The Authors. Immunology © 2010 Blackwell Publishing Ltd.)

Distance based clustering algorithms can group genes that show similar expression values under multiple experimental conditions. They are unable to identify a group of genes that have similar pattern of variation in their expression values. Previously we developed an algorithm called divisive correlation clustering algorithm (DCCA) to tackle this situation, which is based on the concept of correlation clustering. But this algorithm may also fail for certain cases. In order to overcome these situations, we propose a new clustering algorithm, called average correlation clustering algorithm (ACCA), which is able to produce better clustering solution than that produced by some others. ACCA is able to find groups of genes having more common transcription factors and similar pattern of variation in their expression values. Moreover, ACCA is more efficient than DCCA with respect to the time of execution. Like DCCA, we use the concept of correlation clustering concept introduced by Bansal et al. ACCA uses the correlation matrix in such a way that all genes in a cluster have the highest average correlation values with the genes in that cluster. We have applied ACCA and some well-known conventional methods including DCCA to two artificial and nine gene expression datasets, and compared the performance of the algorithms. The clustering results of ACCA are found to be more significantly relevant to the biological annotations than those of the other methods. Analysis of the results show the superiority of ACCA over some others in determining a group of genes having more common transcription factors and with similar pattern of variation in their expression profiles. Availability of the software: The software has been developed using C and Visual Basic languages, and can be executed on the Microsoft Windows platforms. The software may be downloaded as a zip file from http://www.isical.ac.in/~rajat. Then it needs to be installed. Two word files (included in the zip file) need to be consulted before installation and execution of the software., (Copyright 2010 Elsevier Inc. All rights reserved.)

In the present article, we develop two interval based fuzzy systems for identification of some possible genes mediating the carcinogenic development in various tissues. The methodology involves dimensionality reduction, classifying the genes through incorporation of the notion of linguistic fuzzy sets low, medium and high, and finally selection of some possible genes mediating a particular disease, obtained by a rule generation/grouping technique. The effectiveness of the proposed methodology, is demonstrated using five microarray gene expression datasets dealing with human lung, colon, sarcoma, breast cancer and leukemia. Moreover, the superior capability of the methodology in selecting important genes, over five other existing gene selection methods, viz., Significance Analysis of Microarrays (SAM), Signal-to-Noise Ratio (SNR), Neighborhood analysis (NA), Bayesian Regularization (BR) and Data-adaptive (DA) is demonstrated, in terms of the enrichment of each GO category of the important genes based on P-values. The results are appropriately validated by earlier investigations, gene expression profiles and t-test. The proposed methodology has been able to select genes that are more biologically significant in mediating the development of a disease than those obtained by the others.

Motivation: Biclustering has been emerged as a powerful tool for identification of a group of co-expressed genes under a subset of experimental conditions (measurements) present in a gene expression dataset. Several biclustering algorithms have been proposed till date. In this article, we address some of the important shortcomings of these existing biclustering algorithms and propose a new correlation-based biclustering algorithm called bi-correlation clustering algorithm (BCCA)., Results: BCCA has been able to produce a diverse set of biclusters of co-regulated genes over a subset of samples where all the genes in a bicluster have a similar change of expression pattern over the subset of samples. Moreover, the genes in a bicluster have common transcription factor binding sites in the corresponding promoter sequences. The presence of common transcription factors binding sites, in the corresponding promoter sequences, is an evidence that a group of genes in a bicluster are co-regulated. Biclusters determined by BCCA also show highly enriched functional categories. Using different gene expression datasets, we demonstrate strength and superiority of BCCA over some existing biclustering algorithms., Availability: The software for BCCA has been developed using C and Visual Basic languages, and can be executed on the Microsoft Windows platforms. The software may be downloaded as a zip file from http://www.isical.ac.in/ approximately rajat. Then it needs to be installed. Two word files (included in the zip file) need to be consulted before installation and execution of the software., Contact: rajat@isical.ac.in, Supplementary Information: Supplementary data are available at Bioinformatics online.