PubMed Health⌕ Search

Biomedical subjects

Mona Singh

Publications and source records attributed to Mona Singh.

14 recordsLinked to original sources

Fast, accurate construction of multiple sequence alignments from protein language embeddings.

Multiple sequence alignment (MSA) is a foundational task in computational biology, underpinning protein structure prediction, evolutionary analysis, and domain annotation. Traditional MSA algorithms rely on pairwise amino acid substitution matrices derived from conserved protein families. While effective for aligning closely related sequences, these scoring schemes struggle in the low-identity "twilight zone." Here, we present a new approach for constructing MSAs leveraging amino acid embeddings generated by protein language models (PLMs), which capture rich evolutionary and contextual information from massive and diverse sequence datasets. We introduce a windowed reciprocal-weighted embedding similarity metric that is surprisingly effective in identifying corresponding amino acids across sequences. Building on this metric, we develop ARIES (Alignment via RecIprocal Embedding Similarity), an algorithm that constructs a PLM-generated template embedding and aligns each sequence to this template via dynamic time warping in order to build a global MSA. Across diverse benchmark datasets, ARIES achieves higher accuracies than existing state-of-the-art approaches, especially in low-identity regimes where traditional methods degrade, while scaling almost linearly with the number of sequences to be aligned. Together, these results provide the first large-scale demonstration of the power of PLMs for accurate and scalable MSA construction across protein families of varying sizes and levels of similarity, highlighting the potential of PLMs to transform comparative sequence analysis.

Deep Learning↗

Locality-aware pooling enhances protein language model performance across varied applications.

MOTIVATION: Protein language models (PLMs) are amongst the most exciting recent advances for characterizing protein sequences, and have enabled a diverse set of applications, including structure determination, functional property prediction, and mutation impact assessment, all from single protein sequences alone. State-of-the-art PLMs leverage transformer architectures originally developed for natural language processing, and are pre-trained on large protein databases to generate contextualized representations of individual amino acids. To harness the power of these PLMs to predict protein-level properties, these per-residue embeddings are typically "pooled" to fixed-size vectors that are further utilized in downstream prediction networks. Common pooling strategies include Cls-Pooling and Avg-Pooling, but neither of these approaches can capture the local substructures and long-range interactions observed in proteins. RESULTS: We propose the use of attention pooling, which can naturally capture these important features of proteins. To make the expensive attention operator (quadratic in the length of the input protein) feasible in practice, we introduce bag-of-mer pooling, or BoM-Pooling, a locality-aware hierarchical pooling technique that combines windowed average pooling with attention pooling. We empirically demonstrate that both full attention pooling and BoM-Pooling outperform previous pooling strategies on three important, diverse tasks: (i) predicting the activities of two proteins as they are varied; (ii) detecting remote homologs; and (iii) predicting signaling protein interactions with peptides. Overall, our work highlights the advantages of biologically inspired pooling techniques in protein sequence modeling and is a step toward more effective adaptations of language models in biological settings. AVAILABILITY AND IMPLEMENTATION: https://github.com/Singh-Lab/bom-pooling.

Natural Language Processing↗

KINAID: an orthology-based kinase-substrate prediction and analysis tool for phosphoproteomics.

SUMMARY: Proteome-wide datasets of phosphorylated peptides, either measured in a condition of interest or in response to perturbations, are increasingly becoming available for model organisms across the evolutionary spectrum. We introduce KINAID (KINase Activity and Inference Dashboard), an interactive and extensible tool written in Dash/Plotly, that predicts kinase-substrate interactions, uncovers and displays kinases whose substrates are enriched amongst phosphorylated peptides, interactively illustrates kinase-substrate interactions, and clusters phosphopeptides targeted by similar kinases. KINAID is the first tool of its kind that can analyze data from not only Homo sapiens but also 10 additional model organisms (including Mus musculus, Danio rerio, Drosophila melanogaster, Caenorhabditis elegans, and Saccharomyces cerevisiae). We demonstrate KINAID's utility by applying it to recently published S. cerevisiae phosphoproteomics data. AVAILABILITY AND IMPLEMENTATION: Webserver is available at https://kinaid.princeton.edu; open-source python library is available at https://github.com/Singh-Lab/kinaid; archive is available at https://doi.org/10.24433/CO.8460107.v1.

