A parallel combinatorial algorithm for subtle motifs

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...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of bioinformatics research and applications Vol. 6; no. 3; p. 260
Main Authors:	Arock, Michael, Reddy, Srinivasulu, Reddy, A V
Format:	Journal Article
Language:	English
Published:	Switzerland 2010
Subjects:	Algorithms Amino Acid Motifs Amino Acid Sequence Computational Biology - methods Nucleotides - chemistry Pattern Recognition, Automated Sequence Analysis
ISSN:	1744-5485
Online Access:	Get more information
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
Bibliography:	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23
ISSN:	1744-5485
DOI:	10.1504/IJBRA.2010.034074