Improved bounds on the average length of longest common subsequences.

George S. Lueker

Published in: SODA (2003)

Keyphrases

lower bound
upper bound
worst case
improved algorithm
database
longest common subsequence
information systems
case study
multiscale
np hard
error bounds
dynamic time warping
path length