Fig. 1
How the insertion ordering is computed. We show the threshold graph \(TG(D,\infty )\) and a minimum spanning tree S in red. A possible insertion ordering produced by a BFS on S starting at e is e, a, c, d, b
Fig. 1 | Algorithms for Molecular Biology