Cargando…
Efficient sequential and parallel algorithms for finding edit distance based motifs
BACKGROUND: Motif search is an important step in extracting meaningful patterns from biological data. The general problem of motif search is intractable and there is a pressing need to develop efficient, exact and approximation algorithms to solve this problem. In this paper, we present several nove...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5001234/ https://www.ncbi.nlm.nih.gov/pubmed/27557423 http://dx.doi.org/10.1186/s12864-016-2789-9 |