| Bioinformatics & Computational Biology Student Seminar Series
Greedy Closure Evolutionary Algorithms
Ling Guo
Major professors: Dan Ashlock and Pat Schnable
Iowa State University |
Friday, March 29, 2002
1:10 p.m.
1420 Molecular Biology Building
|
Abstract
Greedy algorithms are familiar to most software developers. A few, like the algorithm for finding a minimal-weight spanning tree, can be proven to yield optimal results. Problems such as graph coloring or the traveling salesman problem admit a plethora of greedy algorithms which yield sub-optimal results. The control of greedy algorithms seems a natural target for evolutionary computation but relatively few papers have appeared. There are several possible approaches. The approach explored here consists of making small modifications in the order of presentation of potential parts of a growing structure as a means of deflecting the greedy algorithm's behavior. The role of evolutionary computation is to locate the modifications of the order of presentation. We demonstrate this technique on the location of embeddable DNA markers for genetic libraries. The technique has the potential for broad application.
|