Login / Signup

Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences.

Sylvain ForêtMiriam R. KantorovitzConrad J. Burden
Published in: BMC Bioinform. (2006)
Keyphrases
  • exact and approximate
  • string matching
  • data sets
  • dynamic programming
  • n gram
  • asymptotically optimal
  • optimal solution