Anish Man Singh Shrestha

Anish Man Singh Shrestha

Auto-generated profile, based on publicly available information

Anish Man Singh Shrestha

De La Salle University Manila

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2010 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
ASAnish Man Singh Shrestha
Anish Man Singh Shrestha
STSatoshi Tayu
Satoshi Tayu
SUShuichi Ueno
Shuichi Ueno

10 January 2014 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PDF file
ASAnish Man Singh Shrestha
Anish Man Singh Shrestha
MFMartin C. Frith
Martin C. Frith
PHPaul Horton
Paul Horton
The suffix array and its variants are text-indexing data structures that have become indispensable in the field of bioinformatics. With the uninitiated in mind, we provide an accessible exposition of the SA-IS algorithm, which is the state of the art in suffix array construction. We also describe DisLex, a technique that allows standard suffix array construction algorithms to create modified suffix arrays designed to enable a simple form of inexact matching needed to support ‘spaced seeds’ and ‘subset seeds’ used in many biological applications.

24 July 2023 in PLOS ONE
Verified
Journal Article
Open access
PDF file
MGMark Edward M. Gonzales
Mark Edward M. Gonzales
JUJennifer C. Ureta
Jennifer C. Ureta
ASAnish M. S. Shrestha
Anish M. S. Shrestha
With the growing interest in using phages to combat antimicrobial resistance, computational methods for predicting phage-host interactions have been explored to help shortlist candidate phages. Most existing models consider entire proteomes and rely on manual feature engineering, which poses difficulty in selecting the most informative sequence properties to serve as input to the model. In this paper, we framed phage-host interaction prediction as a multiclass classification problem that takes as input the embeddings of a phage’s receptor-binding proteins, which are known to be the key machinery for host recognition, and predicts the host genus. We explored different protein language models to automatically encode these protein sequences into dense embeddings without the need for additional alignment or structural information. We show that the use of embeddings of receptor-binding proteins presents improvements over handcrafted genomic and protein sequence features. The highest performance was obtained using the transformer-based protein language model ProtT5, resulting in a 3% to 4% increase in weighted F1 and recall scores across different prediction confidence thresholds, compared to using selected handcrafted sequence features.

26 December 2024 in Bioinformatics
Verified
Journal Article
Open access
MGMark Edward M Gonzales
Mark Edward M Gonzales
JUJennifer C Ureta
Jennifer C Ureta
ASAnish M S Shrestha
Anish M S Shrestha
Motivation: Recent computational approaches for predicting phage–host interaction have explored the use of sequence-only protein language models to produce embeddings of phage proteins without manual feature engineering. However, these embeddings do not directly capture protein structure information and structure-informed signals related to host specificity. Results: We present PHIStruct, a multilayer perceptron that takes in structure-aware embeddings of receptor-binding proteins, generated via the structure-aware protein language model SaProt, and then predicts the host from among the ESKAPEE genera. Compared against recent tools, PHIStruct exhibits the best balance of precision and recall, with the highest and most stable F1 score across a wide range of confidence thresholds and sequence similarity settings. The margin in performance is most pronounced when the sequence similarity between the training and test sets drops below 40%, wherein, at a relatively high-confidence threshold of above 50%, PHIStruct presents a 7%–9% increase in class-averaged F1 over machine learning tools that do not directly incorporate structure information, as well as a 5%–6% increase over BLASTp. Availability and implementation: The data and source code for our experiments and analyses are available at https://github.com/bioinfodlsu/PHIStruct.

14 February 2013 in Bioinformatics
Verified
Journal Article
Open access
PDF file
ASAnish Man Singh Shrestha
Anish Man Singh Shrestha
MFMartin C. Frith
Martin C. Frith
Summary: Many high-throughput sequencing experiments produce paired DNA reads. Paired-end DNA reads provide extra positional information that is useful in reliable mapping of short reads to a reference genome, as well as in downstream analyses of structural variations. Given the importance of paired-end alignments, it is surprising that there have been no previous publications focusing on this topic. In this article, we present a new probabilistic framework to predict the alignment of paired-end reads to a reference genome. Using both simulated and real data, we compare the performance of our method with six other read-mapping tools that provide a paired-end option. We show that our method provides a good combination of accuracy, error rate and computation time, especially in more challenging and practical cases, such as when the reference genome is incomplete or unavailable for the sample, or when there are large variations between the reference genome and the source of the reads. An open-source implementation of our method is available as part of Last, a multi-purpose alignment program freely available at http://last.cbrc.jp. Contact:martin@cbrc.jp Supplementary information: Supplementary data are available at Bioinformatics online.

1 January 2011 in IEICE Transactions on Information and Systems
Verified
Journal Article
Closed access
ASAnish Man Singh Shrestha
Anish Man Singh Shrestha
ATAsahi Takaoka
Asahi Takaoka
STSatoshi Tayu
Satoshi Tayu
SUShuichi Ueno
Shuichi Ueno