{"id":"https://openalex.org/W4283388527","doi":"https://doi.org/10.14778/3523210.3523222","title":"The inherent time complexity and an efficient algorithm for subsequence matching problem","display_name":"The inherent time complexity and an efficient algorithm for subsequence matching problem","publication_year":2022,"publication_date":"2022-03-01","ids":{"openalex":"https://openalex.org/W4283388527","doi":"https://doi.org/10.14778/3523210.3523222"},"language":"en","primary_location":{"id":"doi:10.14778/3523210.3523222","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3523210.3523222","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075597781","display_name":"Zemin Chao","orcid":"https://orcid.org/0000-0003-0784-6650"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zemin Chao","raw_affiliation_strings":["Harbin Institute of Technology, Harbin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Harbin, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070851627","display_name":"Hong Gao","orcid":"https://orcid.org/0000-0002-2000-6683"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hong Gao","raw_affiliation_strings":["Harbin Institute of Technology, Harbin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Harbin, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001154822","display_name":"Yinan An","orcid":null},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yinan An","raw_affiliation_strings":["Harbin Institute of Technology, Harbin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Harbin, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100387065","display_name":"Jianzhong Li","orcid":"https://orcid.org/0000-0002-4119-0571"},"institutions":[{"id":"https://openalex.org/I4210145761","display_name":"Shenzhen Institutes of Advanced Technology","ror":"https://ror.org/04gh4er46","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210145761"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianzhong Li","raw_affiliation_strings":["Shenzhen Institute of Advanced Technology Chinese, Shenzhen, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shenzhen Institute of Advanced Technology Chinese, Shenzhen, China","institution_ids":["https://openalex.org/I4210145761"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4459,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5720717,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"15","issue":"7","first_page":"1453","last_page":"1465"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11309","display_name":"Music and Audio Processing","score":0.9811000227928162,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9732000231742859,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.8345811367034912},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6932708024978638},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6529265642166138},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6078002452850342},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6073070764541626},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.6027205586433411},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.5653303861618042},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.5341132283210754},{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.5238252282142639},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.4919881522655487},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4713648855686188},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.46822330355644226},{"id":"https://openalex.org/keywords/normalization","display_name":"Normalization (sociology)","score":0.4473407566547394},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4389716684818268},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40553539991378784},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11662155389785767}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.8345811367034912},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6932708024978638},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6529265642166138},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6078002452850342},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6073070764541626},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6027205586433411},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.5653303861618042},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.5341132283210754},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.5238252282142639},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4919881522655487},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4713648855686188},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.46822330355644226},{"id":"https://openalex.org/C136886441","wikidata":"https://www.wikidata.org/wiki/Q926129","display_name":"Normalization (sociology)","level":2,"score":0.4473407566547394},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4389716684818268},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40553539991378784},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11662155389785767},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C19165224","wikidata":"https://www.wikidata.org/wiki/Q23404","display_name":"Anthropology","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3523210.3523222","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3523210.3523222","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W145669980","https://openalex.org/W1567097384","https://openalex.org/W1985572324","https://openalex.org/W2010142086","https://openalex.org/W2029767187","https://openalex.org/W2066834853","https://openalex.org/W2099302229","https://openalex.org/W2109355547","https://openalex.org/W2118371392","https://openalex.org/W2119323564","https://openalex.org/W2128061541","https://openalex.org/W2128160875","https://openalex.org/W2138011093","https://openalex.org/W2147880780","https://openalex.org/W2584499795","https://openalex.org/W2766751560","https://openalex.org/W2772184701","https://openalex.org/W2898525571","https://openalex.org/W2949144621","https://openalex.org/W2963964051","https://openalex.org/W2982407593","https://openalex.org/W2987583674","https://openalex.org/W3029934809","https://openalex.org/W3039427982","https://openalex.org/W3082761471","https://openalex.org/W4286799597"],"related_works":["https://openalex.org/W2389167168","https://openalex.org/W2125120904","https://openalex.org/W2939325193","https://openalex.org/W2032710952","https://openalex.org/W170643605","https://openalex.org/W2964011774","https://openalex.org/W48421712","https://openalex.org/W2354750595","https://openalex.org/W2808192002","https://openalex.org/W4283388527"],"abstract_inverted_index":{"Subsequence":[0],"matching":[1,22,41,86,100],"is":[2,36,43,61,65,88,102,150,176],"an":[3,95],"important":[4],"and":[5,24,73,135,172,175],"fundamental":[6],"problem":[7,23,42,87,101],"on":[8,165,184],"time":[9,17,46,55,71],"series":[10,72,126],"data.":[11,127],"This":[12],"paper":[13],"studies":[14],"the":[15,20,32,39,58,66,69,80,84,108,111,147,160,166],"inherent":[16,81],"complexity":[18,82],"of":[19,68,83,110,162],"subsequence":[21,40,85,99],"designs":[25],"a":[26,115,122],"more":[27],"efficient":[28,96],"algorithm":[29,97,130,149,164],"for":[30,98,125],"solving":[31],"problem.":[33],"Firstly,":[34],"it":[35],"proved":[37],"that":[38,146],"incomputable":[44],"in":[45],"O":[47],"(":[48,90],"n":[49,64,91],"1-\u03b4":[50,92],")":[51],"even":[52],"allowing":[53],"polynomial":[54],"preprocessing":[56],"if":[57],"hypothesis":[59],"SETH":[60],"true,":[62],"where":[63],"size":[67],"input":[70],"0":[74],"\u2264":[75],"\u03b4":[76],"<":[77],"1,":[78],"i.e.,":[79],"\u03c9":[89],").":[93],"Secondly,":[94],"proposed.":[103],"In":[104],"order":[105],"to":[106,152,178],"improve":[107],"efficiency":[109],"algorithm,":[112],"we":[113],"design":[114],"new":[116],"summarization":[117],"method":[118],"as":[119,121],"well":[120],"novel":[123],"index":[124],"The":[128],"proposed":[129,148],"supports":[131],"both":[132],"Euclidean":[133,170,185],"Distance":[134,171],"DTW":[136,173],"distance":[137],"with":[138],"or":[139],"without":[140],"z":[141,168],"-normalization.":[142],"Experimental":[143],"results":[144],"show":[145],"up":[151,177],"about":[153],"3":[154],"~":[155,180],"10":[156],"times":[157,182],"faster":[158,183],"than":[159],"state":[161],"art":[163],"constrained":[167],"-normalized":[169],"distance,":[174],"7":[179],"12":[181],"Distance.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}