A carregar...
PMS6: A Fast Algorithm for Motif Discovery
We propose a new algorithm, PMS6, for the (l, d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. The run time ratio PMS5/PMS6, where PMS5 is the fastest previously known algorithm for motif disco...
Na minha lista:
| Main Authors: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2012
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3744182/ https://ncbi.nlm.nih.gov/pubmed/23959399 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1109/ICCABS.2012.6182627 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|