default search action
Niranjan Nagarajan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j16]Josip Maric, Kresimir Krizanovic, Sylvain Riondet, Niranjan Nagarajan, Mile Sikic:
Comparative analysis of metagenomic classifiers for long-read sequencing datasets. BMC Bioinform. 25(1): 15 (2024) - [j15]Rafael Peres da Silva
, Chayaporn Suphavilai, Niranjan Nagarajan:
MetageNN: a memory-efficient neural network taxonomic classifier robust to sequencing errors and missing genomes. BMC Bioinform. 25(1): 153 (2024) - 2023
- [j14]Hatairat Yingtaweesittikul
CREAMMIST: an integrative probabilistic database for cancer drug response prediction. Nucleic Acids Res. 51(D1): 1242-1248 (2023) - 2021
- [j13]Rafael Peres da Silva, Chayaporn Suphavilai, Niranjan Nagarajan
TUGDA: task uncertainty guided domain adaptation for robust generalization of cancer drug response prediction from in vitro to in vivo settings. Bioinform. 37(Supplement): 76-83 (2021) - [j12]Chenhao Li
BEEM-Static: Accurate inference of ecological interactions from cross-sectional microbiome data. PLoS Comput. Biol. 17(9) (2021) - [c9]Rafael Peres da Silva, Chayaporn Suphavilai, Niranjan Nagarajan:
Task Uncertainty Loss Reduce Negative Transfer in Asymmetric Multi-task Feature Learning (Student Abstract). AAAI 2021: 15867-15868 - 2020
- [i1]Rafael Peres da Silva, Chayaporn Suphavilai, Niranjan Nagarajan:
Task Uncertainty Loss Reduce Negative Transfer in Asymmetric Multi-task Feature Learning. CoRR abs/2012.09575 (2020)
2010 – 2019
- 2018
- [j11]Chayaporn Suphavilai, Denis Bertrand, Niranjan Nagarajan
Predicting Cancer Drug Response using a Recommender System. Bioinform. 34(22): 3907-3914 (2018) - 2016
- [j10]Kun Ming Kenneth Lim, Chenhao Li
@MInter: automated text-mining of microbial interactions. Bioinform. 32(19): 2981-2987 (2016) - 2012
- [c8]Song Gao, Denis Bertrand, Niranjan Nagarajan
FinIS: Improved in silico Finishing Using an Exact Quadratic Programming Formulation. WABI 2012: 314-325 - 2011
- [j9]Song Gao, Wing-Kin Sung
Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences. J. Comput. Biol. 18(11): 1681-1691 (2011) - [c7]Song Gao, Niranjan Nagarajan
Opera: Reconstructing Optimal Genomic Scaffolds with High-Throughput Paired-End Sequences. RECOMB 2011: 437-451 - 2010
- [j8]James Robert White, Saket Navlakha, Niranjan Nagarajan
Alignment and clustering of phylogenetic markers - implications for microbial diversity studies. BMC Bioinform. 11: 152 (2010) - [j7]Saket Navlakha, James Robert White, Niranjan Nagarajan
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information. J. Comput. Biol. 17(3): 503-516 (2010)
2000 – 2009
- 2009
- [j6]Niranjan Nagarajan
Reliability and efficiency of algorithms for computing the significance of the Mann-Whitney test. Comput. Stat. 24(4): 605 (2009) - [j5]Niranjan Nagarajan
Parametric Complexity of Sequence Assembly: Theory and Applications to Next Generation Sequencing. J. Comput. Biol. 16(7): 897-908 (2009) - [j4]James Robert White, Niranjan Nagarajan
Statistical Methods for Detecting Differentially Abundant Features in Clinical Metagenomic Samples. PLoS Comput. Biol. 5(4) (2009) - [c6]Saket Navlakha, James Robert White, Niranjan Nagarajan
Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information. RECOMB 2009: 400-417 - 2008
- [j3]Niranjan Nagarajan
FAST: Fourier transform based algorithms for significance testing of ungapped multiple alignments. Bioinform. 24(4): 577-578 (2008) - [j2]Niranjan Nagarajan
Scaffolding and validation of bacterial genome assemblies using optical restriction maps. Bioinform. 24(10): 1229-1235 (2008) - [c5]Niranjan Nagarajan
Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques. BIBM 2008: 223-230 - 2007
- [b1]Niranjan Nagarajan:
Statistical Techniques for Biological Motif Discovery. Cornell University, USA, 2007 - 2006
- [c4]Patrick Ng, Niranjan Nagarajan
Apples to apples: improving the performance of motif finders and their significance analysis in the Twilight Zone. ISMB (Supplement of Bioinformatics) 2006: 393-401 - 2005
- [c3]Niranjan Nagarajan
Computing the P-value of the information content from an alignment of multiple sequences. ISMB (Supplement of Bioinformatics) 2005: 311-318 - 2004
- [j1]Niranjan Nagarajan
Automatic prediction of protein domains from sequence information using a hybrid learning system. Bioinform. 20(9): 1335-1360 (2004) - [c2]Uri Keich, Niranjan Nagarajan
A Faster Reliable Algorithm to Estimate the p-Value of the Multinomial llr Statistic. WABI 2004: 111-122 - 2003
- [c1]Niranjan Nagarajan
A multi-expert system for the automatic detection of protein domains from sequence information. RECOMB 2003: 224-234
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: