About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
RECOMB 1998
Conference paper
Motif discovery without alignment or enumeration
Abstract
In this paper, we outline a novel combinatorial algorithm for the discovery of rigid motifs contained in a set of input sequences. This is achieved without pair-wise alignment of the input sequences or enumeration of the entire motif space (solution space). Additionally, the reported motifs are guaranteed to be maximal in both length and composition. Internal repeats and patterns that repeat across sequences are treated uniformly by the algorithm. Results on real datasets are briefly discussed.