Fig. 1
From: Efficient sequential and parallel algorithms for finding edit distance based motifs

Inserting into motif trie for Σ={A,C,G,T} and l=3. a After inserting ∗G T into empty trie. b After inserting another string A∗C
From: Efficient sequential and parallel algorithms for finding edit distance based motifs
Inserting into motif trie for Σ={A,C,G,T} and l=3. a After inserting ∗G T into empty trie. b After inserting another string A∗C