{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:32:55Z","timestamp":1776439975590,"version":"3.51.2"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,7,20]],"date-time":"2014-07-20T00:00:00Z","timestamp":1405814400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s10618-014-0362-1","type":"journal-article","created":{"date-parts":[[2014,7,19]],"date-time":"2014-07-19T13:31:08Z","timestamp":1405776668000},"page":"732-764","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["On measuring similarity for sequences of itemsets"],"prefix":"10.1007","volume":"29","author":[{"given":"Elias","family":"Egho","sequence":"first","affiliation":[]},{"given":"Chedy","family":"Ra\u00efssi","sequence":"additional","affiliation":[]},{"given":"Toon","family":"Calders","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Jay","sequence":"additional","affiliation":[]},{"given":"Amedeo","family":"Napoli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,20]]},"reference":[{"key":"362_CR1","unstructured":"Berndt, Donald J, Clifford J (1994) Using dynamic time warping to find patterns in time series. In: KDD Workshop. Seattle, Association for the Advancement of Artificial Intelligence, pp 359\u2013370"},{"issue":"385","key":"362_CR2","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1038\/385579a0","volume":"6617","author":"C Chothia","year":"1997","unstructured":"Chothia C, Gerstein M (1997) Protein evolution. How far can sequences diverge? Nature 6617(385):579\u2013581","journal-title":"Nature"},{"issue":"3","key":"362_CR3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/j.tcs.2008.08.035","volume":"409","author":"Cees Elzinga","year":"2008","unstructured":"Elzinga Cees, Rahmann Sven, Wang Hui (2008) Algorithms for subsequence combinatorics. Theor Comput Sci 409(3):394\u2013404","journal-title":"Theor Comput Sci"},{"key":"362_CR4","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast subsequence matching in time-series databases. In: Proceedings of the 1994 ACM SIGMOD international conference on management of data, SIGMOD \u201994, New York, ACM, pp 419\u2013429","DOI":"10.1145\/191839.191925"},{"issue":"1","key":"362_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"Xinbo Gao","year":"2010","unstructured":"Gao Xinbo, Xiao Bing, Tao Dacheng, Li Xuelong (2010) A survey of graph edit distance. Pattern Anal Appl 13(1):113\u2013129","journal-title":"Pattern Anal Appl"},{"key":"362_CR6","doi-asserted-by":"crossref","first-page":"1541","DOI":"10.1109\/TKDE.2010.190","volume":"23","author":"Javier Herranz","year":"2011","unstructured":"Herranz Javier, Nin Jordi, Sole Marc (2011) Optimal symbol alignment distance: a new distance for sequences of symbols. IEEE Trans Knowl Data Eng 23:1541\u20131554","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"6","key":"362_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg DS, Hirschberg DS (1975) A linear space algorithm for computing maximal common subsequences. Commun ACM 18(6):341\u2013343","journal-title":"Commun ACM"},{"key":"362_CR8","unstructured":"Zaki M, Sequeira K (2002) Admit: anomaly-base data mining for intrusions. In: 8th ACM SIGKDD international conference on knowledge discovery and data mining. New York, ACM, pp 386\u2013395"},{"key":"362_CR9","doi-asserted-by":"crossref","unstructured":"Keogh E (2002) Exact indexing of dynamic time warping. In: Proceedings of the 28th international conference on very large data bases. VLDB \u201902, Hong Kong, Morgan Kaufmann, pp 406\u2013417. VLDB Endowment.","DOI":"10.1016\/B978-155860869-6\/50043-3"},{"issue":"50","key":"362_CR10","first-page":"564","volume":"575","author":"C Leslie","year":"2002","unstructured":"Leslie C, Eskin E, Stafford-Noble W (2002) The spectrum kernel: a string kernel for svm protein classification. Pac Symp Biocomput 575(50):564\u2013575","journal-title":"Pac Symp Biocomput"},{"issue":"8","key":"362_CR11","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions, and reversals. Soviet Phys Doklady 10(8):707\u2013710","journal-title":"Soviet Phys Doklady"},{"issue":"4","key":"362_CR12","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02128670","volume":"10","author":"Nathan Linial","year":"1990","unstructured":"Linial Nathan, Nisan Noam (1990) Approximate inclusion\u2013exclusion. Combinatorica 10(4):349\u2013365","journal-title":"Combinatorica"},{"key":"362_CR13","unstructured":"Christopher D, Manning, Prabhakar R, Sch\u00fctze Hinrich (2008) Introduction to Information Retrieval. New York, Cambridge University Press. ISBN 0521865719, 9780521865715"},{"key":"362_CR14","doi-asserted-by":"crossref","unstructured":"Muzaffar F, Mohsin B, Naz F, Jawed F (2005) Dsp implementation of voice recognition using dynamic time warping algorithm. Karachi, IEEE Explore, pp 1\u20137","DOI":"10.1109\/SCONEST.2005.4382877"},{"key":"362_CR15","doi-asserted-by":"crossref","DOI":"10.4324\/9781410607034","volume-title":"Research design and statistical analysis","author":"JL Myers","year":"2003","unstructured":"Myers JL, Well AD (2003) Research design and statistical analysis. Lawrence Erlbaum Associates, Mahwah"},{"issue":"9","key":"362_CR16","doi-asserted-by":"crossref","first-page":"1575","DOI":"10.1016\/j.patcog.2006.03.011","volume":"39","author":"Jose Oncina","year":"2006","unstructured":"Oncina Jose, Sebban Marc (2006) Learning stochastic edit distance: application in handwritten character recognition. Pattern Recognit 39(9):1575\u20131587","journal-title":"Pattern Recognit"},{"key":"362_CR17","unstructured":"R Core Team (2012) R: a language and environment for statistical computing. Vienna, R Foundation for Statistical Computing"},{"issue":"9","key":"362_CR18","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1002\/prot.340090107","volume":"1","author":"C Sander","year":"1991","unstructured":"Sander C, Schneider R (1991) Database of homology-derived protein structures and the structural meaning of sequence alignment. Proteins 1(9):56\u201368","journal-title":"Proteins"},{"issue":"2","key":"362_CR19","first-page":"514","volume":"20","author":"Joan Serr\u00e0","year":"2012","unstructured":"Serr\u00e0 Joan, Kantz Holger, Serra Xavier, Andrzejak Ralph G (2012) Predictability of music descriptor time series and its application to cover song detection. IEEE Trans Audio Speech Lang Process 20(2):514\u2013525","journal-title":"IEEE Trans Audio Speech Lang Process"},{"key":"362_CR20","unstructured":"Vlachos Michail, Hadjieleftheriou Marios, Gunopulos Dimitrios , Keogh Eamonn J. (2003) Indexing multi-dimensional time-series with support for multiple distance measures. In: Getoor L, Senator TE, Domingos P, Faloutsos C (ed) In: Proceedings of SIGKDD. Washington DC, ACM, pp 216\u2013225"},{"key":"362_CR21","doi-asserted-by":"crossref","unstructured":"Wang H, Lin Z (2007) A novel algorithm for counting all common subsequences. In: Proceedings of the 2007 IEEE international conference on granular computing, GRC \u201907. Washington DC, IEEE Computer Society, p 502","DOI":"10.1109\/GrC.2007.112"},{"key":"362_CR22","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0065-3233(02)61001-0","volume":"61","author":"SJ Wodak","year":"2002","unstructured":"Wodak SJ, Janin J (2002) Structural basis of macromolecular recognition. Adv Protein Chem 61:9\u201373","journal-title":"Adv Protein Chem"},{"key":"362_CR23","doi-asserted-by":"crossref","unstructured":"Xiong T, Wang S, Jiang Q, Huang JZ (2011) A new markov model for clustering categorical sequences. In: Proceedings of the 2011 IEEE 11th international conference on data mining, ICDM \u201911. Washington DC, IEEE Computer Society, pp 854\u2013863","DOI":"10.1109\/ICDM.2011.13"},{"key":"362_CR24","doi-asserted-by":"crossref","unstructured":"Yan X, Han J, Afshar R (2003) Clospan: mining closed sequential patterns in large datasets. In: In SDM. pp 166\u2013177","DOI":"10.1137\/1.9781611972733.15"},{"key":"362_CR25","doi-asserted-by":"crossref","unstructured":"Yang Q, Zhang HH. Web-log mining for predictive web caching. IEEE Trans Knowl Data Eng 15(4):1050\u20131053. ISSN 1041\u20134347","DOI":"10.1109\/TKDE.2003.1209022"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0362-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-014-0362-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-014-0362-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T01:01:24Z","timestamp":1565658084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-014-0362-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,20]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["362"],"URL":"https:\/\/doi.org\/10.1007\/s10618-014-0362-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,20]]}}}