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:
“Oh mother,
her in your lap,
as good as a bowlful of clouds,
I your greedy child
am given your breast,
the sea wrapped in skin.”
—Anne Sexton (1928–1974)