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

Combinatorial algorithms for design of DNA arrays.

Sridhar Hannenhalli1, Earl Hubell, Robert Lipshutz

  • 1Department of Mathematics, University of Southern California, Los Angeles 90089-1113, USA.

Advances in Biochemical Engineering/Biotechnology
|September 14, 2002
PubMed
Summary

New algorithms optimize DNA array design by minimizing mask complexity and border length. These methods reduce mask rectangles by up to 30% and significantly shorten array borders for improved performance.

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

CATS-A tool to contextualize cancer hallmarks to specific cancer types.

iScience·2026
Same author

STITCH links cellular morphology and gene expression in spatial transcriptomics.

bioRxiv : the preprint server for biology·2026
Same author

MGA: a tool for haplotype-mixed assembly of long and accurate reads.

Genome biology·2026
Same author

Endocrine therapy-specific lineage and partial epithelial-mesenchymal reprogramming defines divergent resistant cell-states in ER+ breast cancer.

bioRxiv : the preprint server for biology·2026
Same author

UNITe: exploiting conserved links between oncogenesis and homeostasis to identify novel cancer drivers.

Frontiers in oncology·2026
Same author

Identifying clinically relevant cell state interactions in the tumor microenvironment of IDH-mutant gliomas using CSI-TME.

Molecular systems biology·2026

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • DNA array design faces challenges in minimizing unintended illumination effects and mask complexity.
  • Efficient algorithms are crucial for optimizing DNA array performance and manufacturing.

Purpose of the Study:

  • To develop algorithms for optimal DNA array design, addressing both mask decomposition and border length minimization.
  • To improve upon standard array design methods for reduced complexity and enhanced performance.

Main Methods:

  • Developed algorithms for mask decomposition, reducing the number of rectangles by 20-30% for fixed oligonucleotide arrangements.
  • Introduced a novel 'threading' approach to significantly minimize border length in DNA array designs.

Related Experiment Videos

Main Results:

  • Achieved provably optimal solutions for mask decomposition in studied real-world array designs.
  • Demonstrated significant reductions in border length compared to standard array designs using the new threading method.

Conclusions:

  • The developed algorithms offer substantial improvements in DNA array design efficiency and performance.
  • These advancements contribute to more optimal and cost-effective DNA array manufacturing and application.