Skip to main content
. 2013 Jul 9;14(Suppl 5):S18. doi: 10.1186/1471-2105-14-S5-S18

Figure 2.

Figure 2

Thick black lines are lower bounds on feasibility which holds for all algorithms, and colored curves are performance achieved by specific algorithms. Four such curves are shown: the greedy algorithm and three de Brujin graph based algorithms.