Cargando…
Encoded Expansion: An Efficient Algorithm to Discover Identical String Motifs
A major task in computational biology is the discovery of short recurring string patterns known as motifs. Most of the schemes to discover motifs are either stochastic or combinatorial in nature. Stochastic approaches do not guarantee finding the correct motifs, while the combinatorial schemes tend...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Public Library of Science
2014
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4037181/ https://www.ncbi.nlm.nih.gov/pubmed/24871320 http://dx.doi.org/10.1371/journal.pone.0095148 |