## Ref Greedy Algorithm

Zhang, Z., S. Schwartz, L. Wagner and W. Miller (2000). A greedy algorithm for aligning DNA sequences. J. Comput. Biol. 7: 203-214. (Discusses how a greedy algorithm can be faster than a traditional dynamic program for aligning DNA sequences differing only by errors of sequence into a new, theoretically optimal sequence.)

Greedy coins. Wagon, S. http://library.wolfram.com/infocenter/Math-Source/5187/. This reference gives a simple, 'everyday' example of a greedy algorithm: A system of coins is called "nice" if it can represent any amount of money, and the greedy algorithm — repeatedly take the largest coin that will fit — for making change, always uses the smallest number of coins possible. The American system of coins — 1,5, 10, 25, 50 — is nice since, for any number of cents A, the greedy algorithm for breaking A into a combination of coins will use the minimal number of coins. For example, a greedy breakdown of \$1.38 is 2 half-dollars, a quarter, a dime, and then 3 pennies, and \$1.38 cannot be obtained in fewer than 7 coins. Any total can be made by using only pennies.'

0 0