activity
20052025
most citedKmerlight: fast and accurate k-mer abundance estimation

11 citations · 32 across the 20 of their papers we have counts for

collaborators

22 papers

eess.IV2025

MIDOG 2025 Track 2: A Deep Learning Model for Classification of Atypical and Normal Mitotic Figures under Class and Hardness Imbalances

Sujatha Kotte, Vangala Govindakrishnan Saipradeep, Vidushi Walia +4

Motivation: Accurate classification of mitotic figures into normal and atypical types is crucial for tumor prognostication in digital pathology. However, developing robust deep lea…

cs.DL2022★ 3 cited

Multi-label classification for biomedical literature: an overview of the BioCreative VII LitCovid Track for COVID-19 literature topic annotations

Qingyu Chen, Alexis Allot, Robert Leaman +35

The COVID-19 pandemic has been severely impacting global society since December 2019. Massive research has been undertaken to understand the characteristics of the virus and design…

cs.LG2021

Adiabatic Quantum Feature Selection for Sparse Linear Regression

Surya Sai Teja Desu, P. K. Srijith, M. V. Panduranga Rao +1

Linear regression is a popular machine learning approach to learn and predict real valued outputs or dependent variables from independent variables or features. In many real world…

cs.DS2016★ 11 cited

Kmerlight: fast and accurate k-mer abundance estimation

Naveen Sivadasan, Rajgopal Srinivasan, Kshama Goyal

k-mers (nucleotide strings of length k) form the basis of several algorithms in computational genomics. In particular, k-mer abundance information in sequence data is useful in rea…

cs.SI2015★ 2 cited

Subgraph Similarity Search in Large Graphs

Kanigalpula Samanvi, Naveen Sivadasan

One of the major challenges in applications related to social networks, computational biology, collaboration networks etc., is to efficiently search for similar patterns in their u…

cs.DS2015

Parameterized Lower Bounds and Dichotomy Results for the NP-completeness of -free Edge Modification Problems

N. R. Aravind, R. B. Sandeep, Naveen Sivadasan

For a graph , the -free Edge Deletion problem asks whether there exist at most edges whose deletion from the input graph results in a graph without any induced copy o…