QPMS9: An efficient algorithm for quorum planted motif search

Abstract

Discovering patterns in biological sequences is a crucial problem. For example, the identification of patterns inDNAsequences has resulted in the determination of open reading frames, identification of gene promoter elements, intron/exon splicing sites, and SH RNAs, location of RNA degradation signals, identification of alternative splicing sites, etc. In protein sequences, patterns have led to domain identification, location of protease cleavage sites, identification of signal peptides, protein interactions, determination of protein degradation elements, identification of protein trafficking elements, discovery of short functional motifs, etc. In this paper we focus on the identification of an important class of patterns, namely, motifs. We study the (,l d) motif search problem or Planted Motif Search (PMS). PMS receives as input n strings and two integers , andd. It returns all sequencesM of length , that occur in each input string, where each occurrence differs fromM in at most d positions. Another formulation is quorum PMS (qPMS), where the motif appears in at least q% of the strings. We introduce qPMS9, a parallel exact qPMS algorithm that offers significant runtime improvements on DNA and protein datasets. qPMS9 solves the challenging DNA (,l d)-instances (28, 12) and (30, 13). The source code is available at https://code.google.com/p/qpms9/.