Skip to main content
. 2011 Oct 11;6:23. doi: 10.1186/1748-7188-6-23

Figure 1.

Figure 1

Top level illustration of the algorithm of Section 2.3 for construction of the similarity graph for three sequences. To simplify the illustration we do not consider here the reverse complement reads and the filtering of Step 2. The encoding that corresponds to the tree can be found in Section 2.4.