I'm a freshman in Computer Science and I'm studying bioinformatics sequence alignment algorithms.My understanding of a greedy algorithm is one that takes the best decision for a particular instance in order to find a general best decision. By that definition, would the basic dynamic programming pairwise alignment algorithm be considered greedy?
Is the dynamic programming pairwise alignment algorithm considered greedy?
dynamic programming;bioinformatics