Wordt geladen...
Efficient sequential and parallel algorithms for planted motif search
BACKGROUND: Motif searching is an important step in the detection of rare events occurring in a set of DNA or protein sequences. One formulation of the problem is known as (l,d)-motif search or Planted Motif Search (PMS). In PMS we are given two integers l and d and n biological sequences. We want t...
Bewaard in:
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
BioMed Central
2014
|
| Onderwerpen: | |
| Online toegang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3924400/ https://ncbi.nlm.nih.gov/pubmed/24479443 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1471-2105-15-34 |
| Tags: |
Voeg label toe
Geen labels, Wees de eerste die dit record labelt!
|