Sign in

Optimal spaced seeds for faster approximate string matching.

Martin Farach-ColtonGad M. LandauSüleyman Cenk SahinalpDekel Tsur
Published in: J. Comput. Syst. Sci. (2007)
Keyphrases
  • approximate string matching
  • dynamic programming
  • optimal solution
  • n gram
  • string matching
  • genomic databases
  • image compression
  • edit distance
  • lower bound
  • suffix array