{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:31Z","timestamp":1759637671907},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009815"},{"type":"electronic","value":"9783642009822"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00982-2_36","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T15:51:54Z","timestamp":1238428314000},"page":"422-433","source":"Crossref","is-referenced-by-count":10,"title":["Counting Parameterized Border Arrays for a Binary Alphabet"],"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":"36_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"},{"key":"36_CR2","first-page":"49","volume":"24","author":"B.S. Baker","year":"1992","unstructured":"Baker, B.S.: A program for identifying duplicated code. Computing Science and Statistics\u00a024, 49\u201357 (1992)","journal-title":"Computing Science and Statistics"},{"issue":"3","key":"36_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ipl.2006.06.009","volume":"100","author":"K. Fredriksson","year":"2006","unstructured":"Fredriksson, K., Mozgovoy, M.: Efficient parameterized string matching. Information Processing Letters\u00a0100(3), 91\u201396 (2006)","journal-title":"Information Processing Letters"},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-003-1067-9","volume":"39","author":"T. Shibuya","year":"2004","unstructured":"Shibuya, T.: Generalization of a suffix tree for RNA structural pattern matching. Algorithmica\u00a039(1), 1\u201319 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"36_CR5","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":"36_CR6","unstructured":"Baker, B.S.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: Proc. 6th annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 541\u2013550 (1995)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Faster algorithms for the construction of parameterized suffix trees. In: Proc. 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 631\u2013637 (1995)","DOI":"10.1109\/SFCS.1995.492664"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/11496656_23","volume-title":"Combinatorial Pattern Matching","author":"C. Hazay","year":"2005","unstructured":"Hazay, C., Lewenstein, M., Tsur, D.: Two dimensional parameterized matching. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 266\u2013279. Springer, Heidelberg (2005)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lewenstein, M., Sokol, D.: Approximate parameterized matching. ACM Transactions on Algorithms\u00a03(3), Article No. 29 (2007)","DOI":"10.1145\/1273340.1273345"},{"issue":"1","key":"36_CR10","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"},{"issue":"9","key":"36_CR11","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1016\/j.dam.2006.11.017","volume":"156","author":"A. Apostolico","year":"2008","unstructured":"Apostolico, A., Giancarlo, R.: Periodicity and repetitions in parameterized strings. Discrete Applied Mathematics\u00a0156(9), 1389\u20131398 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"36_CR12","unstructured":"Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S., Takeda, M.: Parameterized suffix arrays for binary strings. In: Proc. The Prague Stringology Conference 2008 (PSC 2008), pp. 84\u201394 (2008)"},{"issue":"2","key":"36_CR13","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"},{"issue":"6","key":"36_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Communications of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"key":"36_CR15","unstructured":"Morris, J.H., Pratt, V.R.: A linear pattern-matching algorithm. Technical Report Report 40, University of California, Berkeley (1970)"},{"key":"36_CR16","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. Combinatorial Math. and Combinatorial Computing\u00a042, 223\u2013236 (2002)","journal-title":"J. Combinatorial Math. and Combinatorial Computing"},{"issue":"1","key":"36_CR17","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"},{"issue":"1","key":"36_CR18","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"},{"issue":"5","key":"36_CR19","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Computing"},{"key":"36_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A. Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theoretical Computer Science\u00a040, 31\u201355 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"36_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"R.A. Baeza-Yates","year":"1991","unstructured":"Baeza-Yates, R.A.: Searching subsequences (note). Theoretical Computer Science\u00a078(2), 363\u2013376 (1991)","journal-title":"Theoretical Computer Science"},{"key":"36_CR22","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":"36_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"36_CR24","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"},{"issue":"4","key":"36_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R.C. Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation a\n                  \n                    M\n                  \u2009=\u2009b\n                  \n                    N\n                  \n                  c\n                  \n                    P\n                   in a free group. Michigan Math. J.\u00a09(4), 289\u2013298 (1962)","journal-title":"Michigan Math. J."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T03:27:31Z","timestamp":1551929251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}