Biomedical subjects

Vanathi Gopalakrishnan

Publications and source records attributed to Vanathi Gopalakrishnan.

5 recordsLinked to original sources

PubMed2006

Protein fold recognition using segmentation conditional random fields (SCRFs).

Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e., segmentation conditional random fields (SCRFs), is proposed as an effective solution to this problem. In contrast to traditional graphical models, such as the hidden Markov model (HMM), SCRFs follow a discriminative approach. Therefore, it is flexible to include any features in the model, such as overlapping or long-range interaction features over the whole sequence. The model also employs a convex optimization function, which results in globally optimal solutions to the model parameters. On the other hand, the segmentation setting in SCRFs makes their graphical structures intuitively similar to the protein 3-D structures and more importantly provides a framework to model the long-range interactions between secondary structures directly. Our model is applied to predict the parallel beta-helix fold, an important fold in bacterial pathogenesis and carbohydrate binding/cleavage. The cross-family validation shows that SCRFs not only can score all known beta-helices higher than non-beta-helices in the Protein Data Bank (PDB), but also accurately locates rungs in known beta-helix proteins. Our method outperforms BetaWrap, a state-of-the-art algorithm for predicting beta-helix folds, and HMMER, a general motif detection algorithm based on HMM, and has the additional advantage of general application to other protein folds. Applying our prediction model to the Uniprot Database, we identify previously unknown potential beta-helices.

Algorithms↗

PubMed2005

Proteomic profiling of cerebrospinal fluid identifies biomarkers for amyotrophic lateral sclerosis.

Amyotrophic lateral sclerosis (ALS) is characterized by degeneration of motor neurons. We tested the hypothesis that proteomic analysis will identify protein biomarkers that provide insight into disease pathogenesis and are diagnostically useful. To identify ALS specific biomarkers, we compared the proteomic profile of cerebrospinal fluid (CSF) from ALS and control subjects using surface-enhanced laser desorption/ionization-time of flight mass spectrometry (SELDI-TOF-MS). We identified 30 mass ion peaks with statistically significant (p < 0.01) differences between control and ALS subjects. Initial analysis with a rule-learning algorithm yielded biomarker panels with diagnostic predictive value as subsequently assessed using an independent set of coded test subjects. Three biomarkers were identified that are either decreased (transthyretin, cystatin C) or increased (carboxy-terminal fragment of neuroendocrine protein 7B2) in ALS CSF. We validated the SELDI-TOF-MS results for transthyretin and cystatin C by immunoblot and immunohistochemistry using commercially available antibodies. These findings identify a panel of CSF protein biomarkers for ALS.

Adult↗

PubMed2004

Machine-learning techniques for macromolecular crystallization data.

Systematizing belief systems regarding macromolecular crystallization has two major advantages: automation and clarification. In this paper, methodologies are presented for systematizing and representing knowledge about the chemical and physical properties of additives used in crystallization experiments. A novel autonomous discovery program is introduced as a method to prune rule-based models produced from crystallization data augmented with such knowledge. Computational experiments indicate that such a system can retain and present informative rules pertaining to protein crystallization that warrant further confirmation via experimental techniques.

Algorithms↗

PubMed2004

Automatic annotation of protein motif function with Gene Ontology terms.

BACKGROUND: Conserved protein sequence motifs are short stretches of amino acid sequence patterns that potentially encode the function of proteins. Several sequence pattern searching algorithms and programs exist foridentifying candidate protein motifs at the whole genome level. However, a much needed and important task is to determine the functions of the newly identified protein motifs. The Gene Ontology (GO) project is an endeavor to annotate the function of genes or protein sequences with terms from a dynamic, controlled vocabulary and these annotations serve well as a knowledge base. RESULTS: This paper presents methods to mine the GO knowledge base and use the association between the GO terms assigned to a sequence and the motifs matched by the same sequence as evidence for predicting the functions of novel protein motifs automatically. The task of assigning GO terms to protein motifs is viewed as both a binary classification and information retrieval problem, where PROSITE motifs are used as samples for mode training and functional prediction. The mutual information of a motif and aGO term association is found to be a very useful feature. We take advantage of the known motifs to train a logistic regression classifier, which allows us to combine mutual information with other frequency-based features and obtain a probability of correct association. The trained logistic regression model has intuitively meaningful and logically plausible parameter values, and performs very well empirically according to our evaluation criteria. CONCLUSIONS: In this research, different methods for automatic annotation of protein motifs have been investigated. Empirical result demonstrated that the methods have a great potential for detecting and augmenting information about the functions of newly discovered candidate protein motifs.

Amino Acid Motifs↗

PubMed2004

Comparison of probabilistic combination methods for protein secondary structure prediction.

MOTIVATION: Protein secondary structure prediction is an important step towards understanding how proteins fold in three dimensions. Recent analysis by information theory indicates that the correlation between neighboring secondary structures are much stronger than that of neighboring amino acids. In this article, we focus on the combination problem for sequences, i.e. combining the scores or assignments from single or multiple prediction systems under the constraint of a whole sequence, as a target for improvement in protein secondary structure prediction. RESULTS: We apply several graphical chain models to solve the combination problem and show that they are consistently more effective than the traditional window-based methods. In particular, conditional random fields (CRFs) moderately improve the predictions for helices and, more importantly, for beta sheets, which are the major bottleneck for protein secondary structure prediction.

Algorithms↗