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:
“There is no dream of love, however ideal it may be, which does not end up with a fat, greedy baby hanging from the breast.”
—Charles Baudelaire (1821–1867)
Related Phrases
Related Words