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

Minimum multicolored subgraph problem in multiplex pcr primer set selection and population haplotyping (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by M. T. Hajiaghayi , K. Jain , L. C. Lau , I. I. Măndoiu , A. Russell , V. V. Vazirani

Venue:	In Proceedings of the 6th International Conference on Computational Science (ICCS
Citations:	5 - 0 self

BibTeX

@INPROCEEDINGS{Hajiaghayi06minimummulticolored,
    author = {M. T. Hajiaghayi and K. Jain and L. C. Lau and I. I. Măndoiu and A. Russell and V. V. Vazirani},
    title = {Minimum multicolored subgraph problem in multiplex pcr primer set selection and population haplotyping},
    booktitle = {In Proceedings of the 6th International Conference on Computational Science (ICCS},
    year = {2006},
    pages = {758--766}
}

Bookmark

OpenURL

Abstract

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. 1

Citations

78	Relations between average case complexity and approximation complexity - Feige - 2002
42	Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms - Lancia, Pinotti, et al.
35	Haploptye inference by maximum parsimony - Wang, Xu
34	A new integer programming formulation for the pure parsimony problem in haplotype analysis - Brown, Harrower - 2004
32	Approximation algorithms for partial covering problems - Gandhi, Khuller, et al. - 2004
30	Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique - Khot - 2004
28	A survey of computational methods for determining haplotypes - Halldórsson, Bafna, et al. - 2004
24	T: An approximation algorithm for haplotype inference by maximum parsimony - Huang, Chao, et al.
24	The dense k-subgraph problem. Algorithmica - Feige, Kortsarz, et al. - 2001
22	The haplotyping problem: an overview of computational models and solutions - Bonizzoni, Vedova, et al. - 2003
15	Haplotyping by Pure Parsimony - Gusfield - 2003
12	T: Algorithms for inferring haplotypes - Niu
12	E (2006) Haplofreq–estimating haplotype frequencies efficiently - Halperin, Hazan
12	Improved performance of the greedy algorithm for partial - Slav'ik - 1997
8	The role of haplotypes in candidate gene studies - Clark - 2004
8	Microarray synthesis through multiple-use PCR primer design - Fernandes, Skiena - 2002
8	DJ: Haplotype and missing data inference in nuclear families. Genome Res 2004, 14:1624-1632. Publish with BioMed Central and every scientist can read your work free of charge "BioMed Central will be the most significant development for disseminating the r - Lin, Chakravarti, et al.
7	The set cover with pairs problem - Hassin, Segev - 2005
6	Microarray synthesis through multiple-use PCR primer design - Fernandes, Skiena - 2002
5	Improved algorithms for multiplex PCR primer set selection with amplification length constraints - Konwar, Mandoiu, et al.
3	R.: Haplotyping populations: complexity and approximations - Lancia, Pinotti, et al. - 2002