Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping

DOI10.1007/11758525_102MaRDI QIDQ3545128zbMATH OpenOpenAlexFDO

Authors

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758525_102

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• On the primer selection problem in polymerase chain reaction experiments
• On the approximability of the minimum rainbow subgraph problem and other related problems
• Approximating the rainbow -- better lower and upper bounds
• Better lower and upper bounds for the minimum rainbow subgraph problem
• Designing optimally multiplexed SNP genotyping assays

Cited in

(13)

• Precedence-Constrained Min Sum Set Cover
• The parameterized complexity of the rainbow subgraph problem
• The parameterized complexity of the rainbow subgraph problem
• Exact and heuristic approaches for the set cover with pairs problem
• Sherali-Adams integrality gaps matching the log-density threshold
• Better lower and upper bounds for the minimum rainbow subgraph problem
• Subset sum problems with digraph constraints
• Designing optimally multiplexed SNP genotyping assays
• On Finding Small 2-Generating Sets
• The minimum substring cover problem
• The Minimum Substring Cover Problem
• Sum-of-squares lower bounds for densest \(k\)-subgraph
• Approximation algorithms for the minimum rainbow subgraph problem

This page was built for publication: Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545128)