"The Inherent Time Complexity and An Efficient Algorithm for Subsequence ..."

Zemin Chao et al. (2022)

> Home

Details and statistics

DOI: 10.14778/3523210.3523222

access: open

type: Journal Article

metadata version: 2023-10-23

- view
  - electronic edition @ vldb.org (open access)
  - electronic edition via DOI
  authority control:
- export record
  dblp key:
  - journals/pvldb/ChaoGAL22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pvldb/ChaoGAL22
Zemin Chao, Hong Gao, Yinan An, Jianzhong Li:
The Inherent Time Complexity and An Efficient Algorithm for Subsequence Matching Problem. Proc. VLDB Endow. 15(7): 1453-1465 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.