Cargando…
qPMS9: An Efficient Algorithm for Quorum Planted Motif Search
Discovering patterns in biological sequences is a crucial problem. For example, the identification of patterns in DNA sequences has resulted in the determination of open reading frames, identification of gene promoter elements, intron/exon splicing sites, and SH RNAs, location of RNA degradation sig...
Autores principales: | Nicolae, Marius, Rajasekaran, Sanguthevar |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4295094/ https://www.ncbi.nlm.nih.gov/pubmed/25589474 http://dx.doi.org/10.1038/srep07813 |
Ejemplares similares
-
CORRIGENDUM: qPMS9: An Efficient Algorithm for Quorum Planted Motif Search
por: Nicolae, Marius, et al.
Publicado: (2015) -
qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences
por: Dinh, Hieu, et al.
Publicado: (2012) -
Efficient sequential and parallel algorithms for planted motif search
por: Nicolae, Marius, et al.
Publicado: (2014) -
PMS: A Panoptic Motif Search Tool
por: Dinh, Hieu, et al.
Publicado: (2013) -
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
por: Dinh, Hieu, et al.
Publicado: (2011)