Skip to main content
Figure 5 | BMC Bioinformatics

Figure 5

From: Reconstructing genome mixtures from partial adjacencies

Figure 5

Relating 1-MCP c and 1-MCP . (a) The breakpoint graph B=B ( G , A c ) ; black edges are A ( A c ) and and gray edges are A G . The edge e = {1 t , 6 h } is the only edge in A ( A c ) \A ( A ) . Since e is not in a cycle component of B, we have θ(e) = 1. (b) The breakpoint graph B =B ( G c , A c ) , where G c is a completion of  G and a solution to 1-MCP c . The adjacency f is in A ( G c ) and shown by a gray dashed edge. B' has two cycles, and removing e and f decreases the number of cycles by one.

Back to article page