ABSTRACT
In the previous chapter, we described a whole array of possible characterizations of patterns, starting from the simple l-mer (solid patterns) to rigid patterns with dont care characters to extensible patterns with variable length gaps. Further, the element of a pattern could be drawn from homologous sets (multi-sets). In this chapter we take these intuitive definitions to fruition by designing practical discovery algorithms and devising measures to evaluate the significance of the results.
