ol>
<li>calculate pairwise alignments of all fragments</li>
<li>choose two fragments with the largest overlap</li>
<li>merge chosen fragments</li>
<li>repeat step 2. and 3. until only one fragment is left</li>
</ol>
<p>The result is a suboptimal solution to the problem.<sup class="noprint Inline-Template Template-Fact" style="white-space:nowrap;">[<i><a href="//en.wikipedia.org/wiki/Wikipedia:Citation_needed" title="Wikipedia:Citation needed"><span title="This claim needs references to reliable sources. (Ja