Login / Signup

An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats in Biological Sequences.

Atheer A. MatroudChristopher P. TuffleyMichael D. Hendy
Published in: J. Comput. Biol. (2011)
Keyphrases
  • biological sequences
  • k means
  • dynamic programming
  • motif discovery
  • dna sequences
  • multiple sequence alignment
  • motif finding
  • tandem repeats
  • similarity search
  • protein sequences
  • sequence alignment