Advertisement

Combinatorial Algorithms for Design of DNA Arrays

  • Sridhar Hannenhalli
  • Earl Hubbell
  • Robert Lipshutz
  • Pavel A. Pevzner
Chapter
Part of the Advances in Biochemical Engineering/Biotechnology book series (ABE, volume 77)

Abstract

Optimal design of DNA arrays requires the development of algorithms with two-fold goals: reducing the effects caused by unintended illumination (border length minimization problem) and reducing the complexity of masks (mask decomposition problem). We describe algorithms that reduce the number of rectangles in mask decomposition by 20–30% as compared to a standard array design under the assumption that the arrangement of oligonucleotides on the array is fixed. This algorithm produces provably optimal solution for all studied real instances of array design. We also address the difficult problem of finding an arrangement which minimizes the border length and come up with a new idea of threading that significantly reduces the border length as compared to standard designs.

Keywords

DNA arrays Photolitography Mask design Combinatorial algorithms Rectangle cover problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Angluin D, Valiant LG (1979) Fast probabilistic algorithms for hamiltonian circuits and matchings. Journal of Computer Science and Systems 18:155CrossRefGoogle Scholar
  2. 2.
    Chee M, Yang R, Hubbell E, Berno A, Huang XC, Stern D, Winkler J, Lockhart DJ, Morris MS, Fodor SA (1996) Accessing genetic information with high-density dna arrays. Science 274:610CrossRefGoogle Scholar
  3. 3.
    Cho RJ, Campbell MJ, Winzeler EA, Steinmetz L, Conway A, Wodicka L, Wolfsberg TG, Gabrielian AE, Landsman D, Lockhart DJ, Davis RW (1998) A genome-wide transcriptional analysis of the mitotic cell cycle. Molecular Cell 2:65CrossRefGoogle Scholar
  4. 4.
    Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to Algorithms. MIT PressGoogle Scholar
  5. 5.
    Fodor S, Read JL, Pirrung MC, Stryer L, Tsai Lu A, Solas D (1991) Light-directed, spatially addressable parallel chemical synthesis. Science 251:767CrossRefGoogle Scholar
  6. 6.
    Franzblau DS, Kleitman DJ (1984) An algorithm for covering polygons with rectangles. Information and Control 63:164CrossRefGoogle Scholar
  7. 7.
    Garey MS, Johnson DS (1979) Computers and Intractibility: A Guide to the Theory of NP-Completeness. W H. Freeman, San Francisco, CAGoogle Scholar
  8. 8.
    Lin S, Kernighan BW (1973) An effective heuristic for the traveling-salesman problem. Operation Research 21:498CrossRefGoogle Scholar
  9. 9.
    Lockhart DJ, Dong H, Byrne MC, Follettie MT, Gallo MV, Chee MS, Mittmann M, Wang C, Kobayashi M, Horton H, Brown EL (1996) Expression monitoring by hybridization to high-density oligonucleotide arrays. Nature Biotechnology 14:1675CrossRefGoogle Scholar
  10. 10.
    Ohtsuki, T (1982) Minimum dissection of rectilinear regions. Proc. 1982 IEEE Symp. on Circuits and Systems 1210Google Scholar
  11. 11.
    Pevzner PA (2000) Computational Molecular Biology: An Algorithmic Approach. The MIT Press insteadGoogle Scholar
  12. 12.
    Singh-Gasson S, Green RD, Yue Y, Nelson C, Blattner F, Sussman MR, Cerrina F (1999) Maskless fabrication of light-directed oligonucleotide microarrays using a digital micromirror array. Nature Biotechnology 17:974CrossRefGoogle Scholar
  13. 13.
    Wang DG, Fan J, Siao C, Berno A, Young P, Sapolsky R, Ghandour G, Perkins N, Winchester E, Spencer J, Kruglyak L, Stein L, Hsie L, Topaloglou T, Hubbell E, Robinson E, Mittmann M, Morris M, Shen N, Kilburn D, Rioux J, Nusbaum C, Rozen S, Hudson T, Lipshutz R, Chee M, Lander E (1998) Large-scale identification, mapping, and genotyping of single-nucleotide polymorphisms in the human genome. Science 280:1077CrossRefGoogle Scholar
  14. 14.
    Wodicka L, Dong H, Mittmann M, Ho MH, Lockhart DJ (1997) Genome-wide expression monitoring in saccharomyces cerevisiae. Nature Biotechnology 15:1539CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Sridhar Hannenhalli
    • 1
  • Earl Hubbell
    • 2
  • Robert Lipshutz
    • 2
  • Pavel A. Pevzner
    • 3
  1. 1.Departments of MathematicsUniversity of Southern CaliforniaLos AngelesUSA
  2. 2.AffymetrixSanta ClaraUSA
  3. 3.Departments of Computer Science and EngineeringUniversity of California at San DiegoLa JollaUSA

Personalised recommendations