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

20Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2006.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Hajiaghayi, M. T., Jain, K., Lau, L. C., Mǎndoiu, I. I., Russell, A., & Vazirani, V. V. (2006). Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3992 LNCS-II, pp. 758–766). Springer Verlag. https://doi.org/10.1007/11758525_102

Readers over time

‘09‘16‘17‘2400.751.52.253

Readers' Seniority

Tooltip

Professor / Associate Prof. 4

67%

Lecturer / Post doc 1

17%

PhD / Post grad / Masters / Doc 1

17%

Readers' Discipline

Tooltip

Computer Science 4

67%

Agricultural and Biological Sciences 1

17%

Mathematics 1

17%

Save time finding and organizing research with Mendeley

Sign up for free
0