{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:33:03Z","timestamp":1725557583288},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_22","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"238-250","source":"Crossref","is-referenced-by-count":7,"title":["Verifying a Parameterized Border Array in O(n 1.5) Time"],"prefix":"10.1007","author":[{"given":"Tomohiro","family":"I.","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1006\/jcss.1996.0003","volume":"52","author":"B.S. Baker","year":"1996","unstructured":"Baker, B.S.: Parameterized pattern matching: Algorithms and applications. Journal of Computer and System Sciences\u00a052(1), 28\u201342 (1996)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","volume":"49","author":"A. Amir","year":"1994","unstructured":"Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Information Processing Letters\u00a049(3), 111\u2013115 (1994)","journal-title":"Information Processing Letters"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.: Faster algorithms for the construction of parameterized suffix trees. In: Proc. FOCS 1995, pp. 631\u2013637 (1995)","DOI":"10.1109\/SFCS.1995.492664"},{"issue":"3","key":"22_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1273340.1273345","volume":"3","author":"C. Hazay","year":"2007","unstructured":"Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. ACM Transactions on Algorithms\u00a03(3), Article No. 29 (2007)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.jda.2006.03.014","volume":"5","author":"A. Apostolico","year":"2007","unstructured":"Apostolico, A., Erd\u00f6s, P.L., Lewenstein, M.: Parameterized matching with mismatches. Journal of Discrete Algorithms\u00a05(1), 135\u2013140 (2007)","journal-title":"Journal of Discrete Algorithms"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"I, T., Deguchi, S., Bannai, H., Inenaga, S., Takeda, M.: Lightweight parameterized suffix array construction. In: Proc. IWOCA, pp. 312\u2013323 (2009)","DOI":"10.1007\/978-3-642-10217-2_31"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(94)00270-3","volume":"154","author":"R.M. Idury","year":"1996","unstructured":"Idury, R.M., Sch\u00e4ffer, A.A.: Multiple matching of parameterized patterns. Theoretical Computer Science\u00a0154(2), 203\u2013224 (1996)","journal-title":"Theoretical Computer Science"},{"key":"22_CR8","unstructured":"Morris, J.H., Pratt, V.R.: A linear pattern-matching algorithm. Technical Report\u00a040, University of California, Berkeley (1970)"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-00982-2_36","volume-title":"Language and Automata Theory and Applications","author":"T. I","year":"2009","unstructured":"I, T., Inenaga, S., Bannai, H., Takeda, M.: Counting parameterized border arrays for a binary alphabet. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 422\u2013433. Springer, Heidelberg (2009)"},{"key":"22_CR10","first-page":"223","volume":"42","author":"F. Franek","year":"2002","unstructured":"Franek, F., Gao, S., Lu, W., Ryan, P.J., Smyth, W.F., Sun, Y., Yang, L.: Verifying a border array in linear time. J. Comb. Math. and Comb. Comp.\u00a042, 223\u2013236 (2002)","journal-title":"J. Comb. Math. and Comb. Comp."},{"issue":"1","key":"22_CR11","first-page":"51","volume":"10","author":"J.P. Duval","year":"2005","unstructured":"Duval, J.P., Lecroq, T., Lefevre, A.: Border array on bounded alphabet. Journal of Automata, Languages and Combinatorics\u00a010(1), 51\u201360 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1051\/ita:2002012","volume":"36","author":"J.P. Duval","year":"2002","unstructured":"Duval, J.P., Lefebvre, A.: Words over an ordered alphabet and suffix permutations. Theoretical Informatics and Applications\u00a036, 249\u2013259 (2002)","journal-title":"Theoretical Informatics and Applications"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/978-3-540-45138-9_15","volume-title":"Mathematical Foundations of Computer Science 2003","author":"H. Bannai","year":"2003","unstructured":"Bannai, H., Inenaga, S., Shinohara, A., Takeda, M.: Inferring strings from graphs and arrays. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 208\u2013217. Springer, Heidelberg (2003)"},{"issue":"2-1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.tcs.2008.01.011","volume":"395","author":"K.B. Sch\u00fcrmann","year":"2008","unstructured":"Sch\u00fcrmann, K.B., Stoye, J.: Counting suffix arrays and strings. Theoretical Computer Science\u00a0395(2-1), 220\u2013234 (2008)","journal-title":"Theoretical Computer Science"},{"key":"22_CR15","unstructured":"Cl\u00e9ment, J., Crochemore, M., Rindone, G.: Reverse engineering prefix tables. In: Proc. STACS 2009, pp. 289\u2013300 (2009)"},{"issue":"2","key":"22_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1051\/ita:2008030","volume":"43","author":"J.P. Duval","year":"2009","unstructured":"Duval, J.P., Lecroq, T., Lefebvre, A.: Efficient validation and construction of border arrays and validation of string matching automata. RAIRO - Theoretical Informatics and Applications\u00a043(2), 281\u2013297 (2009)","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Jez, A., Jez, L.: Validating the Knuth-Morris-Pratt failure function, fast and online. In: Proc. CSR 2010 (to appear 2010)","DOI":"10.1007\/978-3-642-13182-0_13"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Iliopoulos, C., Pissis, S., Tischler, G.: Cover array string reconstruction. In: Proc. CPM 2010 (to appear 2010)","DOI":"10.1007\/978-3-642-13509-5_23"},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009247","volume":"23","author":"D. Moore","year":"1999","unstructured":"Moore, D., Smyth, W., Miller, D.: Counting distinct strings. Algorithmica\u00a023(1), 1\u201313 (1999)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:09Z","timestamp":1606185549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}