Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Anirvan M. Sengupta is active.

Publication


Featured researches published by Anirvan M. Sengupta.


Proceedings of the National Academy of Sciences of the United States of America | 2002

The role of chromosomal instability in tumor initiation

Martin A. Nowak; Natalia L. Komarova; Anirvan M. Sengupta; Prasad V. Jallepalli; Ie Ming Shih; Bert Vogelstein; Christoph Lengauer

Chromosomal instability (CIN) is a defining characteristic of most human cancers. Mutation of CIN genes increases the probability that whole chromosomes or large fractions of chromosomes are gained or lost during cell division. The consequence of CIN is an imbalance in the number of chromosomes per cell (aneuploidy) and an enhanced rate of loss of heterozygosity. A major question of cancer genetics is to what extent CIN, or any genetic instability, is an early event and consequently a driving force for tumor progression. In this article, we develop a mathematical framework for studying the effect of CIN on the somatic evolution of cancer. Specifically, we calculate the conditions for CIN to initiate the process of colorectal tumorigenesis before the inactivation of tumor suppressor genes.


IEEE Transactions on Information Theory | 2003

MIMO capacity through correlated channels in the presence of correlated interferers and noise: a (not so) large N analysis

Aris L. Moustakas; Steven H. Simon; Anirvan M. Sengupta

The use of multiple-antenna arrays in both transmission and reception promises huge increases in the throughput of wireless communication systems. It is therefore important to analyze the capacities of such systems in realistic situations, which may include spatially correlated channels and correlated noise, as well as correlated interferers with known channel at the receiver. Here, we present an approach that provides analytic expressions for the statistics, i.e., the moments of the distribution, of the mutual information of multiple-antenna systems with arbitrary correlations, interferers, and noise. We assume that the channels of the signal and the interference are Gaussian with arbitrary covariance. Although this method is valid formally for large antenna numbers, it produces extremely accurate results even for arrays with as few as two or three antennas. We also develop a method to analytically optimize over the input signal covariance, which enables us to calculate analytic capacities when the transmitter has knowledge of the statistics of the channel (i.e., the channel covariance). In many cases of interest, this capacity is very close to the full closed-loop capacity, in which the transmitter has instantaneous channel knowledge. We apply this analytic approach to a number of examples and we compare our results with simulations to establish the validity of this approach. This method provides a simple tool to analyze the statistics of throughput for arrays of any size. The emphasis of this paper is on elucidating the novel mathematical methods used.


Science | 2000

Communication through a diffusive medium : Coherence and capacity

Aris L. Moustakas; Harold U. Baranger; Leon Balents; Anirvan M. Sengupta; Steven H. Simon

Coherent wave propagation in disordered media gives rise to many fascinating phenomena as diverse as universal conductance fluctuations in mesoscopic metals and speckle patterns in light scattering. Here, the theory of electromagnetic wave propagation in diffusive media is combined with information theory to show how interference affects the information transmission rate between antenna arrays. Nontrivial dependencies of the information capacity on the nature of the antenna arrays are found, such as the dimensionality of the arrays and their direction with respect to the local scattering medium. This approach provides a physical picture for understanding the importance of scattering in the transfer of information through wireless communications.


BMC Bioinformatics | 2010

SOPRA: Scaffolding algorithm for paired reads via statistical optimization

Adel Dayarian; Todd P. Michael; Anirvan M. Sengupta

