Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nicholas Bhattacharya

dblp:243/3147 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0003-1697-7177ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Artificial intelligence
1 paper
Representation and self-supervised learning · 56% Learning paradigms · 44%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
multiple sequence alignment
0.712023
End-to-end learning of multiple sequence alignments with differentiable Smith-Waterman · Bioinform. 2023
Bioinformatics and computational biology
sequence alignment
0.712023
End-to-end learning of multiple sequence alignments with differentiable Smith-Waterman · Bioinform. 2023
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
self-supervised representation learning
0.412019
Evaluating Protein Transfer Learning with TAPE · NeurIPS 2019
Machine learning › Learning paradigms
semi-supervised learning
0.412019
Evaluating Protein Transfer Learning with TAPE · NeurIPS 2019
Bioinformatics and computational biology › structural bioinformatics
protein modeling
0.412019
Evaluating Protein Transfer Learning with TAPE · NeurIPS 2019
Bioinformatics and computational biology › protein analysis › protein bioinformatics
protein representation learning
0.412019
Evaluating Protein Transfer Learning with TAPE · NeurIPS 2019
Bioinformatics and computational biology
protein structure prediction
0.212023
End-to-end learning of multiple sequence alignments with differentiable Smith-Waterman · Bioinform. 2023

Methods — techniques the papers use, named apart from their topics

sequence learning · 0.8self-supervised pretraining · 0.8markov random field · 0.7differentiable smith-waterman · 0.7contrastive learning · 0.7
YearPublicationVenuePosition
2023 End-to-end learning of multiple sequence alignments with differentiable Smith-Waterman
abstract
MOTIVATION: Multiple sequence alignments (MSAs) of homologous sequences contain information on structural and functional constraints and their evolutionary histories. Despite their importance for many downstream tasks, such as structure prediction, MSA generation is often treated as a separate pre-processing step, without any guidance from the application it will be used for. RESULTS: Here, we implement a smooth and differentiable version of the Smith-Waterman pairwise alignment algorithm that enables jointly learning an MSA and a downstream machine learning system in an end-to-end fashion. To demonstrate its utility, we introduce SMURF (Smooth Markov Unaligned Random Field), a new method that jointly learns an alignment and the parameters of a Markov Random Field for unsupervised contact prediction. We find that SMURF learns MSAs that mildly improve contact prediction on a diverse set of protein and RNA families. As a proof of concept, we demonstrate that by connecting our differentiable alignment module to AlphaFold2 and maximizing predicted confidence, we can learn MSAs that improve structure predictions over the initial MSAs. Interestingly, the alignments that improve AlphaFold predictions are self-inconsistent and can be viewed as adversarial. This work highlights the potential of differentiable dynamic programming to improve neural network pipelines that rely on an alignment and the potential dangers of optimizing predictions of protein sequences with methods that are not fully understood. AVAILABILITY AND IMPLEMENTATION: Our code and examples are available at: https://github.com/spetti/SMURF. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Samantha Petti, Nicholas Bhattacharya, Roshan Rao, Justas Dauparas, Juannan Zhou, Alexander M. Rush, Peter K. Koo, Sergey Ovchinnikov 0001
Bioinform.2
2023 Deep self-supervised learning for biosynthetic gene cluster detection and product classification
abstract
Natural products are chemical compounds that form the basis of many therapeutics used in the pharmaceutical industry. In microbes, natural products are synthesized by groups of colocalized genes called biosynthetic gene clusters (BGCs). With advances in high-throughput sequencing, there has been an increase of complete microbial isolate genomes and metagenomes, from which a vast number of BGCs are undiscovered. Here, we introduce a self-supervised learning approach designed to identify and characterize BGCs from such data. To do this, we represent BGCs as chains of functional protein domains and train a masked language model on these domains. We assess the ability of our approach to detect BGCs and characterize BGC properties in bacterial genomes. We also demonstrate that our model can learn meaningful representations of BGCs and their constituent domains, detect BGCs in microbial genomes, and predict BGC product classes. These results highlight self-supervised neural networks as a promising framework for improving BGC prediction and classification.
Carolina Rios-Martinez, Nicholas Bhattacharya, Ava P. Amini, Lorin Crawford, Kevin K. Yang
PLoS Comput. Biol.2
2019 Evaluating Protein Transfer Learning with TAPE
abstract
Protein modeling is an increasingly popular area of machine learning research. Semi-supervised learning has emerged as an important paradigm in protein modeling due to the high cost of acquiring supervised protein labels, but the current literature is fragmented when it comes to datasets and standardized evaluation techniques. To facilitate progress in this field, we introduce the Tasks Assessing Protein Embeddings (TAPE), a set of five biologically relevant semi-supervised learning tasks spread across different domains of protein biology. We curate tasks into specific training, validation, and test splits to ensure that each task tests biologically relevant generalization that transfers to real-life scenarios. We benchmark a range of approaches to semi-supervised protein representation learning, which span recent work as well as canonical sequence learning techniques. We find that self-supervised pretraining is helpful for almost all models on all tasks, more than doubling performance in some cases. Despite this increase, in several cases features learned by self-supervised pretraining still lag behind features extracted by state-of-the-art non-neural techniques. This gap in performance suggests a huge opportunity for innovative architecture design and improved modeling paradigms that better capture the signal in biological sequences. TAPE will help the machine learning community focus effort on scientifically relevant problems. Toward this end, all data and code used to run these experiments is available at https://github.com/songlab-cal/tape
Roshan Rao, Nicholas Bhattacharya, Yan Duan, Xi Chen 0022, John F. Canny, Pieter Abbeel, Yun S. Song
NeurIPS2