{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:52:14Z","timestamp":1725688334924},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311543"},{"type":"electronic","value":"9783642311550"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31155-0_23","type":"book-chapter","created":{"date-parts":[[2012,6,13]],"date-time":"2012-06-13T02:21:27Z","timestamp":1339554087000},"page":"261-270","source":"Crossref","is-referenced-by-count":3,"title":["A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs"],"prefix":"10.1007","author":[{"given":"Marie-Louise","family":"Bruner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Lackner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","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.\u00a022(2), 629\u2013649 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45678-3_31","volume-title":"Algorithms and Computation","author":"M. Albert","year":"2001","unstructured":"Albert, M., Aldred, R., Atkinson, M., Holton, D.: Algorithms for Pattern Involvement in Permutations. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 355\u2013367. Springer, Heidelberg (2001)"},{"issue":"1","key":"23_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.24033\/asens.235","volume":"3","author":"D. Andr\u00e9","year":"1884","unstructured":"Andr\u00e9, D.: \u00c9tude sur les maxima, minima et s\u00e9quences des permutations. Ann. Sci. \u00c9cole Norm. Sup.\u00a03(1), 121\u2013135 (1884)","journal-title":"Ann. Sci. \u00c9cole Norm. Sup."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bona, M.: Combinatorics of permutations. Discrete Mathematics and Its Applications. Chapman & Hall\/CRC (2004)","DOI":"10.1201\/9780203494370"},{"issue":"5","key":"23_CR5","doi-asserted-by":"publisher","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. Information Processing Letters\u00a065(5), 277\u2013283 (1998)","journal-title":"Information Processing Letters"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Bruner, M.L., Lackner, M.: A fast algorithm for permutation pattern matching based on alternating runs. CoRR (2012)","DOI":"10.1007\/978-3-642-31155-0_23"},{"issue":"6","key":"23_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0020-0190(92)90114-B","volume":"43","author":"M.S. Chang","year":"1992","unstructured":"Chang, M.S., Wang, F.H.: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Information Processing Letters\u00a043(6), 293\u2013295 (1992)","journal-title":"Information Processing Letters"},{"key":"23_CR8","volume-title":"Parameterized complexity theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer, Heidelberg (2006)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1007\/978-3-642-10631-6_107","volume-title":"Algorithms and Computation","author":"S. Guillemot","year":"2009","unstructured":"Guillemot, S., Vialette, S.: Pattern Matching for 321-Avoiding Permutations. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1064\u20131073. Springer, Heidelberg (2009)"},{"issue":"6","key":"23_CR10","doi-asserted-by":"publisher","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. Information Processing Letters\u00a061(6), 293\u2013295 (1997)","journal-title":"Information Processing Letters"},{"key":"23_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17333-2","volume-title":"Patterns in Permutations and Words","author":"S. Kitaev","year":"2011","unstructured":"Kitaev, S.: Patterns in Permutations and Words. Springer, Heidelberg (2011)"},{"key":"23_CR12","unstructured":"Knuth, D.E.: The Art of Computer Programming. Fundamental Algorithms, vol.\u00a0I. Addison-Wesley (1968)"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1214\/aoms\/1177731314","volume":"15","author":"H. Levene","year":"1944","unstructured":"Levene, H., Wolfowitz, J.: The covariance matrix of runs up and down. The Annals of Mathematical Statistics\u00a015(1), 58\u201369 (1944)","journal-title":"The Annals of Mathematical Statistics"},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1080\/00207160108805049","volume":"77","author":"E. M\u00e4kinen","year":"2001","unstructured":"M\u00e4kinen, E.: On the longest upsequence problem for permutations. International Journal of Computer Mathematics\u00a077(1), 45\u201353 (2001)","journal-title":"International Journal of Computer Mathematics"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics And Its Applications. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Schensted, C.: Longest increasing and decreasing subsequences. Classic Papers in Combinatorics, pp. 299\u2013311 (1987)","DOI":"10.1007\/978-0-8176-4842-8_21"},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0195-6698(85)80052-4","volume":"6","author":"R. Simion","year":"1985","unstructured":"Simion, R., Schmidt, F.W.: Restricted permutations. European Journal of Combinatorics\u00a06, 383\u2013406 (1985)","journal-title":"European Journal of Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31155-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:48:32Z","timestamp":1620128912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31155-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311543","9783642311550"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31155-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}