Traditionally sequence motifs and domains, also called signatures, are defined such that insertions, deletions and mismatched regions are small compared with matched regions. We introduce an algorithm for the identification of generalized sequence signatures that can be composed of windows distributed throughout the sequence. We use an approach that is based on clustering analysis of recurring subsequences, to which we refer as symbols, of a predefined length. Symbols are not required to be located in close proximity to each other. The clustering algorithm group sequences so as to maximize the number of shared symbols among sequences. We evaluate our signatures in comparison to those obtained from the InterPro database, and show that our approach has benefits for deriving sequence annotations compared with InterPro's signatures.
['Dietmar H. Dorr', 'Anne M. Denton']
Generalized Sequence Signatures through Symbolic Clustering