Fig. 2From: Efficient sequential and parallel algorithms for finding edit distance based motifsIntersection of motif tries. a Trie for A G∗∪C∗T. b Intersection of trie in Fig. 1 b and trie in Fig. 2 a Back to article page