Proteomics↗

A combinatorial optimization approach for diverse motif finding applications.

BACKGROUND: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most frequently, motif finding applications arise when identifying shared regulatory signals within DNA sequences or shared functional and structural elements within protein sequences. Due to the diversity of contexts in which motif finding is applied, several variations of the problem are commonly studied. RESULTS: We introduce a versatile combinatorial optimization framework for motif finding that couples graph pruning techniques with a novel integer linear programming formulation. Our approach is flexible and robust enough to model several variants of the motif finding problem, including those incorporating substitution matrices and phylogenetic distances. Additionally, we give an approach for determining statistical significance of uncovered motifs. In testing on numerous DNA and protein datasets, we demonstrate that our approach typically identifies statistically significant motifs corresponding to either known motifs or other motifs of high conservation. Moreover, in most cases, our approach finds provably optimal solutions to the underlying optimization problem. CONCLUSION: Our results demonstrate that a combined graph theoretic and mathematical programming approach can be the basis for effective and powerful techniques for diverse motif finding applications.

Journal Article↗

Believing is seeing: how rumors can engender false memories in preschoolers.

This study examined how an erroneous rumor circulated among preschoolers can influence their memory. One fourth of the children overheard a rumor from an adult conversation in which it was alleged that an event the children had not experienced themselves had occurred. A second fourth were the classmates of those who overheard the rumor. A third group had no exposure to the rumor. The remaining children actually experienced the event suggested by the rumor. One week later, the children were interviewed in either a neutral or a suggestive manner. Results from a second interview after a 2-week delay revealed that under both interview conditions, children who overheard the rumor, either from the adult conversation or during naturally occurring interactions with classmates, were as likely to report experiencing the rumored but nonexperienced event as were those who actually experienced it. Most reports of the rumored but nonexperienced event were in children's free recall and were accompanied by high levels of fictitious elaboration.

Child Behavior↗

Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps.

MOTIVATION: Determining protein function is one of the most important problems in the post-genomic era. For the typical proteome, there are no functional annotations for one-third or more of its proteins. Recent high-throughput experiments have determined proteome-scale protein physical interaction maps for several organisms. These physical interactions are complemented by an abundance of data about other types of functional relationships between proteins, including genetic interactions, knowledge about co-expression and shared evolutionary history. Taken together, these pairwise linkages can be used to build whole-proteome protein interaction maps. RESULTS: We develop a network-flow based algorithm, FunctionalFlow, that exploits the underlying structure of protein interaction maps in order to predict protein function. In cross-validation testing on the yeast proteome, we show that FunctionalFlow has improved performance over previous methods in predicting the function of proteins with few (or no) annotated protein neighbors. By comparing several methods that use protein interaction maps to predict protein function, we demonstrate that FunctionalFlow performs well because it takes advantage of both network topology and some measure of locality. Finally, we show that performance can be improved substantially as we consider multiple data sources and use them to create weighted interaction networks. AVAILABILITY: http://compbio.cs.princeton.edu/function

Algorithms↗

Modulatory effects of different doses of alpha-tocopherol on benzo(a)pyrene-DNA adduct formation in the pulmonary tissue of cigarette smoke inhaling mice.

