Arvind Gupta

Learn More
Recent biological discoveries have shown that clustering large datasets is essential for better understanding biology in many areas. Spectral clustering in particular has proven to be a powerful tool amenable for many applications. However, it cannot be directly applied to large datasets due to time and memory limitations. To address this issue, we have(More)
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If moreover each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H, the minimum cost homomorphism problem for H, denoted MinHOM(H), is the(More)
Complex intracellular signaling networks monitor diverse environmental inputs to evoke appropriate and coordinated effector responses. Defective signal transduction underlies many pathologies, including cancer, diabetes, autoimmunity and about 400 other human diseases. Therefore, there is high impetus to define the composition and architecture of cellular(More)
Monoubiquitination of H2BK123 (H2BK123ub), catalyzed by Rad6/Bre1, is a transient histone modification with roles in transcription and is essential for establishing H3K4 and H3K79 trimethylations (H3K4me3 and H3K79me3). Here, we investigated the chromatin network around H2BK123ub by examining its localization and co-occurrence with its dependent marks as(More)
The inverse protein folding problem is that of designing an amino acid sequence which has a particular native protein fold. This problem arises in drug design where a particular structure is necessary to ensure proper protein-protein interactions. In this paper, we show that in the 2D HP model of Dill it is possible to solve this problem for a broad class(More)
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k trees and k connected partial k trees these include subgraph isomorphism and topological embedding known to be NP complete for general partial k trees As well as contributing to our understanding of the types of graphs for which these problems are(More)
Mitchell and Ternovska [49, 50] propose a constraint programming framework for search problems that is based on classical logic extended with inductive definitions. They formulate a search problem as the problem of model expansion (MX). In this framework, the problem is encoded in a logic, an instance of the problem is represented by a finite structure, and(More)