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: | , , |
---|---|
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 |