Cigarette smoke (CS) has been established as one of the major risk factors for many pathologies including lung cancer in humans and experimental animals. In view of the discrepancy about the role of alpha-tocopherol (AT) in carcinogenesis, the present study was designed to investigate the effects of different doses of AT on benzo(a)pyrene-DNA [B(a)P-DNA] adduct formation in lungs of CS inhaling mice. Extent of carcinogen-DNA adduct formation has been considered as an index for carcinogenesis. Feeding of 35 IU AT/kg body weight increased B(a)P-DNA adducts formation significantly whereas feeding of 5 IU AT/kg body weight did not altered much the B(a)P-DNA adduct levels when both were compared to the control counterparts. With CS inhalation, the B(a)P-DNA adducts formation increased in all the groups when compared to their respective sham counterparts. Interestingly, in CS exposed groups, there was least increase in B(a)P-DNA adducts formation in 5 IU AT/kg fed animals followed by the control and 35 IU AT/kg body weight fed groups respectively. The results suggest that higher doses of AT accentuate DNA adduct formation in CS inhaling mice.

Animals↗

Solving and analyzing side-chain positioning problems using linear and integer programming.

MOTIVATION: Side-chain positioning is a central component of homology modeling and protein design. In a common formulation of the problem, the backbone is fixed, side-chain conformations come from a rotamer library, and a pairwise energy function is optimized. It is NP-complete to find even a reasonable approximate solution to this problem. We seek to put this hardness result into practical context. RESULTS: We present an integer linear programming (ILP) formulation of side-chain positioning that allows us to tackle large problem sizes. We relax the integrality constraint to give a polynomial-time linear programming (LP) heuristic. We apply LP to position side chains on native and homologous backbones and to choose side chains for protein design. Surprisingly, when positioning side chains on native and homologous backbones, optimal solutions using a simple, biologically relevant energy function can usually be found using LP. On the other hand, the design problem often cannot be solved using LP directly; however, optimal solutions for large instances can still be found using the computationally more expensive ILP procedure. While different energy functions also affect the difficulty of the problem, the LP/ILP approach is able to find optimal solutions. Our analysis is the first large-scale demonstration that LP-based approaches are highly effective in finding optimal (and successive near-optimal) solutions for the side-chain positioning problem.

Algorithms↗

Comparative analysis of methods for representing and searching for transcription factor binding sites.

MOTIVATION: An important step in unravelling the transcriptional regulatory network of an organism is to identify, for each transcription factor, all of its DNA binding sites. Several approaches are commonly used in searching for a transcription factor's binding sites, including consensus sequences and position-specific scoring matrices. In addition, methods that compute the average number of nucleotide matches between a putative site and all known sites can be employed. Such basic approaches can all be naturally extended by incorporating pairwise nucleotide dependencies and per-position information content. In this paper, we evaluate the effectiveness of these basic approaches and their extensions in finding binding sites for a transcription factor of interest without erroneously identifying other genomic sequences. RESULTS: In cross-validation testing on a dataset of Escherichia coli transcription factors and their binding sites, we show that there are statistically significant differences in how well various methods identify transcription factor binding sites. The use of per-position information content improves the performance of all basic approaches. Furthermore, including local pairwise nucleotide dependencies within binding site models results in statistically significant performance improvements for approaches based on nucleotide matches. Based on our analysis, the best results when searching for DNA binding sites of a particular transcription factor are obtained by methods that incorporate both information content and local pairwise correlations. AVAILABILITY: The software is available at http://compbio.cs.princeton.edu/bindsites.

Algorithms↗

Predicting specificity in bZIP coiled-coil protein interactions.

We present a method for predicting protein-protein interactions mediated by the coiled-coil motif. When tested on interactions between nearly all human and yeast bZIP proteins, our method identifies 70% of strong interactions while maintaining that 92% of predictions are correct. Furthermore, cross-validation testing shows that including the bZIP experimental data significantly improves performance. Our method can be used to predict bZIP interactions in other genomes and is a promising approach for predicting coiled-coil interactions more generally.

Amino Acid Motifs↗

A cross-genomic approach for systematic mapping of phenotypic traits to genes.

