Cargando…
A speedup technique for (l, d)-motif finding algorithms
BACKGROUND: The discovery of patterns in DNA, RNA, and protein sequences has led to the solution of many vital biological problems. For instance, the identification of patterns in nucleic acid sequences has resulted in the determination of open reading frames, identification of promoter elements of...
Autores principales: | Rajasekaran, Sanguthevar, Dinh, Hieu |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3063805/ https://www.ncbi.nlm.nih.gov/pubmed/21385438 http://dx.doi.org/10.1186/1756-0500-4-54 |
Ejemplares similares
-
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
por: Dinh, Hieu, et al.
Publicado: (2011) -
qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences
por: Dinh, Hieu, et al.
Publicado: (2012) -
PMS: A Panoptic Motif Search Tool
por: Dinh, Hieu, et al.
Publicado: (2013) -
Efficient sequential and parallel algorithms for finding edit distance based motifs
por: Pal, Soumitra, et al.
Publicado: (2016) -
Efficient sequential and parallel algorithms for planted motif search
por: Nicolae, Marius, et al.
Publicado: (2014)