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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin D, Valiant LG (1979) Fast probabilistic algorithms for hamiltonian circuits and matchings. Journal of Computer Science and Systems 18:155
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:610
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:65
Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to Algorithms. MIT Press
Fodor S, Read JL, Pirrung MC, Stryer L, Tsai Lu A, Solas D (1991) Light-directed, spatially addressable parallel chemical synthesis. Science 251:767
Franzblau DS, Kleitman DJ (1984) An algorithm for covering polygons with rectangles. Information and Control 63:164
Garey MS, Johnson DS (1979) Computers and Intractibility: A Guide to the Theory of NP-Completeness. W H. Freeman, San Francisco, CA
Lin S, Kernighan BW (1973) An effective heuristic for the traveling-salesman problem. Operation Research 21:498
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:1675
Ohtsuki, T (1982) Minimum dissection of rectilinear regions. Proc. 1982 IEEE Symp. on Circuits and Systems 1210
Pevzner PA (2000) Computational Molecular Biology: An Algorithmic Approach. The MIT Press instead
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:974
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:1077
Wodicka L, Dong H, Mittmann M, Ho MH, Lockhart DJ (1997) Genome-wide expression monitoring in saccharomyces cerevisiae. Nature Biotechnology 15:1539
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hannenhalli, S., Hubbell, E., Lipshutz, R., Pevzner, P.A. (2002). Combinatorial Algorithms for Design of DNA Arrays. In: Hoheisel, J., et al. Chip Technology. Advances in Biochemical Engineering/Biotechnology, vol 77. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45713-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-45713-5_1
Received:
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43215-9
Online ISBN: 978-3-540-45713-8
eBook Packages: Springer Book Archive