Extraction of Infrequent Simple Motifs from a Finite Set of Sequences using a Lattice Structure
Tarek El-Falah, Thierry Lecroq and Mourad Elloumi
Affiliation: Laboratory of Technologies of Information and Communication and Electrical Engineering, Higher School of Sciences and Technologies of Tunis, 1008 Tunis, Tunisia.
Keywords: Lattice, algorithms, strings, infrequent motifs, patents.
In this paper we present a method for finding infrequent simple motifs in a finite set of sequences. The method
uses a lattice structure and minimal forbidden patterns. It is based on a method for solving the Simple Motif Problem and
has the potential to discover new patents in biological macromolecules. Indeed, the extracted motifs can help biologists to
learn about the biological functions of these macromolecules and, consequently, can help them to understand the
mechanisms of the biological processes in which these sequences are involved.
Rights & PermissionsPrintExport