Login / Signup

N-SAMSAM : A simple and faster algorithm for solving approximate matching in DNA sequences.

Bing NiMan Hon WongKwong-Sak Leung
Published in: IEEE Congress on Evolutionary Computation (2008)
Keyphrases
  • dna sequences
  • approximate matching
  • string matching
  • database
  • dynamic programming
  • probabilistic model
  • space complexity
  • matching algorithm
  • motif discovery