Cargando…
Efficient motif finding algorithms for large-alphabet inputs
BACKGROUND: We consider the problem of identifying motifs, recurring or conserved patterns, in the biological sequence data sets. To solve this task, we present a new deterministic algorithm for finding patterns that are embedded as exact or inexact instances in all or most of the input strings. RES...
| Autores principales: | , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2010
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2966288/ https://www.ncbi.nlm.nih.gov/pubmed/21034426 http://dx.doi.org/10.1186/1471-2105-11-S8-S1 |