journal menu
![[Figure 2]](ip5005fig2mag.jpg)
|
|
Figure 2
Schematic representation of the fragment-assembly algorithm. The graphs represent query fragments and aligned matching fragments (black and red, respectively; edge weights and directions are not shown for clarity). In the first step, graph nodes corresponding to the query fragments are merged with all remaining nodes within a distance of 1.0 Å (a). Next, the remaining nodes are merged with their neighbours within a distance of 1.0 Å in an arbitrary order (b). Finally, branching edges are removed (dashed line) (c). |
![[Figure 2]](ip5005fig2.jpg)
 | STRUCTURAL BIOLOGY |
ISSN: 2059-7983
access
