The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.