Piotr Berman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Piotr Berman has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Bhaskar DasGupta
University of Illinois
3 shared publications - Ming-Yang Kao
Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60208, United States
2 shared publications - Jie Liang
University of Illinois at Chicago
1 shared publication - Mark Gerstein
Program in Computational Biology and Bioinformatics, Yale University, New Haven, CT 06511, USA
1 shared publication Mary Ashley
1 shared publication- Michael Snyder
Yale University
1 shared publication
Latest Publications
- 1 August 2009
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (5) , 287-302
On approximating four covering and packing problems
- 1 August 2009
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (5) , 287-302
On approximating four covering and packing problems
- 1 August 2007
- Published by Springer Nature in Algorithmica
- Vol. 48 (4) , 301
Foreword
- 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.