Sequence Assembly - Greedy Algorithm

Greedy Algorithm

Given a set of sequence fragments the object is to find the Shortest common supersequence.

  1. calculate pairwise alignments of all fragments
  2. choose two fragments with the largest overlap
  3. merge chosen fragments
  4. 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:

    “While greedy good-doers, beneficent beasts of prey,
    Swarm over their lives enforcing benefits ...”
    —Robert Frost (1874–1963)