{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:01:09Z","timestamp":1760608869328},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,4,25]],"date-time":"2015-04-25T00:00:00Z","timestamp":1429920000000},"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":["The VLDB Journal"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s00778-015-0387-0","type":"journal-article","created":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T11:06:59Z","timestamp":1429873619000},"page":"519-536","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Embedding-based subsequence matching with gaps\u2013range\u2013tolerances: a Query-By-Humming application"],"prefix":"10.1007","volume":"24","author":[{"given":"Alexios","family":"Kotsifakos","sequence":"first","affiliation":[]},{"given":"Isak","family":"Karlsson","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Papapetrou","sequence":"additional","affiliation":[]},{"given":"Vassilis","family":"Athitsos","sequence":"additional","affiliation":[]},{"given":"Dimitrios","family":"Gunopulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,25]]},"reference":[{"key":"387_CR1","doi-asserted-by":"crossref","unstructured":"Athitsos, V., Alon, J., Sclaroff, S., Kollios, G.: BoostMap: a method for efficient approximate similarity rankings. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 268\u2013275 (2004)","DOI":"10.1109\/CVPR.2004.1315173"},{"key":"387_CR2","doi-asserted-by":"crossref","unstructured":"Athitsos, V., Hadjieleftheriou, M., Kollios, G., Sclaroff, S.: Query-sensitive embeddings. In: ACM International Conference on Management of Data (SIGMOD), pp. 706\u2013717 (2005)","DOI":"10.1145\/1066157.1066238"},{"issue":"6","key":"387_CR3","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1090\/S0002-9904-1954-09848-8","volume":"60","author":"R Bellman","year":"1954","unstructured":"Bellman, R.: The theory of dynamic programming. Bull. Am. Math. Soc. 60(6), 503\u2013515 (1954)","journal-title":"Bull. Am. Math. Soc."},{"key":"387_CR4","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: SPIRE, pp. 39\u201348 (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"387_CR5","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Das, G., Gunopulos, D., Mannila, H.: Time-series similarity problems and well-separated geometric sets. In: Symposium on Computational Geometry, pp. 454\u2013456 (1997)","DOI":"10.1145\/262839.263080"},{"key":"387_CR6","doi-asserted-by":"crossref","unstructured":"Chen, L., Ng, R.: On the marriage of $$l_p$$ l p -norms and edit distance. In: VLDB, pp. 792\u2013803 (2004)","DOI":"10.1016\/B978-012088469-8.50070-X"},{"key":"387_CR7","doi-asserted-by":"crossref","unstructured":"Chen, L., \u00d6zsu, M.T.: Robust and fast similarity search for moving object trajectories. In: SIGMOD, pp. 491\u2013502 (2005)","DOI":"10.1145\/1066157.1066213"},{"key":"387_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Y., Nascimento, M.A., Ooi, B.C., Tung, A.K.H.: Spade: On shape-based pattern detection in streaming time series. In: ICDE, pp. 786\u2013795 (2007)","DOI":"10.1109\/ICDE.2007.367924"},{"issue":"1","key":"387_CR9","first-page":"54","volume":"9","author":"M Crochemore","year":"2002","unstructured":"Crochemore, M., Iliopoulos, C., Makris, C., Rytter, W., Tsakalidis, A., Tsichlas, K.: Approximate string matching with gaps. Nord. J. Comput. 9(1), 54\u201365 (2002)","journal-title":"Nord. J. Comput."},{"issue":"5","key":"387_CR10","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1002\/asi.20532","volume":"58","author":"R Dannenberg","year":"2007","unstructured":"Dannenberg, R., Birmingham, W., Pardo, B., Hu, N., Meek, C., Tzanetakis, G.: A comparative evaluation of search techniques for Query-By-Humming using the MUSART testbed. J. Am. Soc. Inf. Sci. Technol. 58(5), 687\u2013701 (2007)","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"387_CR11","doi-asserted-by":"crossref","unstructured":"Faloutsos, C., Lin, K.I.: FastMap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: ACM International Conference on Management of Data (SIGMOD), pp. 163\u2013174 (1995)","DOI":"10.1145\/223784.223812"},{"issue":"2","key":"387_CR12","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/PL00010672","volume":"9","author":"AWc Fu","year":"2000","unstructured":"Fu, AWc, Chan, PMc, Cheung, Y.L., Moon, Y.S.: Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances. VLDB J. 9(2), 154\u2013173 (2000). doi: 10.1007\/PL00010672","journal-title":"VLDB J."},{"issue":"4","key":"387_CR13","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1007\/s00778-006-0040-z","volume":"17","author":"AWC Fu","year":"2008","unstructured":"Fu, A.W.C., Keogh, E., Lau, L.Y.H., Ratanamahatana, C., Wong, R.C.W.: Scaling and time warping in time series querying. Very Large Databases (VLDB) J. 17(4), 899\u2013921 (2008)","journal-title":"Very Large Databases (VLDB) J."},{"key":"387_CR14","doi-asserted-by":"crossref","unstructured":"Han, T., Ko, S.K., Kang, J.: Efficient subsequence matching using the longest common subsequence with a dual match index. In: Machine Learning and Data Mining in Pattern Recognition, pp. 585\u2013600 (2007)","DOI":"10.1007\/978-3-540-73499-4_44"},{"key":"387_CR15","unstructured":"Han, W.S., Lee, J., Moon, Y.S., Jiang, H.: Ranked subsequence matching in time-series databases. In: International Conference on Very Large Data Bases (VLDB), pp. 423\u2013434 (2007)"},{"issue":"5","key":"387_CR16","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TPAMI.2003.1195989","volume":"25","author":"G Hjaltason","year":"2003","unstructured":"Hjaltason, G., Samet, H.: Properties of embedding methods for similarity searching in metric spaces. IEEE Trans. Pattern Anal. Mach. Intell. (PAMI) 25(5), 530\u2013549 (2003)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. (PAMI)"},{"key":"387_CR17","unstructured":"Hristescu, G., Farach-Colton, M.: Cluster-preserving embedding of proteins. Tech. Rep. 99-50. CS Department, Rutgers University (1999)"},{"key":"387_CR18","unstructured":"Hu, N., Dannenberg, R., Lewis, A.: A probabilistic model of melodic similarity. In: ICMC, pp. 509\u2013515 (2002)"},{"key":"387_CR19","unstructured":"Iliopoulos, C., Kurokawa, M.: String matching with gaps for musical melodic recognition. In: PSC, pp. 55\u201364 (2002)"},{"key":"387_CR20","unstructured":"Jang, J., Gao, M.: A Query-By-Singing system based on dynamic programming. In: International Workshop on Intelligent Systems Resolutions, pp. 85\u201389 (2000)"},{"key":"387_CR21","doi-asserted-by":"crossref","unstructured":"Keogh, E.: Exact indexing of dynamic time warping. In: International Conference on Very Large Databases (VLDB), pp. 406\u2013417 (2002)","DOI":"10.1016\/B978-155860869-6\/50043-3"},{"key":"387_CR22","doi-asserted-by":"crossref","unstructured":"Keogh, E., Chu, S., Hart, D., Pazzani, M.: Segmenting time series: a survey and novel approach. In: In an Edited Volume, Data Mining in Time Series Databases, pp. 1\u201322. World Scientific Publishing Company (1993)","DOI":"10.1142\/9789812565402_0001"},{"key":"387_CR23","doi-asserted-by":"crossref","unstructured":"Keogh, E., Pazzani, M.: Scaling up dynamic time warping for data mining applications. In: Proc. of SIGKDD (2000)","DOI":"10.1145\/347090.347153"},{"issue":"11","key":"387_CR24","doi-asserted-by":"crossref","first-page":"761","DOI":"10.14778\/3402707.3402716","volume":"4","author":"A Kotsifakos","year":"2011","unstructured":"Kotsifakos, A., Papapetrou, P., Hollm\u00e9n, J., Gunopulos, D.: A subsequence matching with gaps\u2013range\u2013tolerances framework: a Query-By-Humming application. Proc. VLDB 4(11), 761\u2013771 (2011)","journal-title":"Proc. VLDB"},{"key":"387_CR25","doi-asserted-by":"crossref","unstructured":"Kotsifakos, A., Papapetrou, P., Hollm\u00e9n, J., Gunopulos, D., Athitsos, V.: A survey of Query-By-Humming similarity methods. In: Proceedings of PETRA (2012)","DOI":"10.1145\/2413097.2413104"},{"issue":"12","key":"387_CR26","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.14778\/2367502.2367540","volume":"5","author":"A Kotsifakos","year":"2012","unstructured":"Kotsifakos, A., Papapetrou, P., Hollm\u00e9n, J., Gunopulos, D., Athitsos, V., Kollios, G.: Hum-a-song: a subsequence matching with gaps\u2013range\u2013tolerances Query-By-Humming system. Proc. VLDB Endow. 5(12), 1930\u20131933 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"387_CR27","unstructured":"Kruskall, J.B., Liberman, M.: The symmetric time warping algorithm: from continuous to discrete. In: Time Warps. Addison-Wesley (1983)"},{"key":"387_CR28","unstructured":"Lemstr\u00f6m, K., Ukkonen, E.: Including interval encoding into edit distance based music comparison and retrieval. In: AISB, pp. 53\u201360 (2000)"},{"issue":"8","key":"387_CR29","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. 10(8), 707\u2013710 (1966)","journal-title":"Sov. Phys."},{"issue":"2","key":"387_CR30","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. J. ACM 25(2), 322\u2013336 (1978)","journal-title":"J. ACM"},{"issue":"3","key":"387_CR31","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF00117340","volume":"24","author":"M Mongeau","year":"1990","unstructured":"Mongeau, M., Sankoff, D.: Comparison of musical sequences. Comput. Humanit. 24(3), 161\u2013175 (1990)","journal-title":"Comput. Humanit."},{"key":"387_CR32","doi-asserted-by":"crossref","unstructured":"Papapetrou, P., Athitsos, V., Kollios, G., Gunopulos, D.: Reference-based alignment of large sequence databases. In: International Conference on Very Large Data Bases (VLDB) (2009)","DOI":"10.14778\/1687627.1687651"},{"key":"387_CR33","doi-asserted-by":"crossref","unstructured":"Papapetrou, P., Athitsos, V., Potamias, M., Kollios, G., Gunopulos, D.: Embedding-based subsequence matching in time-series databases. ACM Trans. Database Syst. (TODS) 36(3), 17 (2011)","DOI":"10.1145\/2000824.2000827"},{"key":"387_CR34","unstructured":"Pardo, B., Birmingham, W.: Encoding timing information for musical query matching. In: ISMIR, pp. 267\u2013268 (2002)"},{"key":"387_CR35","doi-asserted-by":"crossref","unstructured":"Pardo, B., Shifrin, J., Birmingham, W.: Name that tune: a pilot study in finding a melody from a sung query. J. Am. Soc. Inf. Sci. Technol. 55(4), 283\u2013300 (2004)","DOI":"10.1002\/asi.10373"},{"issue":"7","key":"387_CR36","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/S0306-4379(02)00102-3","volume":"28","author":"S Park","year":"2003","unstructured":"Park, S., Chu, W.W., Yoon, J., Won, J.: Similarity search of time-warped subsequences via a suffix tree. Inform. Syst. 28(7), 867\u2013883 (2003)","journal-title":"Inform. Syst."},{"key":"387_CR37","doi-asserted-by":"crossref","unstructured":"Park, S., Kim, S., Chu, W.W.: Segment-based approach for subsequence searches in sequence databases. In: ACM Symposium on Applied Computing (SAC), pp. 248\u2013252 (2001)","DOI":"10.1145\/372202.372334"},{"key":"387_CR38","doi-asserted-by":"crossref","unstructured":"Rabiner, L.: A tutorial on hidden Markov models and selected applications in speech recognition. Proc. IEEE 77(2), 257\u2013286 (1989)","DOI":"10.1109\/5.18626"},{"key":"387_CR39","doi-asserted-by":"crossref","unstructured":"Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., Keogh, E.: Searching and mining trillions of time series subsequences under dynamic time warping. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 262\u2013270. ACM (2012)","DOI":"10.1145\/2339530.2339576"},{"key":"387_CR40","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe, H., Chiba, S.: Dynamic programming algorithm optimization for spoken word recognition. Trans. ASSP 26, 43\u201349 (1978)","journal-title":"Trans. ASSP"},{"key":"387_CR41","doi-asserted-by":"crossref","unstructured":"Sakurai, Y., Faloutsos, C., Yamamuro, M.: Stream monitoring under the time warping distance. In: ICDE, pp. 1046\u20131055 (2007)","DOI":"10.1109\/ICDE.2007.368963"},{"issue":"2\u20133","key":"387_CR42","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10994-005-5828-3","volume":"58","author":"Y Shou","year":"2005","unstructured":"Shou, Y., Mamoulis, N., Cheung, D.: Fast and exact warping of time series using adaptive segmental approximations. Mach. Learn. 58(2\u20133), 231\u2013267 (2005)","journal-title":"Mach. Learn."},{"key":"387_CR43","doi-asserted-by":"crossref","unstructured":"Uitdenbogerd, A., Zobel, J.: Melodic matching techniques for large music databases. In: ACM Multimedia (Part 1), p. 66 (1999)","DOI":"10.1145\/319463.319470"},{"key":"387_CR44","unstructured":"Ukkonen, E., Lemstr\u00f6m, K., M\u00e4kinen, V.: Geometric algorithms for transposition invariant content-based music retrieval. In: ISMIR, pp. 193\u2013199 (2003)"},{"issue":"2","key":"387_CR45","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1109\/TASL.2007.912373","volume":"16","author":"E Unal","year":"2008","unstructured":"Unal, E., Chew, E., Georgiou, P., Narayanan, S.: Challenging uncertainty in query by humming systems: a fingerprinting approach. Trans. Audio Speech Lang. Process. 16(2), 359\u2013371 (2008)","journal-title":"Trans. Audio Speech Lang. Process."},{"issue":"2","key":"387_CR46","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s101150050009","volume":"2","author":"X Wang","year":"2000","unstructured":"Wang, X., Wang, J.T.L., Lin, K.I., Shasha, D., Shapiro, B.A., Zhang, K.: An index structure for data mining and clustering. Knowl. Inf. Syst. 2(2), 161\u2013184 (2000)","journal-title":"Knowl. Inf. Syst."},{"key":"387_CR47","doi-asserted-by":"crossref","unstructured":"Zhou, M., Wong, M.: Efficient online subsequence searching in data streams under dynamic time warping distance. In: IEEE 24th International Conference on, Data Engineering, 2008. ICDE 2008. pp. 686\u2013695. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497477"},{"key":"387_CR48","doi-asserted-by":"crossref","unstructured":"Zhu, Y., Shasha, D.: Warping indexes with envelope transforms for query by humming. In: ACM International Conference on Management of Data (SIGMOD), pp. 181\u2013192 (2003)","DOI":"10.1145\/872757.872780"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0387-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-015-0387-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-015-0387-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T08:33:26Z","timestamp":1598949206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-015-0387-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,25]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["387"],"URL":"https:\/\/doi.org\/10.1007\/s00778-015-0387-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,25]]}}}