Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks

Authors:
Piotr Berman;Bhaskar DasGupta;Eduardo Sontag
Affiliations:
Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA 16802, USA;Department of Computer Science, University of Illinois at Chicago, Chicago, IL 60607-7053, USA;Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 8
Cited 8

A new polynomial-time algorithm for linear programming

Combinatorica
Randomized algorithms

Randomized algorithms
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Approximation algorithms

Approximation algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Inferring dynamic architecture of cellular networks using time series of gene expression, protein and metabolite data

Bioinformatics
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Approximating the online set multicover problems via randomized winnowing

Theoretical Computer Science
Highly scalable algorithms for robust string barcoding

International Journal of Bioinformatics Research and Applications
Complexity of total {k}-domination and related problems

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Energy proportionality and performance in data parallel computing clusters

SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Approximating the online set multicover problems via randomized winnowing

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Covering analysis of the greedy algorithm for partial cover

Algorithms and Applications
Models and algorithmic tools for computational processes in cellular biology: recent developments and future directions

ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
iPACS: Power-aware covering sets for energy proportionality and performance in data parallel computing clusters

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.05

Visualization

Abstract

Position-specific score matrices (PSSMs) have been applied to various problems in computational molecular biology. In this paper, we study the following problem: given positive examples (sequences) and negative examples (sequences), find a PSSM which ...