We present a computational method for de novo identification of gene function using only cross-organismal distribution of phenotypic traits. Our approach assumes that proteins necessary for a set of phenotypic traits are preferentially conserved among organisms that share those traits. This method combines organism-to-phenotype associations,along with phylogenetic profiles,to identify proteins that have high propensities for the query phenotype; it does not require the use of any functional annotations for any proteins. We first present the statistical foundations of this approach and then apply it to a range of phenotypes to assess how its performance depends on the frequency and specificity of the phenotype. Our analysis shows that statistically significant associations are possible as long as the phenotype is neither extremely rare nor extremely common; results on the flagella,pili, thermophily,and respiratory tract tropism phenotypes suggest that reliable associations can be inferred when the phenotype does not arise from many alternate mechanisms.

Bacterial Proteins↗

Endogenous neurotrophic factors enhance neurite growth by bag cell neurons of Aplysia.

Mechanisms that regulate neurite outgrowth are phylogenetically conserved, including the signaling molecules involved. Here, we describe neurotrophic effects on isolated bag cell neurons (BCNs) of substrate-bound growth factors endogenous to the sea slug Aplysia californica. Sheath cells dissociated from the pleural-visceral connectives of the Aplysia CNS and arterial cells dissociated from the anterior aorta enhance neurite outgrowth when compared to controls, i.e., BCNs grown in defined medium alone. In addition, the substrate remaining after sheath cells or arterial cells are killed significantly enhances growth, relative to all other conditions tested. For instance, primary neurites are more numerous and greater in length for BCNs cultured on substrate produced by arterial cells. These results suggest that sheath and arterial cells produce growth-promoting factors, some of which are found in the substrates produced by these cell types. Using matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF MS), we found that Aplysia collagen-like peptides are produced by dissociated arterial cells, and therefore likely contribute to the observed growth effects. Collagen-like peptides and other factors produced by sheath and arterial cells likely influence neurite growth in the Aplysia CNS during development, learning and memory, and regeneration after injury.

Animals↗

Type IV pilin structure and assembly: X-ray and EM analyses of Vibrio cholerae toxin-coregulated pilus and Pseudomonas aeruginosa PAK pilin.

Pilin assembly into type IV pili is required for virulence by bacterial pathogens that cause diseases such as cholera, pneumonia, gonorrhea, and meningitis. Crystal structures of soluble, N-terminally truncated pilin from Vibrio cholera toxin-coregulated pilus (TCP) and full-length PAK pilin from Pseudomonas aeruginosa reveal a novel TCP fold, yet a shared architecture for the type IV pilins. In each pilin subunit a conserved, extended, N-terminal alpha helix wrapped by beta strands anchors the structurally variable globular head. Inside the assembled pilus, characterized by cryo-electron microscopy and crystallography, the extended hydrophobic alpha helices make multisubunit contacts to provide mechanical strength and flexibility. Outside, distinct interactions of adaptable heads contribute surface variation for specificity of pilus function in antigenicity, motility, adhesion, and colony formation.

Amino Acid Sequence↗

Evolution of amino acid frequencies in proteins over deep time: inferred order of introduction of amino acids into the genetic code.

To understand more fully how amino acid composition of proteins has changed over the course of evolution, a method has been developed for estimating the composition of proteins in an ancestral genome. Estimates are based upon the composition of conserved residues in descendant sequences and empirical knowledge of the relative probability of conservation of various amino acids. Simulations are used to model and correct for errors in the estimates. The method was used to infer the amino acid composition of a large protein set in the Last Universal Ancestor (LUA) of all extant species. Relative to the modern protein set, LUA proteins were found to be generally richer in those amino acids that are believed to have been most abundant in the prebiotic environment and poorer in those amino acids that are believed to have been unavailable or scarce. It is proposed that the inferred amino acid composition of proteins in the LUA probably reflects historical events in the establishment of the genetic code.

Amino Acid Sequence↗