{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:07:38Z","timestamp":1725865658478},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319460482"},{"type":"electronic","value":"9783319460499"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-46049-9_25","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T11:02:06Z","timestamp":1474369326000},"page":"260-272","source":"Crossref","is-referenced-by-count":2,"title":["Pattern Matching for Separable Permutations"],"prefix":"10.1007","author":[{"given":"Both Emerite","family":"Neou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/S0895480104444776","volume":"22","author":"S Ahal","year":"2008","unstructured":"Ahal, S., Rabinovich, Y.: On complexity of the subpattern problem. SIAM J. Discrete Math. 22(2), 629\u2013649 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/3-540-45678-3_31","volume-title":"Algorithms and Computation","author":"MH Albert","year":"2001","unstructured":"Albert, M.H., Aldred, R.E.L., Atkinson, M.D., Holton, D.A.: Algorithms for pattern involvement in permutations. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 355\u2013366. Springer, Heidelberg (2001)"},{"key":"25_CR3","first-page":"129","volume":"19","author":"D Avis","year":"1981","unstructured":"Avis, D., Newborn, M.: On pop-stacks in series. Utilitas Math. 19, 129\u2013140 (1981)","journal-title":"Utilitas Math."},{"issue":"3","key":"25_CR4","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1978782.1978793","volume":"7","author":"P Bille","year":"2011","unstructured":"Bille, P., G\u00f8rtz, I.L.: The tree inclusion problem: in linear space and faster. ACM Trans. Algorithms 7(3), 38 (2011)","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"25_CR5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0020-0190(97)00209-3","volume":"65","author":"P Bose","year":"1998","unstructured":"Bose, P., Buss, J.F., Lubiw, A.: Pattern matching for permutations. Inf. Process. Lett. 65(5), 277\u2013283 (1998)","journal-title":"Inf. Process. Lett."},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/978-3-540-73437-6_32","volume-title":"Combinatorial Pattern Matching","author":"M Bouvel","year":"2007","unstructured":"Bouvel, M., Rossin, D., Vialette, S.: Longest common separable pattern among permutations. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 316\u2013327. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Br\u00e4nd\u00e9n, P., Claesson, A.: Mesh patterns and the expansion of permutation statistics as sums of permutation patterns, ArXiv e-prints (2011)","key":"25_CR7","DOI":"10.37236\/2001"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/978-3-642-31155-0_23","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"M-L Bruner","year":"2012","unstructured":"Bruner, M.-L., Lackner, M.: A fast algorithm for permutation pattern matching based on alternating runs. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 261\u2013270. Springer, Heidelberg (2012)"},{"key":"25_CR9","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-662-49529-2_38","volume-title":"LATIN 2016: Theoretical Informatics","author":"S Giraudo","year":"2016","unstructured":"Giraudo, S., Vialette, S.: Unshuffling permutations. In: Kranakis, E., et al. (eds.) LATIN 2016. LNCS, vol. 9644, pp. 509\u2013521. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49529-2_38"},{"doi-asserted-by":"crossref","unstructured":"Guillemot, S., Marx, D.: Finding small patterns in permutations in linear time. In: Chekuri, C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM 2014, Portland, Oregon, USA, pp. 82\u2013101 (2014)","key":"25_CR11","DOI":"10.1137\/1.9781611973402.7"},{"issue":"6","key":"25_CR12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0020-0190(97)00029-X","volume":"61","author":"L Ibarra","year":"1997","unstructured":"Ibarra, L.: Finding pattern matchings for permutations. Inf. Process. Lett. 61(6), 293\u2013295 (1997)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"25_CR13","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen, P., Manilla, H.: Ordered and unordered tree inclusion. SIAM J. Comput. 24(2), 340\u2013356 (1995)","journal-title":"SIAM J. Comput."},{"key":"25_CR14","volume-title":"Patterns in Permutations and Words","author":"S Kitaev","year":"2013","unstructured":"Kitaev, S.: Patterns in Permutations and Words. Springer, Heidelberg (2013)"},{"key":"25_CR15","first-page":"55","volume":"17","author":"D Rossin","year":"2006","unstructured":"Rossin, D., Bouvel, M.: The longest common pattern problem for two permutations. Pure Math. Appl. 17, 55\u201369 (2006)","journal-title":"Pure Math. Appl."},{"doi-asserted-by":"crossref","unstructured":"Vatter, V.: Permutation classes. In: B\u00f3na, M. (ed.) Handbook of Enumerative Combinatorics, pp. 753\u2013818. Chapman and Hall\/CRC (2015)","key":"25_CR16","DOI":"10.1201\/b18255-15"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46049-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T00:42:05Z","timestamp":1601080925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46049-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319460482","9783319460499"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46049-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}