Mining, compressing and classifying with extensible motifs

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. Results: In the present work, "extensible" motifs are considered such that each sequence of gaps comes endowed with some elasticity, whereby the same pattern may be stretched to fit segments of the source that match all the solid characters but are otherwise of different lengths. A few applications of this notion are then described. In applications of data compression by textual substitution, extensibl...

• Type: Journal
• Year: 2006
• Where: ALMOB
• Authors: Alberto Apostolico, Matteo Comin, Laxmi Parida
• Keywords: ALMOB 2006, Data Compression, Data Compression Schemes, Extensible Motifs