An efficient algorithm for the identification of structured motifs in DNA promoter sequences.

Ejemplares similares

• Fast and practical algorithms for planted ( l, d ) motif search.
  por: Davila, Jaime
• Bioinformatics algorithms : an active learning approach /
  por: Compeau, Phillip
  Publicado: (2014)
• BASES OF MOTIFS FOR GENERATING REPEATED PATTERNS WITH WILD CARDS.
  por: PISANTI, NADIA
• Bayesian basecalling for DNA sequence analysis using hidden Markov models.
  por: Liang, Kuo-ching
• Accuracy assessment of diploid consensus sequences.
  por: Kim, Jong Hyun