Extraction of Infrequent Simple Motifs from a Finite Set of Sequences using a Lattice Structure

Abstract

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.

Bottom-k document retrieval

“…It is also useful for studying negative association rules in data mining [32,7], for finding adverse drug effects in medicine [17], for intrusion detection in computer systems [25], for detecting anomalies in system logs [3], etc. Our problem also arises as a subproblem of finding rare motifs (patterns with don't cares of various kinds) [9], which has potential applications to bioinformatic problems such as identifying absent words in genomic sequences [14] or proteins involved in parasitism [30].…”