Cargando…

PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search

Motif search is a fundamental problem in bioinformatics with an important application in locating transcription factor binding sites (TFBSs) in DNA sequences. The exact algorithms can report all (l, d) motifs and find the best one under a specific objective function. However, it is still a challengi...

Descripción completa

Detalles Bibliográficos
Autores principales: Yu, Qiang, Huo, Hongwei, Zhang, Yipu, Guo, Hongzhi
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2012
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3485246/
https://www.ncbi.nlm.nih.gov/pubmed/23119020
http://dx.doi.org/10.1371/journal.pone.0048442