BackgroundHigh throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing applications, de novo assembly of moderate size genomes from such reads remains a significant challenge. These limitations could be partially overcome by utilizing mate pair technology, which provides pairs of short reads separated by a known distance along the genome.ResultsWe have developed SOPRA, a tool designed to exploit the mate pair/paired-end information for assembly of short reads. The main focus of the algorithm is selecting a sufficiently large subset of simultaneously satisfiable mate pair constraints to achieve a balance between the size and the quality of the output scaffolds. Scaffold assembly is presented as an optimization problem for variables associated with vertices and with edges of the contig connectivity graph. Vertices of this graph are individual contigs with edges drawn between contigs connected by mate pairs. Similar graph problems have been invoked in the context of shotgun sequencing and scaffold building for previous generation of sequencing projects. However, given the error-prone nature of HTS data and the fundamental limitations from the shortness of the reads, the ad hoc greedy algorithms used in the earlier studies are likely to lead to poor quality results in the current context. SOPRA circumvents this problem by treating all the constraints on equal footing for solving the optimization problem, the solution itself indicating the problematic constraints (chimeric/repetitive contigs, etc.) to be removed. The process of solving and removing of constraints is iterated till one reaches a core set of consistent constraints. For SOLiD sequencer data, SOPRA uses a dynamic programming approach to robustly translate the color-space assembly to base-space. For assessing the quality of an assembly, we report the no-match/mismatch error rate as well as the rates of various rearrangement errors.ConclusionsApplying SOPRA to real data from bacterial genomes, we were able to assemble contigs into scaffolds of significant length (N50 up to 200 Kb) with very few errors introduced in the process. In general, the methodology presented here will allow better scaffold assemblies of any type of mate pair sequencing data.


Molecular and Cellular Biology | 2011

Regulated Antisense Transcription Controls Expression of Cell-Type-Specific Genes in Yeast

Brian Gelfand; Janet Mead; Adrian R. Bruning; Nicholas Apostolopoulos; Vasisht Tadigotla; Vijaylakshmi Nagaraj; Anirvan M. Sengupta; Andrew K. Vershon

ABSTRACT Transcriptome profiling studies have recently uncovered a large number of noncoding RNA transcripts (ncRNAs) in eukaryotic organisms, and there is growing interest in their role in the cell. For example, in haploid Saccharomyces cerevisiae cells, the expression of an overlapping antisense ncRNA, referred to here as RME2 (Regulator of Meiosis 2), prevents IME4 expression. In diploid cells, the a1-α2 complex represses the transcription of RME2, allowing IME4 to be induced during meiosis. In this study we show that antisense transcription across the IME4 promoter region does not block transcription factors from binding and is not required for repression. Mutational analyses found that sequences within the IME4 open reading frame (ORF) are required for the repression mediated by RME2 transcription. These results support a model where transcription of RME2 blocks the elongation of the full-length IME4 transcript but not its initiation. We have found that another antisense transcript, called RME3, represses ZIP2 in a cell-type-specific manner. These results suggest that regulated antisense transcription may be a widespread mechanism for the control of gene expression and may account for the roles of some of the previously uncharacterized ncRNAs in yeast.


Proceedings of the National Academy of Sciences of the United States of America | 2002

Specificity and robustness in transcription control networks

Anirvan M. Sengupta; Marko Djordjevic; Boris I. Shraiman

Recognition by transcription factors of the regulatory DNA elements upstream of genes is the fundamental step in controlling gene expression. How does the necessity to provide stability with respect to mutation constrain the organization of transcription control networks? We examine the mutation load of a transcription factor interacting with a set of n regulatory response elements as a function of the factor/DNA binding specificity and conclude on theoretical grounds that the optimal specificity decreases with n. The predicted correlation between variability of binding sites (for a given transcription factor) and their number is supported by the genomic data for Escherichia coli. The analysis of E. coli genomic data was carried out using an algorithm suggested by the biophysical model of transcription factor/DNA binding. Complete results of the search for candidate transcription factor binding sites are available at http://www.physics.rockefeller.edu/∼boris/public/search_ecoli.


Bioinformatics | 2005

Non-additivity in protein--DNA binding

Ruadhan A. O'Flanagan; Guillaume Paillard; Richard Lavery; Anirvan M. Sengupta

