Evaluation of Placement Techniques for DNA Probe Array Layout

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers

Volumn , Issue , 2003, Pages 262-269

  Kahng, Andrew B ^a   Mǎndoiu, Ion ^b   Reda, Sherief ^a   Xu, Xu ^a   Zelikovsky, Alex Z ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

^c GEORGIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DNA; EMBEDDED SYSTEMS; HEURISTIC METHODS; MUTAGENESIS; PHOTOLITHOGRAPHY; VLSI CIRCUITS;

NUCLEOTIDE POLYMORPHISM; SUB-MICRON DOMAINS;

COMPUTER AIDED DESIGN;

EID: 0347409228     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccad.2003.159699     Document Type: Conference Paper

References (27)

1. http://www.affymetrix.com
2. http://www.perlegen.com
3. S.B. Akers, "On the use of the linear assignment algorithm in module placement", Proc. 18th Design Automation Conference (DAC 1981), pp. 137-144.
4. C. J. Alpert and A. B. Kahng, "Geometric Embeddings for Faster (and Better) Multi-Way Netlist Partitioning" Proc. ACM/IEEE Design Automation Conf., 1993, pp. 743-748.
5. C.J. Alpert and A.B. Kahng, "Recent directions in netlist partitioning: A survey", Integration: The VLSI Jour. 19 (1995), pp. 1-81.
6. A. Caldwell and A. Kahng and I. Markov, "Can Recursive bisection Produce Routable Designs?", DAC, 2000, pp.477-482.
7. C. C. Chang, J. Cong and M. Xie, "Optimality and Scalability Study of Existing Placement Algorithms", Proc. Asia South-Pacific Design Automation Conference, Jan. 2003.
8. J. Cong, M. Romesis and M. Xie, "Optimality, Scalability and Stability Study of Parititoning and Placement Algorithms", Proc. ISPD, 2003, pp. 88-94.
9. D. R. Cutting, D. R. Karger, J. O. Pederson and J. W. Tukey, "Scatter/Gather: A Cluster-Based Approach to Browsing Large Document Collections", (15th Intl. ACM/SIGIR Conference on Research and Development in Information Retrieval) SIGIR Forum (1992), pp. 318-329.
10. K. Doll, F. M. Johannes, K. J. Antreich, "Iterative Placement Improvement by Network Flow Methods", IEEE Transactions on Computer-Aided Design 13(10) (1994), pp. 1189-1200.
11. W. Feldman and P.A. Pevzner, "Gray code masks for sequencing by hybridization", Genomics, 23 (1994), pp. 233-235.
12. C. M. Fiduccia and R. M. Mattheyses, "A Linear-Time Heuristic for Improving Network Partitions", Proc. Design Automation Conference (DAC 1982), pp. 175-181.
13. S. Fodor, J. L. Read, M. C. Pirrung, L. Stryer, L. A. Tsai and D. Solas, "Light-Directed, Spatially Addressable Parallel Chemical Synthesis", Science 251 (1991), pp. 767-773.
14. D.H. Geschwind and J.P. Gregg (Eds.), Microarrays for the neurosciences: an essential guide, MIT Press, Cambridge, MA, 2002.
15. L. W. Hagen, D. J. Huang and A. B. Kahng, "Quantified Suboptimality of VLSI Layout Heuristics", Proc. ACM/IEEE Design Automation Conf., 1995, pp. 216-221.
16. S. Hannenhalli, E. Hubbell, R. Lipshutz and P.A. Pevzner, "Combinatorial Algorithms for Design of DNA Arrays", in Chip Technology (ed. J. Hoheisel), Springer-Verlag, 2002.
17. D. J. Huang and A. B. Kahng, "Partitioning-Based Standard-Cell Global Placement with an Exact Objective", in Proc. ACM/IEEE Intl. Symp. on Physical Design, Napa, April 1997, pp. 18-25.
18. A.B. Kahng, I.I. Mǎndoiu, P.A. Pevzner, S. Reda, and A. Zelikovsky, "Border Length Minimization in DNA Array Design", Proc. 2nd International Workshop on Algorithms in Bioinformatics (WABI 2002), R. Guigó and D. Gusfield (Eds.), Springer-Verlag Lecture Notes in Computer Science Series 2452, pp. 435-448.
19. A.B. Kahng, I.I. Mǎndoiu, P.A. Pevzner, S. Reda, and A. Zelikovsky, "Engineering a Scalable Placement Heuristic for DNA Probe Arrays", Proc. 7th Annual International Conference on Research in Computational Molecular Biology (RECOMB 2003), W. miller, M. Vingron, S. Istrail, P. Pevzner and M. Waterman (Eds.), 2003, pp. 148-156.
20. T. Kozawa et al., "Automatic Placement Algorithms for High Packging Density VLSI", Proc. 20th Design Automation Conference (DAC 1983), pp. 175-181.
21. M. Sarrafzadeh and M. Wang, "NRG: GLobal and Detailed Placement", Proc. International Conference on Computer-Aided Design (ICCAD 1997), pp. 532-537.
22. M. Wang, X. Yang and M. Sarrafzadeh, "DRAGON2000: Standard-cell Placement Tool For Large Industry Circuits", Proc. International Conference on Computer-Aided Design (ICCAD 2001), pp. 260-263.
23. R.J. Lipshutz, S.P. Fodor, T.R. Gingeras, D.J. Lockhart, "High density synthetic oligonucleotide arrays" Nat. Genet. 21 (1999), pp. 20-24.
24. B. T. Preas and M. J. Lorenzetti, eds., Physical Design Automation of VLSI Systems, Benjamin-Cummings, 1988.
25. K. Shahookar and P. Mazumder, "VLSI Cell Placement Techniques", Computing Surveys 23(2) (1991), pp. 143-220.
26. L. Steinberg, "The backboard wiring problem: a placement algorithm", SIAM Review 3 (1961), pp. 37-50.
27. J.A. Warrington, R. Todd, and D. Wong (Eds.). Microarrays and cancer research BioTechniques Press/Eaton Pub., Westboro, MA, 2002.