Designing optimally multiplexed SNP genotyping assays

DOI10.1016/J.JCSS.2004.12.004zbMath1068.68176OpenAlexW2095265131MaRDI QIDQ1775775

Yonatan Aumann, Efrat Manisterski, Zohar Yakhini

Publication date: 4 May 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.12.004

zbMATH Keywords

Approximation algorithmsGraph coloringGenotypingHigh throughput genotyping

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Coloring of graphs and hypergraphs (05C15) Genetics and epigenetics (92D10) Approximation algorithms (68W25)

Related Items (1)

Designing optimally multiplexed SNP genotyping assays

Cites Work

• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Designing optimally multiplexed SNP genotyping assays
• Smallest-last ordering and clustering and graph coloring algorithms
• The NP-Completeness of Edge-Coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Designing optimally multiplexed SNP genotyping assays