Loading...

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...

Fuld beskrivelse

Na minha lista:
Bibliografiske detaljer
Main Authors: Nicolae, Marius, Rajasekaran, Sanguthevar
Format: Artigo
Sprog:Inglês
Udgivet: BioMed Central 2014
Fag:
Online adgang: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: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!