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:
“Such is the end of all who are greedy for gain; it takes away the life of its possessors.”
—Bible: Hebrew, Proverbs 1:19.
Related Phrases
Related Words