Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping

Authors:
M. T. Hajiaghayi;K. Jain;L. C. Lau;I. I. Măndoiu;A. Russell;V. V. Vazirani
Affiliations:
Laboratory for Computer Science, MIT;Microsoft Research;Department of Computer Science, University of Toronto, Canada;CSE Department, University of Connecticut;CSE Department, University of Connecticut;College of Computing, Georgia Institute of Technology
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Year:
2006

Citing 9
Cited 7

Improved performance of the greedy algorithm for partial cover

Information Processing Letters
Relations between average case complexity and approximation complexity

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Haplotyping problem: an overview of computational models and solutions

Journal of Computer Science and Technology
Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for partial covering problems

Journal of Algorithms
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms

INFORMS Journal on Computing
Haplotype inference by pure Parsimony

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
The set cover with pairs problem

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
HAPLOFREQ: estimating haplotype frequencies efficiently

RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology

The Minimum Substring Cover problem

Information and Computation
A practical algorithm for multiplex PCR primer set selection

International Journal of Bioinformatics Research and Applications
On Finding Small 2-Generating Sets

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Indexing a dictionary for subset matching queries

SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
The minimum substring cover problem

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system

Proceedings of the 20th ACM international conference on Information and knowledge management
Indexing a dictionary for subset matching queries

Algorithms and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the minimum weight multicolored subgraph problem (MWMCSP), which is a common generalization of minimum cost multiplex PCR primer set selection and maximum likelihood population haplotyping. In this problem one is given an undirected graph G with non-negative vertex weights and a color function that assigns to each edge one or more of n given colors, and the goal is to find a minimum weight set of vertices inducing edges of all n colors. We obtain improved approximation algorithms and hardness results for MWMCSP and its variant in which the goal is to find a minimum number of vertices inducing edges of at least k colors for a given integer k≤ n.