PMS6MC: A Multicore Algorithm for Motif Discovery
Related Experiment Video
Updated: Apr 22, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes
Published on: May 31, 2011
Shibdas Bandyopadhyay1, Sartaj Sahni2, Sanguthevar Rajasekaran3
1VMware Inc, Palo Alto,CA 94304, sbandyopadhyay@vmware.com.
Abstract:
We develop an efficient multicore algorithm, PMS6MC, for the (l, d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is currently the fastest single-core algorithm for motif discovery in large instances. The speedup, relative to PMS6, attained by our multicore algorithm ranges from a high of 6.62 for the (17,6) challenging instances to a low of 2.75 for the (13,4) challenging instances on an Intel 6-core system. We estimate that PMS6MC is 2 to 4 times faster than other parallel algorithms for motif search on large instances.
More Related Videos
Related Concept Videos
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to...
Modern Molecular Taxonomy
Conservation of Protein Domains
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
DNA Microarrays

