Cargando…
A hybrid method for the exact planted (l, d) motif finding problem and its parallelization
BACKGROUND: Given a set of DNA sequences s(1), ..., s(t), the (l, d) motif problem is to find an l-length motif sequence M , not necessary existing in any of the input sequences, such that for each sequence s(i), 1 ≤ i ≤ t, there is at least one subsequence differing with at most d mismatches from M...
Autores principales: | Abbas, Mostafa M, Abouelhoda, Mohamed, Bahig, Hazem M |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2012
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3521218/ https://www.ncbi.nlm.nih.gov/pubmed/23281969 http://dx.doi.org/10.1186/1471-2105-13-S17-S10 |
Ejemplares similares
-
A fast exact sequential algorithm for the partial digest problem
por: Abbas, Mostafa M., et al.
Publicado: (2016) -
PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem
por: Dinh, Hieu, et al.
Publicado: (2011) -
A survey of DNA motif finding algorithms
por: Das, Modan K, et al.
Publicado: (2007) -
Clustering protein environments for function prediction: finding PROSITE motifs in 3D
por: Yoon, Sungroh, et al.
Publicado: (2007) -
STELLAR: fast and exact local alignments
por: Kehr, Birte, et al.
Publicado: (2011)