The.Algorithm.Design.Manual.Springer-Verlag.1998

The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998

18.04.2013 Views

Genetic Algorithms Algorithms Mon Jun 2 23:33:50 EDT 1997 file:///E|/BOOK/BOOK3/NODE98.HTM (2 of 2) [19/1/2003 1:29:38]

War Story: Annealing Arrays Next: Parallel Algorithms Up: Combinatorial Search and Heuristic Previous: Genetic Algorithms War Story: Annealing Arrays The war story of Section reported how we used advanced data structures to simulate a new method for sequencing DNA. Our method, interactive sequencing by hybridization (SBH), involved building arrays of specific oligonucleotides on demand. Although the simulation results were very promising to us, most biologists we encountered were suspicious. They needed to see our technique proven in the lab before they would take it seriously. But we got lucky. A biochemist at Oxford University, got interested in our technique, and moreover he had in his laboratory the equipment we needed to test it out. The Southern Array Maker [Sou96], manufactured by Beckman Instruments, could prepare discrete oligonucleotide sequences in 64 parallel rows across a polypropylene substrate. The device constructs arrays by appending single characters to each cell along specific rows and columns of arrays. Figure shows how to construct an array of all purine (A or G) 4-mers by building the prefixes along rows and the suffixes along columns. This technology provided an ideal environment for testing the feasibility of interactive SBH in a laboratory, because with proper programming it gave an inexpensive way to fabricate a wide variety of oligonucleotide arrays on demand. Figure: A prefix-suffix array of all purine 4-mers. But we had to provide the proper programming. Fabricating complicated arrays requires solving a difficult combinatorial problem. We were given as input a set S of n strings (representing oligonucleotides) to fabricate an array (where m=64 on the Southern apparatus). We had to produce a schedule of row and column commands to realize the set of strings S. We proved that the problem of designing dense arrays was NP-complete, but that didn't really matter. My student Ricky Bradley and I had to solve it anyway. file:///E|/BOOK/BOOK3/NODE99.HTM (1 of 4) [19/1/2003 1:29:40]

War Story: Annealing Arrays<br />

Next: Parallel <strong>Algorithm</strong>s Up: Combinatorial Search and Heuristic Previous: Genetic <strong>Algorithm</strong>s<br />

War Story: Annealing Arrays<br />

<strong>The</strong> war story of Section reported how we used advanced data structures to simulate a new method<br />

for sequencing DNA. Our method, interactive sequencing by hybridization (SBH), involved building<br />

arrays of specific oligonucleotides on demand. Although the simulation results were very promising to<br />

us, most biologists we encountered were suspicious. <strong>The</strong>y needed to see our technique proven in the lab<br />

before they would take it seriously.<br />

But we got lucky. A biochemist at Oxford University, got interested in our technique, and moreover he<br />

had in his laboratory the equipment we needed to test it out. <strong>The</strong> Southern Array Maker [Sou96],<br />

manufactured by Beckman Instruments, could prepare discrete oligonucleotide sequences in 64 parallel<br />

rows across a polypropylene substrate. <strong>The</strong> device constructs arrays by appending single characters to<br />

each cell along specific rows and columns of arrays. Figure shows how to construct an array of all<br />

purine (A or G) 4-mers by building the prefixes along rows and the suffixes along columns. This<br />

technology provided an ideal environment for testing the feasibility of interactive SBH in a laboratory,<br />

because with proper programming it gave an inexpensive way to fabricate a wide variety of<br />

oligonucleotide arrays on demand.<br />

Figure: A prefix-suffix array of all purine 4-mers.<br />

But we had to provide the proper programming. Fabricating complicated arrays requires solving a<br />

difficult combinatorial problem. We were given as input a set S of n strings (representing<br />

oligonucleotides) to fabricate an array (where m=64 on the Southern apparatus). We had to produce a<br />

schedule of row and column commands to realize the set of strings S. We proved that the problem of<br />

designing dense arrays was NP-complete, but that didn't really matter. My student Ricky Bradley and I<br />

had to solve it anyway.<br />

file:///E|/BOOK/BOOK3/NODE99.HTM (1 of 4) [19/1/2003 1:29:40]

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!