An inexact-suffix-tree-based algorithm for detecting extensible patterns

摘要: Given an input sequence of data, a rigid pattern is repeating sequence, possibly interspersed with dont-care characters. The data could be characters or sets even real values. In practice, the patterns motifs interest are ones that also allow variable number gaps (or characters): these spacers termed extensible bioinformatics context, similar have been called flexible motifs. extensibility succinctly defined by single integer parameter D ≥ 1 which interpreted as allowable space to between and two successive solid in reported motif. We introduce structure inexact-suffix tree present algorithm based on this structure. This has tested primarily biological such DNA protein sequences. However generality system makes it equally applicable other mining, clustering, knowledge extraction applications.