Greedy Algorithm
Given a set of sequence fragments the object is to find the Shortest common supersequence.
- calculate pairwise alignments of all fragments
- choose two fragments with the largest overlap
- merge chosen fragments
- repeat step 2. and 3. until only one fragment is left
The result is a suboptimal solution to the problem.
Read more about this topic: Sequence Assembly
Famous quotes containing the word greedy:
“Don’t make your enemies happy.
Make up with your lover,
who’s greedy to be back
in your good graces.
Daughter,
because you’ve taken anger to extremes,
you won’t amount
to a hill of beans.”
—Hla Stavhana (c. 50 A.D.)