Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index.

Tae Sik Han Seung-Kyu Ko Jaewoo Kang

Published in: MLDM (2007)

Keyphrases

subsequence matching
longest common subsequence
sequence matching
dynamic time warping
indexing structure
sequential data
fixed size
spatial objects
lower bounding
similarity search
similarity measure
sequence databases