Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Multiplexing schemes for generic SNP genotyping assays.

Roded Sharan1, Jens Gramm, Zohar Yakhini

  • 1School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel. roded@post.tau.ac.il

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|June 15, 2005
PubMed
Summary

This study introduces efficient algorithms for designing SNP genotyping experiments using generic assays. The methods optimize assay and PCR reaction usage, reducing costs for genetic association studies.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

An optimization framework for hierarchical clustering.

Bioinformatics advances·2026
Same author

Error characterization and error correction approaches in combinatorial DNA-based storage.

Scientific reports·2026
Same author

Toward identification of common DNA repair process in mutational signatures.

bioRxiv : the preprint server for biology·2026
Same author

Signing protein-protein interaction networks.

Bioinformatics (Oxford, England)·2025
Same author

Unifying proteomic technologies with ProteinProjector.

Bioinformatics advances·2025
Same author

Integrated spatial proteomic analysis of breast cancer heterogeneity unravels cancer cell phenotypic plasticity.

Nature communications·2025

Area of Science:

  • Genomics
  • Bioinformatics
  • Computational Biology

Background:

  • Population-based association studies link genomic variation to medical conditions.
  • Efficient and affordable genotyping techniques are crucial for these studies.
  • Generic genotyping assays offer flexibility but require optimized SNP selection for parallel interrogation.

Purpose of the Study:

  • To address computational problems in designing genotyping experiments using generic assays.
  • To minimize genotyping costs by optimizing the number of assays and PCR reactions.
  • To develop algorithmic solutions for SNP selection under technological constraints.

Main Methods:

  • Formulated genotyping design as a problem considering assay count and PCR reactions.
  • Proved the computational hardness of the optimization problems.

Related Experiment Videos

  • Developed approximate and heuristic algorithms based on graph partitioning and packing.
  • Recasted multiplexing problems as partitioning and packing problems on bipartite graphs.

    • Main Results:

    • Algorithmic approaches were tested on synthetic and real-world SNP data.
    • The algorithms demonstrated near-optimal design capabilities in numerous cases.
    • The study validates the practical application of generic assays for SNP genotyping.

    Conclusions:

    • Efficient algorithms can solve complex SNP genotyping design problems.
    • The proposed methods effectively reduce genotyping costs.
    • Generic assays are a viable and flexible tool for large-scale genetic studies.