An almost-linear time and linear space algorithm for the longest common subsequence problem.

J. Y. Guo Frank K. Hwang

Published in: Inf. Process. Lett. (2005)

Keyphrases

linear space
learning algorithm
np hard
dynamic programming
objective function
worst case
computational complexity
particle swarm optimization
exhaustive search
similarity measure
feature space
probabilistic model
upper bound
high accuracy