Mining, compressing and classifying with extensible motifs |
| |
Authors: | Alberto Apostolico Matteo Comin Laxmi Parida |
| |
Institution: | Dipartimento di Ingegneria dell'lnformazione, Università di Padova, Padova, Italy. axa@dei.unipd.it |
| |
Abstract: | Background Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have
recently proven a valuable notion also in the design of data compression schemes. Informally, a motif is a string of intermittently
solid and wild characters that recurs more or less frequently in an input sequence or family of sequences. Motif discovery
techniques and tools tend to be computationally imposing, however, special classes of "rigid" motifs have been identified
of which the discovery is affordable in low polynomial time. |
| |
Keywords: | |
本文献已被 PubMed SpringerLink 等数据库收录! |
|