Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping
verfasst von : M. T. Hajiaghayi, K. Jain, L. C. Lau, I. I. Măndoiu, A. Russell, V. V. Vazirani
Erschienen in: Computational Science – ICCS 2006
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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
.