Mark Gerstein
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Mark Gerstein has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Michael Snyder
Yale University
2 shared publications - Bhaskar DasGupta
University of Illinois
1 shared publication - Ming-Yang Kao
Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60208, United States
1 shared publication - Paul Bertone
Department of Medicine, Division of Hematology-Oncology, Warren Alpert Medical School of Brown University and Rhode Island Hospital, Providence, RI
1 shared publication - Piotr Berman
Department of Computer Science and Engineering, Pennsylvania State University
1 shared publication - Xiaowei Zhu
Program in Computational Biology and Bioinformatics, Yale University, New Haven, CT 06511, USA
1 shared publication
Latest Publications
- Open Access
- 16 November 2006
- Published by Springer Nature in Genome Biology
- Vol. 7 (11) , R110
ProCAT: a data analysis approach for protein microarrays
Protein microarrays provide a versatile method for the analysis of many protein biochemical activities. Existing DNA microarray analytical methods do not translate to protein microarrays due to differences between the technologies. Here we report a new approach, ProCAT, which corrects for background bias and spatial artifacts, identifies significant signals, filters nonspecific spots, and normalizes the resulting signal to protein abundance. ProCAT provides a powerful and flexible new approach for analyzing many types of protein microarrays.
- 16 November 2006
- Published by Springer Nature in Genome Biology
- Vol. 7 (11) , R110
Open AccessProCAT: a data analysis approach for protein microarrays
Protein microarrays provide a versatile method for the analysis of many protein biochemical activities. Existing DNA microarray analytical methods do not translate to protein microarrays due to differences between the technologies. Here we report a new approach, ProCAT, which corrects for background bias and spatial artifacts, identifies significant signals, filters nonspecific spots, and normalizes the resulting signal to protein abundance. ProCAT provides a powerful and flexible new approach for analyzing many types of protein microarrays.
- 1 July 2004
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 11 (4) , 766-785
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search
In this paper, we consider several variations of the following basic tiling problem: given a sequence of real numbers with two size-bound parameters, we want to find a set of tiles of maximum total weight such that each tiles satisfies the size bounds. A solution to this problem is important to a number of computational biology applications such as selecting genomic DNA fragments for PCR-based amplicon microarrays and performing homology searches with long sequence queries. Our goal is to design efficient algorithms with linear or near-linear time and space in the normal range of parameter values for these problems. For this purpose, we first discuss the solution to a basic online interval maximum problem via a sliding-window approach and show how to use this solution in a nontrivial manner for many of the tiling problems introduced.We also discuss NP-hardness results and approximation algorithms for generalizing our basic tiling problem to higher dimensions. Finally, computational results from applying our tiling algorithms to genomic sequences of five model eukaryotes are reported.
- 1 July 2004
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 11 (4) , 766-785
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search
In this paper, we consider several variations of the following basic tiling problem: given a sequence of real numbers with two size-bound parameters, we want to find a set of tiles of maximum total weight such that each tiles satisfies the size bounds. A solution to this problem is important to a number of computational biology applications such as selecting genomic DNA fragments for PCR-based amplicon microarrays and performing homology searches with long sequence queries. Our goal is to design efficient algorithms with linear or near-linear time and space in the normal range of parameter values for these problems. For this purpose, we first discuss the solution to a basic online interval maximum problem via a sliding-window approach and show how to use this solution in a nontrivial manner for many of the tiling problems introduced.We also discuss NP-hardness results and approximation algorithms for generalizing our basic tiling problem to higher dimensions. Finally, computational results from applying our tiling algorithms to genomic sequences of five model eukaryotes are reported.