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

제목
Efficient Subsequence Matching Using the Longest Common Subsequence with a Dual Match Index
저자
Jaewoo Kang
학회명
International Conference on Machine Learning and Data Mining in Pattern Recognition
개최지
Leipzig, Germany
개최국가
독일
학회 개최일
2007-07-18 ~ 2007-07-20