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

Tae Sik Han Seung-Kyu Ko Jaewoo Kang Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index. 585-600 2007 conf/mldm/2007 MLDM http://dx.doi.org/10.1007/978-3-540-73499-4_44 db/conf/mldm/mldm2007.html#HanKK07