Skip to main content
Figure 4 | BMC Bioinformatics

Figure 4

From: Reconstructing genome mixtures from partial adjacencies

Figure 4

Adding adjacencies to a partial genome Gto solve the 1-MCP c . (a) The breakpoint graph B ( G , A ) . Gray edges indicate adjacencies of  G, black edges indicate adjacencies of  A, and the dotted edges connect extremities of the same gene. The set of free vertices is F ( G ) = { 1 t , 1 h , 2 t , 2 h , 4 t , 4 h , 5 t , 6 t } . (b) The free-extremities graph R ( G , A ) consists of two even cycles. Blue edges are desired edges D A ( G ) and red edges are excluded edges E ( G ) . (c) The resulting breakpoint graph after adding adjacency {1 h , 4 h }. (d) The resulting free-extremities graph after update(R, {1 h , 4 h }). The vertices 1 h and 4 h are no longer free extremities and thus are removed during update(R, {1 h , 4 h }).

Back to article page

BMC Bioinformatics

ISSN: 1471-2105

Contact us