Issue No. 12 - December (1991 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.106998
<p>A string or sequence is a linear array of symbols that come from an alphabet. Due to unknown substitutions, insertions, and deletions of symbols, a sequence cannot be treated like a vector or a tuple of a fixed number of variables. The synthesis of an ensemble of sequences is a sequence of random elements that specify the probabilities of occurrence of the different symbols at the corresponding sites of the sequences. The synthesis is determined by a hierarchical sequence synthesis procedure (HSSP), which returns not only the taxonomic hierarchy of the whole ensemble of sequences but also the alignment and the synthesis of a group (a subset of the ensemble) of the sequences at each level of the hierarchy. The HSSP does not require the ensemble of sequences to be presented in the form of a tabulated array of data, the hierarchical information of the data, or the assumption of a stochastic process. The authors present the concept of sequence synthesis and the applicability of the HSSP as a supervised classification procedure as well as an unsupervised classification procedure.</p>
sequences synthesis; sequences recognition; alphabet; hierarchical sequence synthesis procedure; taxonomic hierarchy; alignment; supervised classification; unsupervised classification procedure; pattern recognition; probability
S. Chan and A. Wong, "Synthesis and Recognition of Sequences," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 13, no. , pp. 1245-1255, 1991.