Cargando…
qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences
Detection of rare events happening in a set of DNA/protein sequences could lead to new biological discoveries. One kind of such rare events is the presence of patterns called motifs in DNA/protein sequences. Finding motifs is a challenging problem since the general version of motif search has been p...
Autores principales: | Dinh, Hieu, Rajasekaran, Sanguthevar, Davila, Jaime |
---|---|
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/PMC3404135/ https://www.ncbi.nlm.nih.gov/pubmed/22848493 http://dx.doi.org/10.1371/journal.pone.0041425 |
Ejemplares similares
-
qPMS9: An Efficient Algorithm for Quorum Planted Motif Search
por: Nicolae, Marius, et al.
Publicado: (2015) -
CORRIGENDUM: qPMS9: An Efficient Algorithm for Quorum Planted Motif Search
por: Nicolae, Marius, et al.
Publicado: (2015) -
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
por: Dinh, Hieu, et al.
Publicado: (2011) -
PMS: A Panoptic Motif Search Tool
por: Dinh, Hieu, et al.
Publicado: (2013) -
A speedup technique for (l, d)-motif finding algorithms
por: Rajasekaran, Sanguthevar, et al.
Publicado: (2011)