Skip to main content
. 2013 Apr 19;8(4):e61183. doi: 10.1371/journal.pone.0061183

Figure 5. Data Structures.

Figure 5

(a) The checklist. In the ISMA algorithm, the circles represent motif nodes (b) The motif iterator. (c) The priority queue map. (d) The priority object. It is assumed that the motif has k nodes.