These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


Pubmed for Handhelds

PUBMED FOR HANDHELDS

Search MEDLINE/PubMed

  • Title: An extension and novel solution to the (l,d)-motif challenge problem.
    Author: Styczynski MP, Jensen KL, Rigoutsos I, Stephanopoulos GN.
    Journal: Genome Inform; 2004; 15(2):63-71. PubMed ID: 15706492.
    Abstract:
    The (l,d)-motif challenge problem, as introduced by Pevzner and Sze, is a mathematical abstraction of the DNA functional site discovery task. Here we expand the (l,d)-motif problem to more accurately model this task and present a novel algorithm to solve this extended problem. This algorithm is guaranteed to find all (l,d)-motifs in a set of input sequences with unbounded support and length. We demonstrate the performance of the algorithm on publicly available datasets and show that the algorithm deterministically enumerates the optimal motifs.
    [Abstract] [Full Text] [Related] [New Search]