{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:49:06Z","timestamp":1740098946820,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319669625"},{"type":"electronic","value":"9783319669632"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66963-2_13","type":"book-chapter","created":{"date-parts":[[2017,8,28]],"date-time":"2017-08-28T11:15:18Z","timestamp":1503918918000},"page":"131-143","source":"Crossref","is-referenced-by-count":0,"title":["Segment and Fenwick Trees for Approximate Order Preserving Matching"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Niquefa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Mendivelso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoan","family":"Pinz\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,29]]},"reference":[{"key":"13_CR1","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: More Geometric Data Structures, pp. 219\u2013241. Springer, Heidelberg (2008)"},{"key":"13_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800191","volume-title":"Advanced Data Structures","author":"P Brass","year":"2008","unstructured":"Brass, P.: Advanced Data Structures. Cambridge University Press, Cambridge (2008). Cambridge books online"},{"issue":"11","key":"13_CR3","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1080\/00207160213939","volume":"79","author":"E Cambouropoulos","year":"2002","unstructured":"Cambouropoulos, E., Crochemore, M., Iliopoulos, C., Mouchard, L., Pinzon, Y.: Algorithms for computing approximate repetitions in musical sequences. Int. J. Comput. Math. 79(11), 1135\u20131148 (2002)","journal-title":"Int. J. Comput. Math."},{"key":"13_CR4","unstructured":"Chhabra, T., Kulekci, M.O., Tarhio, J.: Alternative algorithms for order-preserving matching. In: Holub, J., \u017dd\u030c\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2015, pp. 36\u201346. Czech Technical University in Prague, Prague, Czech Republic (2015)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-07959-2_26","volume-title":"Experimental Algorithms","author":"T Chhabra","year":"2014","unstructured":"Chhabra, T., Tarhio, J.: Order-preserving matching with filtration. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 307\u2013314. Springer, Cham (2014). doi: 10.1007\/978-3-319-07959-2_26"},{"key":"13_CR6","first-page":"71","volume":"11","author":"T Crawford","year":"1998","unstructured":"Crawford, T., Iliopoulos, C.S., Raman, R.: String-matching techniques for musical similarity and melodic recognition. Comput. Musicol. 11, 71\u2013100 (1998)","journal-title":"Comput. Musicol."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T.: Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes, pp. 84\u201395. Springer, Cham (2013)","DOI":"10.1007\/978-3-319-02432-5_13"},{"key":"13_CR8","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Pissis, S.P., Radoszewski, J., Rytter, W., Walen, T.: Order-preserving suffix trees and their algorithmic applications. CoRR abs\/1303.6872 (2013)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T.: Order-preserving indexing. Theor. Comput. Sci. 638(C), 122\u2013135 (2016)","DOI":"10.1016\/j.tcs.2015.06.050"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Faro, S., K\u00fclekci, M.O.: Efficient algorithms for the order preserving pattern matching problem. CoRR abs\/1501.04001 (2015)","DOI":"10.1007\/978-3-319-41168-2_16"},{"key":"13_CR11","unstructured":"Fenwick, P.M.: A new data structure for cumulative frequency tables. Softw. Pract. Exp. 24, 327\u2013336 (1994)"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.tcs.2015.08.022","volume":"638","author":"P Gawrychowski","year":"2016","unstructured":"Gawrychowski, P., Uzna\u0144ski, P.: Order-preserving pattern matching with k mismatches. Theor. Comput. Sci. 638, 136\u2013144 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Hasan, M.M., Islam, A., Rahman, M.S., Rahman, M.S.: Order Preserving Prefix Tables, pp. 111\u2013116. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-11918-2_11"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Hasan, M.M., Islam, A., Rahman, M.S., Rahman, M.: Order preserving pattern matching revisited. Pattern Recogn. Lett. 55(C), 15\u201321 (2015)","DOI":"10.1016\/j.patrec.2014.11.013"},{"key":"13_CR15","unstructured":"Kim, J., Eades, P., Fleischer, R., Hong, S.H., Iliopoulos, C.S., Park, K., Puglisi, S.J., Tokuyama, T.: Order-preserving matching. Theor. Comput. Sci. 525, 68\u201379 (2014). Advances in Stringology"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Kubica, M., Kulczy\u0144ski, T., Radoszewski, J., Rytter, W.: Wale\u00c5D\u030c, T.: A linear time algorithm for consecutive permutation pattern matching. Information Processing Letters 113(12), 430\u2013433 (2013)","DOI":"10.1016\/j.ipl.2013.03.015"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Lee, I., Mendivelso, J., Pinz\u00f3n, Y.J.: $$\\delta \\gamma $$ -Parameterized Matching, pp. 236\u2013248. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-540-89097-3_23"},{"key":"13_CR18","unstructured":"Mendivelso, J.: Definition and solution of a new string searching variant termed $$\\delta \\gamma $$ -parameterized matching. Master\u2019s thesis, National University of Colombia, Bogota, Colombia (2010)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Mendivelso, J., Lee, I., Pinz\u00f3n, Y.J.: Approximate Function Matching under $$\\delta $$ - and $$\\gamma $$ - Distances, pp. 348\u2013359. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-34109-0_37"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Mendivelso, J., Pino, C., Ni\u00f1o, L.F., Pinz\u00f3n, Y.: Approximate Abelian Periods to Find Motifs in Biological Sequences, pp. 121\u2013130. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-24462-4_11"},{"key":"13_CR21","unstructured":"Mendivelso, J., Pinz\u00f3n, Y.: A novel approach to approximate parikh matching for comparing composition in biological sequences. In: Proceedings of the 6th International Conference on Bioinformatics and Computational Biology (BICoB 2014) (2014)"},{"key":"13_CR22","unstructured":"Niquefa, R., Mendivelso, J., Hern\u00e1ndez, G., Pinz\u00f3n, Y.: Order preserving matching under $$\\delta \\gamma $$ -approximation. In: Congreso Internacional de Ciencias B\u00e1sicas e Ingenier\u00eda (2017)"}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66963-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T20:51:43Z","timestamp":1659387103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66963-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319669625","9783319669632"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66963-2_13","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}