Advertisement
Published in:
2006 | OriginalPaper | Chapter
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
Published in: Computational Science – ICCS 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
.