Related Experiment Video
Updated: Jun 11, 2026

Using SCOPE to Identify Potential Regulatory Motifs in Coregulated Genes
Published on: May 31, 2011
A parallel combinatorial algorithm for subtle motifs
Michael Arock1, Srinivasulu Reddy, A V Reddy
1Department of Computer Applications, National Institute of Technology, Tiruchirappalli 620 015, Tamil Nadu, India. michael@nitt.edu
Abstract:
In bioinformatics, motif finding is one of the most common problems. It is to locate recurring patterns in the sequence of nucleotides or amino acids. The main difficulty of the problem is that the patterns are not exact matches owing to biological mutations. It is NP-complete. Within the literature many solutions have been provided for this challenging problem. Nevertheless, they do not address certain subtleties. Among them, one is addressed by Hu (2003). In this paper, we propose a parallel combinatorial algorithm for subtle motif finding on a Shared Memory Multiprocessor model. We suggest a method of implementation for the same.
Related Concept Videos
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Combinatorial Gene Control
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
Convergence of Sequences
Second Uniqueness Theorem
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
Factorial Design
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
