{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T17:31:19Z","timestamp":1720114279522},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1016\/j.ins.2015.12.004","type":"journal-article","created":{"date-parts":[[2015,12,15]],"date-time":"2015-12-15T23:14:21Z","timestamp":1450221261000},"page":"323-337","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An efficient algorithm for attribute-based subsequence matching"],"prefix":"10.1016","volume":"334-335","author":[{"given":"Jun-Feng","family":"Qu","sequence":"first","affiliation":[]},{"given":"Lei","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Yannong","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zhao","family":"Wu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.ins.2015.12.004_bib0001","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","article-title":"Basic local alignment search tool","volume":"215","author":"Altschul","year":"1990","journal-title":"J. Molecular Biol."},{"key":"10.1016\/j.ins.2015.12.004_bib0002","series-title":"Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"429","article-title":"Sequential pattern mining using a bitmap representation","author":"Ayres","year":"2002"},{"issue":"suppl 2","key":"10.1016\/j.ins.2015.12.004_bib0003","doi-asserted-by":"crossref","first-page":"W369","DOI":"10.1093\/nar\/gkl198","article-title":"Meme: discovering and analyzing dna and protein sequence motifs","volume":"34","author":"Bailey","year":"2006","journal-title":"Nucleic Acids Res."},{"issue":"5","key":"10.1016\/j.ins.2015.12.004_bib0004","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1093\/bioinformatics\/16.5.451","article-title":"Generage: a robust algorithm for sequence clustering and domain detection","volume":"16","author":"Enright","year":"2000","journal-title":"Bioinformation"},{"key":"10.1016\/j.ins.2015.12.004_bib0005","series-title":"Proceedings of ACM SIGMOD International Conference on Management of Data","first-page":"419","article-title":"Fast subsequence matching in time-series databases","author":"Faloutsos","year":"1994"},{"key":"10.1016\/j.ins.2015.12.004_bib0006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2014.06.032","article-title":"Motif matching using gapped patterns","volume":"548","author":"Giaquinta","year":"2014","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.ins.2015.12.004_bib0007","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1721654.1721677","article-title":"Collaborative filtering with temporal dynamics","volume":"53","author":"Koren","year":"2010","journal-title":"Commun. ACM"},{"key":"10.1016\/j.ins.2015.12.004_bib0008","series-title":"Proceedings of International Conference on Data Engineering","first-page":"599","article-title":"Similarity search for multidimensional data sequences","author":"Lee","year":"2000"},{"key":"10.1016\/j.ins.2015.12.004_bib0009","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.compbiomed.2015.02.017","article-title":"Number of distinct sequence alignments with k-match and match sections","volume":"63","author":"Liu","year":"2015","journal-title":"Comput. Biol. Med."},{"key":"10.1016\/j.ins.2015.12.004_bib0010","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ins.2014.02.127","article-title":"Safe MBR-transformation in similar sequence matching","volume":"270","author":"Moon","year":"2014","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2015.12.004_bib0011","series-title":"Bioinformatics: Sequence and Genome Analysis","author":"Mount","year":"2004"},{"key":"10.1016\/j.ins.2015.12.004_bib0012","series-title":"Proceedings of International Conference on Data Engineering","first-page":"989","article-title":"Attribute-based subsequence matching and mining","author":"PENG","year":"2012"},{"key":"10.1016\/j.ins.2015.12.004_bib0013","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.jda.2013.09.003","article-title":"Algorithms for path-constrained sequence alignment","volume":"24","author":"Pinhas","year":"2014","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/j.ins.2015.12.004_bib0014","series-title":"Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering","first-page":"27","article-title":"Highly scalable and accurate seeds for subsequence alignment","author":"Pol","year":"2005"},{"issue":"6","key":"10.1016\/j.ins.2015.12.004_bib0015","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.1109\/TKDE.2012.88","article-title":"The move-split-merge metric for time series","volume":"25","author":"Stefan","year":"2013","journal-title":"IEEE Trans. Knowl. Data Engineering"},{"issue":"1","key":"10.1016\/j.ins.2015.12.004_bib0016","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/1882471.1882478","article-title":"A brief survey on sequence classification","volume":"12","author":"Xing","year":"2010","journal-title":"SIGKDD Explorations Newsl."},{"issue":"1\/2","key":"10.1016\/j.ins.2015.12.004_bib0017","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"Spade: an efficient algorithm for mining frequent sequences","volume":"42","author":"Zaki","year":"2001","journal-title":"Mach. Learn."},{"issue":"1","key":"10.1016\/j.ins.2015.12.004_bib0018","first-page":"5:1","article-title":"Vogue: a variable order hidden Markov model with duration based on frequent sequence mining","volume":"4","author":"Zaki","year":"2010","journal-title":"ACM Trans. Knowl. Discovery Data"},{"key":"10.1016\/j.ins.2015.12.004_bib0019","unstructured":"Chinese Remainder Theorem, 2014, http:\/\/en.wikipedia.org\/wiki\/Chinese_remainder_theorem."},{"key":"10.1016\/j.ins.2015.12.004_bib0020","unstructured":"http:\/\/www.bookcrossing.com\/, 2014."},{"key":"10.1016\/j.ins.2015.12.004_bib0021","unstructured":"Raymond Chi-Wing Wong\u2019s Homepage, 2014, http:\/\/www.cse.ust.hk\/~raywong\/#publication."},{"key":"10.1016\/j.ins.2015.12.004_bib0022","unstructured":"Grouplens, 2014, http:\/\/grouplens.org\/datasets\/hetrec-2011\/."},{"key":"10.1016\/j.ins.2015.12.004_bib0023","unstructured":"GMP Library, 2014, https:\/\/gmplib.org\/."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025515008853?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025515008853?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,17]],"date-time":"2018-09-17T00:27:47Z","timestamp":1537144067000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025515008853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":23,"alternative-id":["S0020025515008853"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2015.12.004","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2016,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An efficient algorithm for attribute-based subsequence matching","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2015.12.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}