Data Structures.
Published in Figshare • Dec 2, 2015
NobleIDNI3P730W532R741S658
Authors:,,
Sofie Demeyer (404602)
Tom Michoel (29810)
Jan Fostier (404603)
Abstract
<p>(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.</p>
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!