Motif patterns in 2D

Motif patterns consisting of sequences of intermixed solid and don't care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In order to alleviate the exponential growth of such motifs, notions of maximal saturation and irredundancy have been formulated, whereby more or less compact subsets of the set of all motifs can be extracted, that are capable of expressing all others by suitable combinations. In this paper, we introduce the notion of maximal irredundant motifs in a two-dimensional array and develop initial properties and a combinatorial argument that poses a linear bound on the total number of such motifs. The remainder of the paper presents approaches to the discovery of irredundant motifs both by off-line and incremental algorithms.

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Alberto Apostolico, Laxmi Parida, Simona E. Rombo
• Keywords: Irredundant Motifs, Maximal Irredundant Motifs, Pattern Discovery Problems, TCS 2008, Theoretical Computer Science