MOTIVATION Localizing protein binding sites within genomic DNA is of considerable importance, but remains difficult for protein families, such as transcription factors, which have loosely defined target sequences. It is generally assumed that protein affinity for DNA involves additive contributions from successive nucleotide pairs within the target sequence. This is not necessarily true, and non-additive effects have already been experimentally demonstrated in a small number of cases. The principal origin of non-additivity involves the so-called indirect component of protein-DNA recognition which is related to the sequence dependence of DNA deformation induced during complex formation. Non-additive effects are difficult to study because they require the identification of many more binding sequences than are normally necessary for describing additive specificity (typically via the construction of weight matrices). RESULTS In the present work we will use theoretically estimated binding energies as a basis for overcoming this problem. Our approach enables us to study the full combinatorial set of sequences for a variety of DNA-binding proteins, make a detailed analysis of non-additive effects and exploit this information to improve binding site predictions using either weight matrices or support vector machines. The results underline the fact that, even in the presence of significant deformation, non-additive effects may involve only a limited number of dinucleotide steps. This information helps to reduce the number of binding sites which need to be identified for successful predictions and to avoid problems of over-fitting. AVAILABILITY The SVM software is available upon request from the authors.


PLOS Computational Biology | 2009

Shape, Size, and Robustness: Feasible Regions in the Parameter Space of Biochemical Networks

Adel Dayarian; Madalena Chaves; Eduardo D. Sontag; Anirvan M. Sengupta

The concept of robustness of regulatory networks has received much attention in the last decade. One measure of robustness has been associated with the volume of the feasible region, namely, the region in the parameter space in which the system is functional. In this paper, we show that, in addition to volume, the geometry of this region has important consequences for the robustness and the fragility of a network. We develop an approximation within which we could algebraically specify the feasible region. We analyze the segment polarity gene network to illustrate our approach. The study of random walks in the parameter space and how they exit the feasible region provide us with a rich perspective on the different modes of failure of this network model. In particular, we found that, between two alternative ways of activating Wingless, one is more robust than the other. Our method provides a more complete measure of robustness to parameter variation. As a general modeling strategy, our approach is an interesting alternative to Boolean representation of biochemical networks.


Physical Review B | 1995

NON-FERMI-LIQUID BEHAVIOR NEAR A T = 0 SPIN-GLASS TRANSITION

Anirvan M. Sengupta; Antoine Georges

In this paper we study the competition between the Kondo effect and RKKY interactions near the zero-temperature quantum critical point of an Ising-like metallic spin-glass. We consider the mean-field behaviour of various physical quantities. In the ‘quantum- critical regime’ non-analytic corrections to the Fermi liquid behaviour are found for the specific heat and uniform static susceptibility, while the resistivity and NMR relaxation rate have a non-Fermi liquid dependence on temperature.


Physical Biology | 2007

Epigenetic chromatin silencing: bistability and front propagation

Mohammad Sedighi; Anirvan M. Sengupta

The role of post-translational modification of histones in eukaryotic gene regulation is well recognized. Epigenetic silencing of genes via heritable chromatin modifications plays a major role in cell fate specification in higher organisms. We formulate a coarse-grained model of chromatin silencing in yeast and study the conditions under which the system becomes bistable, allowing for different epigenetic states. We also study the dynamics of the boundary between the two locally stable states of chromatin: silenced and unsilenced. The model could be of use in guiding the discussion on chromatin silencing in general. In the context of silencing in budding yeast, it helps us understand the phenotype of various mutants, some of which may be non-trivial to see without the help of a mathematical model. One such example is a mutation that reduces the rate of background acetylation of particular histone side chains that competes with the deacetylation by Sir2p. The resulting negative feedback due to a Sir protein depletion effect gives rise to interesting counter-intuitive consequences. Our mathematical analysis brings forth the different dynamical behaviors possible within the same molecular model and guides the formulation of more refined hypotheses that could be addressed experimentally.

Collaboration


Dive into the Anirvan M. Sengupta's collaboration.

Top Co-Authors

Avatar

Partha P. Mitra

Cold Spring Harbor Laboratory

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Dmitri B. Chklovskii

Cold Spring Harbor Laboratory

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge