Sushmita Roy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Sushmita Roy has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Margaret Werner-Washburne
Department of Biology, University of New Mexico, Albuquerque, NM 87131, USA
3 shared publications - Anthony D Aragon
Department of Biology, University of New Mexico, Albuquerque, NM 87131, USA
1 shared publication - Christopher P. Allen
Internal Medicine, Yale School of Medicine, New Haven, CT, United States
1 shared publication Diego Martinez
Diego Martinez, University of New Mexico, Albuquerque, New Mexico, United States of America
1 shared publication- Edward V. Thomas
Department of Independent Surveillance Assessment and Statistics, Sandia National Laboratories, Albuquerque, NM 87185-0829, USA
1 shared publication - Gabriel A Quiñones
Cancer Biology Program, Stanford University, Stanford, CA 94305, USA
1 shared publication
Latest Publications
- Open Access
- 20 November 2009
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 4 (11) , e7813
Exploiting Amino Acid Composition for Predicting Protein-Protein Interactions
Computational prediction of protein interactions typically use protein domains as classifier features because they capture conserved information of interaction surfaces. However, approaches relying on domains as features cannot be applied to proteins without any domain information. In this paper, we explore the contribution of pure amino acid composition (AAC) for protein interaction prediction. This simple feature, which is based on normalized counts of single or pairs of amino acids, is applicable to proteins from any sequenced organism and can be used to compensate for the lack of domain information. AAC performed at par with protein interaction prediction based on domains on three yeast protein interaction datasets. Similar behavior was obtained using different classifiers, indicating that our results are a function of features and not of classifiers. In addition to yeast datasets, AAC performed comparably on worm and fly datasets. Prediction of interactions for the entire yeast proteome identified a large number of novel interactions, the majority of which co-localized or participated in the same processes. Our high confidence interaction network included both well-studied and uncharacterized proteins. Proteins with known function were involved in actin assembly and cell budding. Uncharacterized proteins interacted with proteins involved in reproduction and cell budding, thus providing putative biological roles for the uncharacterized proteins. AAC is a simple, yet powerful feature for predicting protein interactions, and can be used alone or in conjunction with protein domains to predict new and validate existing interactions. More importantly, AAC alone performs at par with existing, but more complex, features indicating the presence of sequence-level information that is predictive of interaction, but which is not necessarily restricted to domains.
- 20 November 2009
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 4 (11) , e7813
Open AccessExploiting Amino Acid Composition for Predicting Protein-Protein Interactions
Computational prediction of protein interactions typically use protein domains as classifier features because they capture conserved information of interaction surfaces. However, approaches relying on domains as features cannot be applied to proteins without any domain information. In this paper, we explore the contribution of pure amino acid composition (AAC) for protein interaction prediction. This simple feature, which is based on normalized counts of single or pairs of amino acids, is applicable to proteins from any sequenced organism and can be used to compensate for the lack of domain information. AAC performed at par with protein interaction prediction based on domains on three yeast protein interaction datasets. Similar behavior was obtained using different classifiers, indicating that our results are a function of features and not of classifiers. In addition to yeast datasets, AAC performed comparably on worm and fly datasets. Prediction of interactions for the entire yeast proteome identified a large number of novel interactions, the majority of which co-localized or participated in the same processes. Our high confidence interaction network included both well-studied and uncharacterized proteins. Proteins with known function were involved in actin assembly and cell budding. Uncharacterized proteins interacted with proteins involved in reproduction and cell budding, thus providing putative biological roles for the uncharacterized proteins. AAC is a simple, yet powerful feature for predicting protein interactions, and can be used alone or in conjunction with protein domains to predict new and validate existing interactions. More importantly, AAC alone performs at par with existing, but more complex, features indicating the presence of sequence-level information that is predictive of interaction, but which is not necessarily restricted to domains.
- 14 September 2009
- Published by Institution of Engineering and Technology (IET) in IET Systems Biology
- Vol. 3 (5) , 404-413
Scalable learning of large networks
Cellular networks inferred from condition-specific microarray data can capture the functional rewiring of cells in response to different environmental conditions. Unfortunately, many algorithms for inferring cellular networks do not scale to whole-genome data with thousands of variables. We propose a novel approach for scalable learning of large networks: cluster and infer networks (CIN). CIN learns network structures in two steps: (a) partition variables into smaller clusters, and (b) learn networks per cluster. We optionally revisit the cluster assignment of variables with poor neighbourhoods. Results on networks with known topologies suggest that CIN has substantial speed benefits, without substantial performance loss. We applied our approach to microarray compendia of glucose-starved yeast cells. The inferred networks had significantly higher number of subgraphs representing meaningful biological dependencies than random graphs. Analysis of subgraphs identified biological processes that agreed well with existing information about yeast populations under glucose starvation, and also implicated novel pathways that were previously not known to be associated with these populations. [Includes supplementary material].
- 14 September 2009
- Published by Institution of Engineering and Technology (IET) in IET Systems Biology
- Vol. 3 (5) , 404-413
Scalable learning of large networks
Cellular networks inferred from condition-specific microarray data can capture the functional rewiring of cells in response to different environmental conditions. Unfortunately, many algorithms for inferring cellular networks do not scale to whole-genome data with thousands of variables. We propose a novel approach for scalable learning of large networks: cluster and infer networks (CIN). CIN learns network structures in two steps: (a) partition variables into smaller clusters, and (b) learn networks per cluster. We optionally revisit the cluster assignment of variables with poor neighbourhoods. Results on networks with known topologies suggest that CIN has substantial speed benefits, without substantial performance loss. We applied our approach to microarray compendia of glucose-starved yeast cells. The inferred networks had significantly higher number of subgraphs representing meaningful biological dependencies than random graphs. Analysis of subgraphs identified biological processes that agreed well with existing information about yeast populations under glucose starvation, and also implicated novel pathways that were previously not known to be associated with these populations. [Includes supplementary material].
- Open Access
- 14 June 2009
- Published by Association for Computing Machinery (ACM)
- Vol. 382, 905-912
Learning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the statistical dependency structure than directed graphical models. Unfortunately, structure learning of undirected graphs using likelihood-based scores remains difficult because of the intractability of computing the partition function. We describe a new Markov random field structure learning algorithm, motivated by canonical parameterization of Abbeel et al. We provide computational improvements on their parameterization by learning per-variable canonical factors, which makes our algorithm suitable for domains with hundreds of nodes. We compare our algorithm against several algorithms for learning undirected and directed models on simulated and real datasets from biology. Our algorithm frequently outperforms existing algorithms, producing higher-quality structures, suggesting that enforcing consistency during structure learning is beneficial for learning undirected graphs.
- 14 June 2009
- Published by Association for Computing Machinery (ACM)
- Vol. 382, 905-912
Open AccessLearning structurally consistent undirected probabilistic graphical models
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the statistical dependency structure than directed graphical models. Unfortunately, structure learning of undirected graphs using likelihood-based scores remains difficult because of the intractability of computing the partition function. We describe a new Markov random field structure learning algorithm, motivated by canonical parameterization of Abbeel et al. We provide computational improvements on their parameterization by learning per-variable canonical factors, which makes our algorithm suitable for domains with hundreds of nodes. We compare our algorithm against several algorithms for learning undirected and directed models on simulated and real datasets from biology. Our algorithm frequently outperforms existing algorithms, producing higher-quality structures, suggesting that enforcing consistency during structure learning is beneficial for learning undirected graphs.
- Open Access
- 13 July 2006
- Published by Springer Nature in BMC Bioinformatics
- Vol. 7 (1) , 343
Multivariate curve resolution of time course microarray data
Modeling of gene expression data from time course experiments often involves the use of linear models such as those obtained from principal component analysis (PCA), independent component analysis (ICA), or other methods. Such methods do not generally yield factors with a clear biological interpretation. Moreover, implicit assumptions about the measurement errors often limit the application of these methods to log-transformed data, destroying linear structure in the untransformed expression data. In this work, a method for the linear decomposition of gene expression data by multivariate curve resolution (MCR) is introduced. The MCR method is based on an alternating least-squares (ALS) algorithm implemented with a weighted least squares approach. The new method, MCR-WALS, extracts a small number of basis functions from untransformed microarray data using only non-negativity constraints. Measurement error information can be incorporated into the modeling process and missing data can be imputed. The utility of the method is demonstrated through its application to yeast cell cycle data. Profiles extracted by MCR-WALS exhibit a strong correlation with cell cycle-associated genes, but also suggest new insights into the regulation of those genes. The unique features of the MCR-WALS algorithm are its freedom from assumptions about the underlying linear model other than the non-negativity of gene expression, its ability to analyze non-log-transformed data, and its use of measurement error information to obtain a weighted model and accommodate missing measurements.
- 13 July 2006
- Published by Springer Nature in BMC Bioinformatics
- Vol. 7 (1) , 343
Open AccessMultivariate curve resolution of time course microarray data
Modeling of gene expression data from time course experiments often involves the use of linear models such as those obtained from principal component analysis (PCA), independent component analysis (ICA), or other methods. Such methods do not generally yield factors with a clear biological interpretation. Moreover, implicit assumptions about the measurement errors often limit the application of these methods to log-transformed data, destroying linear structure in the untransformed expression data. In this work, a method for the linear decomposition of gene expression data by multivariate curve resolution (MCR) is introduced. The MCR method is based on an alternating least-squares (ALS) algorithm implemented with a weighted least squares approach. The new method, MCR-WALS, extracts a small number of basis functions from untransformed microarray data using only non-negativity constraints. Measurement error information can be incorporated into the modeling process and missing data can be imputed. The utility of the method is demonstrated through its application to yeast cell cycle data. Profiles extracted by MCR-WALS exhibit a strong correlation with cell cycle-associated genes, but also suggest new insights into the regulation of those genes. The unique features of the MCR-WALS algorithm are its freedom from assumptions about the underlying linear model other than the non-negativity of gene expression, its ability to analyze non-log-transformed data, and its use of measurement error information to obtain a weighted model and accommodate missing measurements.
- Open Access
- 8 February 2006
- Published by Springer Nature in Genome Biology
- Vol. 7 (2) , R9
Release of extraction-resistant mRNA in stationary phase Saccharomyces cerevisiae produces a massive increase in transcript abundance in response to stress
Background: As carbon sources are exhausted, Saccharomyces cerevisiae cells exhibit reduced metabolic activity and cultures enter the stationary phase. We asked whether cells in stationary phase cultures respond to additional stress at the level of transcript abundance. Results: Microarrays were used to quantify changes in transcript abundance in cells from stationary phase cultures in response to stress. More than 800 mRNAs increased in abundance by one minute after oxidative stress. A significant number of these mRNAs encode proteins involved in stress responses. We tested whether mRNA increases were due to new transcription, rapid poly-adenylation of message (which would not be detected by microarrays), or potential release of mature mRNA present in the cell but resistant to extraction during RNA isolation. Examination of the response to oxidative stress in an RNA polymerase II mutant, rpb1-1, suggested that new transcription was not required. Quantitative RT-PCR analysis of a subset of these transcripts further suggested that the transcripts present in isolated total RNA from stationary phase cultures were polyadenylated. In contrast, over 2,000 transcripts increased after protease treatment of cell-free lysates from stationary phase but not exponentially growing cultures. Different subsets of transcripts were released by oxidative stress and temperature upshift, suggesting that mRNA release is stress-specific. Conclusions: Cells in stationary phase cultures contain a large number of extraction-resistant mRNAs in a protease-labile, rapidly releasable form. The transcript release appears to be stress-specific. We hypothesize that these transcripts are associated with P-bodies.
- 8 February 2006
- Published by Springer Nature in Genome Biology
- Vol. 7 (2) , R9
Open AccessRelease of extraction-resistant mRNA in stationary phase Saccharomyces cerevisiae produces a massive increase in transcript abundance in response to stress
Background: As carbon sources are exhausted, Saccharomyces cerevisiae cells exhibit reduced metabolic activity and cultures enter the stationary phase. We asked whether cells in stationary phase cultures respond to additional stress at the level of transcript abundance. Results: Microarrays were used to quantify changes in transcript abundance in cells from stationary phase cultures in response to stress. More than 800 mRNAs increased in abundance by one minute after oxidative stress. A significant number of these mRNAs encode proteins involved in stress responses. We tested whether mRNA increases were due to new transcription, rapid poly-adenylation of message (which would not be detected by microarrays), or potential release of mature mRNA present in the cell but resistant to extraction during RNA isolation. Examination of the response to oxidative stress in an RNA polymerase II mutant, rpb1-1, suggested that new transcription was not required. Quantitative RT-PCR analysis of a subset of these transcripts further suggested that the transcripts present in isolated total RNA from stationary phase cultures were polyadenylated. In contrast, over 2,000 transcripts increased after protease treatment of cell-free lysates from stationary phase but not exponentially growing cultures. Different subsets of transcripts were released by oxidative stress and temperature upshift, suggesting that mRNA release is stress-specific. Conclusions: Cells in stationary phase cultures contain a large number of extraction-resistant mRNAs in a protease-labile, rapidly releasable form. The transcript release appears to be stress-specific. We hypothesize that these transcripts are associated with P-bodies.