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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of bioinformatics research and applications Ročník 6; číslo 3; s. 260
Hlavní autoři: Arock, Michael, Reddy, Srinivasulu, Reddy, A V
Médium: Journal Article
Jazyk:angličtina
Vydáno: Switzerland 2010
Témata:
Algorithms
Amino Acid Motifs
Amino Acid Sequence
Computational Biology - methods
Nucleotides - chemistry
Pattern Recognition, Automated
Sequence Analysis
ISSN:1744-5485
On-line přístup:Zjistit podrobnosti o přístupu
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1744-5485
DOI:10.1504/IJBRA.2010.034074