Improved bounds on the average length of longest common subsequences.

George S. Lueker

Published in: J. ACM (2009)

Keyphrases

lower bound
databases
upper bound
neural network
path length
longest common subsequence
worst case
improved algorithm
upper and lower bounds
real world
artificial intelligence
social networks
dynamic time warping
variable length
fixed length
average case