Design Flow Enhancements for DNA Arrays Andrew B. Kahng 1 Ion I. Mandoiu 2 Sherief Reda 1 Xu Xu 1 Alex Zelikovsky 3 1) CSE Department, University of California at San Diego (2) CSE Department, University of Connecticut (3) CS Department, Georgia State University
Design Flow Enhancements for DNA Arrays . Andrew B. Kahng 1 Ion I. Mandoiu 2 Sherief Reda 1 Xu Xu 1 Alex Zelikovsky 3. (1) CSE Department, University of California at San Diego. (2) CSE Department, University of Connecticut. (3) CS Department, Georgia State University. Outline. - PowerPoint PPT Presentation
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Design Flow Enhancements for DNA Arrays
Andrew B. Kahng1 Ion I. Mandoiu2 Sherief Reda1 Xu Xu1 Alex Zelikovsky3
(1) CSE Department, University of California at San Diego(2) CSE Department, University of Connecticut(3) CS Department, Georgia State University
Introduction to DNA microarrays and manufacturing challenges
Outline
DNA microarray design flowDNA microarray design flow enhancements:
Integration of Probe Placement and EmbeddingIntegration of Probe Selection and Physical Design
Conclusions and future research directions
Uses of DNA arrays
Introduction to DNA microarrays
Practical experiment using DNA arrays
DNA manufacturing process
Problems and challenges in DNA manufacturing process
Introduction to DNA Probe ArraysDNA Arrays (Gene Chips) used in wide range of genomic analyses
Occurs at sites near to intentionally exposed sitesReduce interference
Increase yield
Reduce cost
Design objective: Minimize the border length
Unwanted Illumination and Border Cost
array probes
A 3×3 array
CG AC G
AC ACG AG
CG AG CN
ucle
otid
e D
epos
ition
Seq
uenc
e A
CG
A Mask 1
A
A
A
A
A
Border = 8
Border Reduction
Unwanted illumination Chip’s yield
Introduction to DNA arrays manufacturing challenges
Outline
DNA array design flowDNA array design flow enhancements:
Integration of Probe Placement and EmbeddingIntegration of Probe Selection and Physical Design
Conclusions
Previous Work
Border minimization was first introduced by Feldman and Pevzner. “Gray Code masks for sequencing by hybridization,” Genomics, 1994, pp. 233-235
Work by Hannenhalli et al. gave heuristics for the placement problem by using a TSP formulation.
Kahng et al. “Border length minimization in DNA Array Design,” WABI02, suggested constructive methods for placement and embedding
Kahng et al. “Engineering a Scalable Placement Heuristic for DNA Probe Arrays ,” RECOMB03, suggested scalable placement improvement and embedding techniques
Basic DNA Array Design Flow
Probe Selection
Design of Test Probes
Probe Placement
Probe Embedding
DNA Array
Logic Synthesis
BIST and DFT
Placement
Routing
VLSI Chip
Physical Design
Probe Placement
Probe Embedding
Probe Selection
Design of Test Probes
Logic Synthesis
BIST and DFT
Physical Design
Routing
Placement
Analogy
Design Flow Outline
Physical Design
Degrees of freedom (DOF) in probe embedding DOF exploitation for border conflict reduction
Probe Embedding
Probe Placement Similar probes should be placed close together
Using Dynamic Programming to optimally re-embed a probe
Problem: Optimally embedding a probe with respect to its neighbors
Kahng et al. “Border Length Minimization in DNA Array Design,” WABI02
AAAAAA
Placement Polishing Using Re-Embedding
Use optimal re-embedding algorithm to re-embed each probe with respect to its neighbors
Placement Objective: Minimize Border
Radix-sort the probes in lexicographical order
Probe 1
Probe 2
Probe 3
Probe 4
Probe 5
T A T T
A T A A
A A C A
G GC C
C G G G
1 2 3 25
T A T T
A T A A
A A C A
G GC C
C G G G
1 2 3 25
Problem: How to place the 1-D ordering of probes onto the 2-D chip?
Radix-sorting the probes order reduces discrepancies between adjacent probes
Placement By Threading
1 2 3 25
T A T T
A T A A
A A C A
G GC C
C G G G
Probe 1
Probe 2
Probe 3
Probe 4
Probe 5
Thread on the chip
1
2 3
4 5
Row-Epitaxial Placement Improvement
Array of size 4 × 4
For each site position (i, j):From within the next k rows, find the best probe to place in (i, j) Move the best probe to (i, j) and lock it in this position
Row placement = sort + thread + row epitaxial
Introduction to DNA arrays manufacturing challenges
Outline
DNA array design flowDNA array design flow enhancements:
Integration of Probe Placement and EmbeddingIntegration of Probe Selection and Physical Design
Conclusions
DNA array design flow enhancements
Integration of Probe Placement and Embedding
Integration of Probe Selection and Physical Design
Initial embeddings influence the placement results
Propose and implement two flows
Probe pools add additional degrees of freedom Integrate probe selection into physical design
Propose and implement two flows incorporating probe pools
Physical Design
Probe Selection
Design of Test Probes
Probe Placement
Probe Embedding
DNA Array
Integration of Probe Placement and Embedding
Probe Selection
Design of Test Probes
Probe Placement
Probe Embedding
DNA Array
Integrating placement and probe embedding gives a further reduction in border conflicts.
Probe Placement
Probe Embedding
Analogous to tighter integration between placement and routing in VLSI physical design
Integration of Probe Placement and Embedding
1. Synchronous initial embedding
3. Re-embedding using DP2. Row placement
Flow A
Row EpitaxialRe-embedding
ASAP initial embedding1. As Soon As Possible (ASAP) initial embedding
3. Re-embedding using DP2. Row placement
Flow B
010002000300040005000600070008000900010000
100 200 300 500 Chip size
Conflicts
6%
Placement + Embedding Runtimes
Row EpitaxialRe-embedding
0
2000
4000
6000
8000
10000
12000
100 200 300 500 Chip size
CPU (s)
1. Synchronous initial embedding
3. Re-embedding using DP2. Row placement
Flow A
Row EpitaxialRe-embedding
ASAP initial embedding1. As Soon As Possible (ASAP) initial embedding
3. Re-embedding using DP2. Row placement
Flow B
Second Enhancement: Probe Pools
Probe Selection
Design of Test Probes
Probe Placement
Probe Embedding
DNA Array
Physical Design Problem: Given a probe pool
for every target sequence, select a probe for every target sequence such that the total conflict after placement and alignment is minimum.
Probe 1 Probe 2 Probe 3 Probe 4
Gene Target Sequence
Probe Pool – Pool Size = 4
Integrating Probe Selection and Physical Design
1. Perform ASAP embedding of all probe candidates
3. Re-embedding
2. Run row placement selecting the probe from the pool that gives the minimum conflict
Flow A
ASAP initial embedding1. Perform ASAP embedding of all probe candidates
3. Run row placement using the selected candidates
2. From each probe pool select the probe that fits in the least number of steps using ASAP
Initial ASAP embeddings produce a decent reduction in border conflicts.
Probe pools offer an extra degree of freedom exploited to further reduce border conflicts
Integration of placement and embedding yield up to 6% improvement
Probe pools add an extra 12-13% improvement
Total improvement up to 18% compared to results published in the literature
Open Research Directions
Probe selection should incorporate ability to uniquely detect target sequences present in sample. This should be done with no ambiguity. Methods similar to Boolean covering and test diagnosis can be used.
P1 P2 P3 P4 P5
T1
T2
T3
T4
Each target sequence should have a unique signature
Probes
Target Sequences
Open Research Directions
Stronger placement operators leading to further reduction in the border cost.
Insertion of probe test can benefit from test and diagnosis topics for VLSI circuits.
Future work also covers next generation chips 10k × 10k
Conclusions
We presented a DNA design flow benefiting from experiences of the VLSI design flow
We introduced feedback loops and integrated a number of steps for further reduction in the border cost and hence unwanted illumination
We examined the effects of probe selection on both placement and embedding
We examined the embedding options and placement on the total border cost