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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of bioinformatics research and applications Jg. 6; H. 3; S. 260
Hauptverfasser:	Arock, Michael, Reddy, Srinivasulu, Reddy, A V
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Switzerland 2010
Schlagworte:	Algorithms Amino Acid Motifs Amino Acid Sequence Computational Biology - methods Nucleotides - chemistry Pattern Recognition, Automated Sequence Analysis
ISSN:	1744-5485
Online-Zugang:	Weitere Angaben
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!