Zemin Chao, Hong Gao 0001, Yinan An, Jianzhong Li. The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem. PVLDB, 15(7):1453-1465, 2022. [doi]
@article{ChaoGAL22,
title = {The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem},
author = {Zemin Chao and Hong Gao 0001 and Yinan An and Jianzhong Li},
year = {2022},
url = {https://www.vldb.org/pvldb/vol15/p1453-chao.pdf},
researchr = {https://researchr.org/publication/ChaoGAL22},
cites = {0},
citedby = {0},
journal = {PVLDB},
volume = {15},
number = {7},
pages = {1453-1465},
}