RefSelect: a reference sequence selection algorithm for planted (l, d) motif search

BACKGROUND: The planted (l, d) motif search (PMS) is an important yet challenging problem in computational biology. Pattern-driven PMS algorithms usually use k out of t input sequences as reference sequences to generate candidate motifs, and they can find all the (l, d) motifs in the input sequences...

Descripción completa

Detalles Bibliográficos
Autores principales: Yu, Qiang, Huo, Hongwei, Zhao, Ruixing, Feng, Dazheng, Vitter, Jeffrey Scott, Huan, Jun
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2016
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4959363/
https://www.ncbi.nlm.nih.gov/pubmed/27454113
http://dx.doi.org/10.1186/s12859-016-1130-6

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4959363/
https://www.ncbi.nlm.nih.gov/pubmed/27454113
http://dx.doi.org/10.1186/s12859-016-1130-6

Ejemplares similares