Stan Letovsky
Helicos BioSciences
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Stan Letovsky.
Science | 2011
David T. Ting; Doron Lipson; Suchismita Paul; Brian W. Brannigan; Sara Akhavanfard; Erik J. Coffman; Gianmarco Contino; Vikram Deshpande; A. John Iafrate; Stan Letovsky; Miguel Rivera; Nabeel Bardeesy; Shyamala Maheswaran; Daniel A. Haber
Noncoding RNAs transcribed from DNA repeats in heterochromatin are expressed at surprisingly high levels in tumors. Satellite repeats in heterochromatin are transcribed into noncoding RNAs that have been linked to gene silencing and maintenance of chromosomal integrity. Using digital gene expression analysis, we showed that these transcripts are greatly overexpressed in mouse and human epithelial cancers. In 8 of 10 mouse pancreatic ductal adenocarcinomas (PDACs), pericentromeric satellites accounted for a mean 12% (range 1 to 50%) of all cellular transcripts, a mean 40-fold increase over that in normal tissue. In 15 of 15 human PDACs, alpha satellite transcripts were most abundant and HSATII transcripts were highly specific for cancer. Similar patterns were observed in cancers of the lung, kidney, ovary, colon, and prostate. Derepression of satellite transcripts correlated with overexpression of the long interspersed nuclear element 1 (LINE-1) retrotransposon and with aberrant expression of neuroendocrine-associated genes proximal to LINE-1 insertions. The overexpression of satellite transcripts in cancer may reflect global alterations in heterochromatin silencing and could potentially be useful as a biomarker for cancer detection.
Nature Biotechnology | 2009
Doron Lipson; Tal Raz; Alix Kieu; Dan Jones; Eldar Giladi; Edward C. Thayer; John F. Thompson; Stan Letovsky; Patrice M. Milos; Marie Causey
We present single-molecule sequencing digital gene expression (smsDGE), a high-throughput, amplification-free method for accurate quantification of the full range of cellular polyadenylated RNA transcripts using a Helicos Genetic Analysis system. smsDGE involves a reverse-transcription and polyA-tailing sample preparation procedure followed by sequencing that generates a single read per transcript. We applied smsDGE to the transcriptome of Saccharomyces cerevisiae strain DBY746, using 6 of the available 50 channels in a single sequencing run, yielding on average 12 million aligned reads per channel. Using spiked-in RNA, accurate quantitative measurements were obtained over four orders of magnitude. High correlation was demonstrated across independent flow-cell channels, instrument runs and sample preparations. Transcript counting in smsDGE is highly efficient due to the representation of each transcript molecule by a single read. This efficiency, coupled with the high throughput enabled by the single-molecule sequencing platform, provides an alternative method for expression profiling.
PLOS ONE | 2011
Tal Raz; Philipp Kapranov; Doron Lipson; Stan Letovsky; Patrice M. Milos; John F. Thompson
RNA Seq provides unparalleled levels of information about the transcriptome including precise expression levels over a wide dynamic range. It is essential to understand how technical variation impacts the quality and interpretability of results, how potential errors could be introduced by the protocol, how the source of RNA affects transcript detection, and how all of these variations can impact the conclusions drawn. Multiple human RNA samples were used to assess RNA fragmentation, RNA fractionation, cDNA synthesis, and single versus multiple tag counting. Though protocols employing polyA RNA selection generate the highest number of non-ribosomal reads and the most precise measurements for coding transcripts, such protocols were found to detect only a fraction of the non-ribosomal RNA in human cells. PolyA RNA excludes thousands of annotated and even more unannotated transcripts, resulting in an incomplete view of the transcriptome. Ribosomal-depleted RNA provides a more cost-effective method for generating complete transcriptome coverage. Expression measurements using single tag counting provided advantages for assessing gene expression and for detecting short RNAs relative to multi-read protocols. Detection of short RNAs was also hampered by RNA fragmentation. Thus, this work will help researchers choose from among a range of options when analyzing gene expression, each with its own advantages and disadvantages.
Nucleic Acids Research | 2011
Richard J. Roberts; Yi Chien Chang; Zhenjun Hu; John Rachlin; Brian P. Anton; Revonda Pokrzywa; Han Pil Choi; Lina L. Faller; Jyotsna Guleria; Genevieve Housman; Niels Klitgord; Varun Mazumdar; Mark McGettrick; Lais Osmani; Rajeswari Swaminathan; Kevin Tao; Stan Letovsky; Dennis Vitkup; Daniel Segrè; Charles DeLisi; Martin Steffen; Simon Kasif
COMBREX (http://combrex.bu.edu) is a project to increase the speed of the functional annotation of new bacterial and archaeal genomes. It consists of a database of functional predictions produced by computational biologists and a mechanism for experimental biochemists to bid for the validation of those predictions. Small grants are available to support successful bids.
PLOS ONE | 2009
Dikla Dotan-Cohen; Stan Letovsky; Avraham A. Melkman; Simon Kasif
Background The traditional approach to studying complex biological networks is based on the identification of interactions between internal components of signaling or metabolic pathways. By comparison, little is known about interactions between higher order biological systems, such as biological pathways and processes. We propose a methodology for gleaning patterns of interactions between biological processes by analyzing protein-protein interactions, transcriptional co-expression and genetic interactions. At the heart of the methodology are the concept of Linked Processes and the resultant network of biological processes, the Process Linkage Network (PLN). Results We construct, catalogue, and analyze different types of PLNs derived from different data sources and different species. When applied to the Gene Ontology, many of the resulting links connect processes that are distant from each other in the hierarchy, even though the connection makes eminent sense biologically. Some others, however, carry an element of surprise and may reflect mechanisms that are unique to the organism under investigation. In this aspect our method complements the link structure between processes inherent in the Gene Ontology, which by its very nature is species-independent. As a practical application of the linkage of processes we demonstrate that it can be effectively used in protein function prediction, having the power to increase both the coverage and the accuracy of predictions, when carefully integrated into prediction methods. Conclusions Our approach constitutes a promising new direction towards understanding the higher levels of organization of the cell as a system which should help current efforts to re-engineer ontologies and improve our ability to predict which proteins are involved in specific biological processes.
Journal of Computational Biology | 2010
Eldar Giladi; John Healy; Gene Myers; Chris Hart; Philipp Kapranov; Doron Lipson; Steve Roels; Edward C. Thayer; Stan Letovsky
The rapid adoption of high-throughput next generation sequence data in biological research is presenting a major challenge for sequence alignment tools—specifically, the efficient alignment of vast amounts of short reads to large references in the presence of differences arising from sequencing errors and biological sequence variations. To address this challenge, we developed a short read aligner for high-throughput sequencer data that is tolerant of errors or mutations of all types—namely, substitutions, deletions, and insertions. The aligner utilizes a multi-stage approach in which template-based indexing is used to identify candidate regions for alignment with dynamic programming. A template is a pair of gapped seeds, with one used with the read and one used with the reference. In this article, we focus on the development of template families that yield error-tolerant indexing up to a given error-budget. A general algorithm for finding those families is presented, and a recursive construction that creates families with higher error tolerance from ones with a lower error tolerance is developed.
Proceedings of the National Academy of Sciences of the United States of America | 2004
Ulas Karaoz; T. M. Murali; Stan Letovsky; Yu Zheng; Chunming Ding; Charles R. Cantor; Simon Kasif
Science | 1998
Stan Letovsky
Methods of Molecular Biology | 2011
Tal Raz; Marie Causey; Dan Jones; Alix Kieu; Stan Letovsky; Doron Lipson; Edward C. Thayer; John F. Thompson; Patrice M. Milos
Archive | 2013
Stan Letovsky; Marie E. Causey; Martin J. Aryee; Joel Skoletsky; Cindy Proulx; Frank R. Sharp; Isaac N. Pessah; Robin L. Hansen; Jeff P. Gregg; Irva Hertz-Picciotto