Skip to main content
Figure 6 | Algorithms for Molecular Biology

Figure 6

From: WildSpan: mining structured motifs from protein sequences

Figure 6

A running example. (a) A sample input sequence database (SDB) containing S q (reference sequence/query sequence), S x and S y . The solid arrows show the scanning range of the bounded-prefix-growth procedure under the intra-block gap constraint (γmax = 2) with respect to the pattern block 'C-x-H' (C - H) marked by black frames. The red, blue and green solid arrows denote the scanning residues with 'C-x-H' as the prefix and with gap lengths of zero, one, and two, respectively. Two other satisfied pattern blocks are marked by distinct background colours. The symbol '-' in the sequences represents the residues that cannot contribute to forming any patterns in this example; (b) Three satisfied pattern blocks; (c) Three satisfied W-patterns; (d) An example of how the maximum relative flexibility with respect to the reference sequence S q is employed to discover W-patterns.

Back to article page