Login / Signup

On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet.

Ioan Tomescu
Published in: Theor. Comput. Sci. (1996)
Keyphrases
  • finite alphabet
  • edit distance
  • pattern matching
  • edit operations
  • dynamic time warping
  • dynamic programming