{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:19Z","timestamp":1725540679407},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_22","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T04:32:11Z","timestamp":1356064331000},"page":"189-205","source":"Crossref","is-referenced-by-count":2,"title":["Border Array for Structural Strings"],"prefix":"10.1007","author":[{"given":"Richard","family":"Beal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Adjeroh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Computing Patterns in Strings","author":"W. Smyth","year":"2003","unstructured":"Smyth, W.: Computing Patterns in Strings. Pearson, New York (2003)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Baker, B.: A theory of parameterized pattern matching: Algorithms and applications. In: STOC 1993, pp. 71\u201380 (1993)","DOI":"10.1145\/167088.167115"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0304-3975(94)00270-3","volume":"154","author":"R. Idury","year":"1996","unstructured":"Idury, R., Sch\u00e4ffer, A.: Multiple matching of parameterized patterns. Theor. Comput. Sci.\u00a0154, 203\u2013224 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR4","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_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-13509-5_22","volume-title":"Combinatorial Pattern Matching","author":"T. I","year":"2010","unstructured":"I, T., Inenaga, S., Bannai, H., Takeda, M.: Verifying a Parameterized Border Array in O(n\n                1.5) Time. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 238\u2013250. Springer, Heidelberg (2010)"},{"issue":"9","key":"22_CR6","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TSE.2007.70720","volume":"33","author":"B. Baker","year":"2007","unstructured":"Baker, B.: Finding clones with dup: Analysis of an experiment. IEEE Trans. Software Eng.\u00a033(9), 608\u2013621 (2007)","journal-title":"IEEE Trans. Software Eng."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MSPEC.2010.5583460","volume":"47","author":"B. Zeidman","year":"2010","unstructured":"Zeidman, B.: Software v. software. IEEE Spectr.\u00a047, 32\u201353 (2010)","journal-title":"IEEE Spectr."},{"issue":"1","key":"22_CR8","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"},{"key":"22_CR9","unstructured":"Beal, R.: Parameterized Strings: Algorithms and Data Structures. MS Thesis. West Virginia University (2011)"},{"key":"22_CR10","unstructured":"Kosaraju, S.: Faster algorithms for the construction of parameterized suffix trees. In: FOCS 1995, pp. 631-637 (1995)"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/S0097539701424465","volume":"33","author":"R. Cole","year":"2003","unstructured":"Cole, R., Hariharan, R.: Faster suffix tree construction with missing suffix links. SIAM J. Comput.\u00a033(1), 26\u201342 (2003)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"22_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.ipl.2010.11.017","volume":"111","author":"T. Lee","year":"2011","unstructured":"Lee, T., Na, J., Park, K.: On-line construction of parameterized suffix trees for large alphabets. Inf. Process. Lett.\u00a0111(5), 201\u2013207 (2011)","journal-title":"Inf. Process. Lett."},{"key":"22_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"key":"22_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-78909-5","volume-title":"The Burrows-Wheeler Transform: Data Compression, Suffix Arrays and Pattern Matching","author":"D. Adjeroh","year":"2008","unstructured":"Adjeroh, D., Bell, T., Mukherjee, A.: The Burrows-Wheeler Transform: Data Compression, Suffix Arrays and Pattern Matching. Springer, New York (2008)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-10217-2_31","volume-title":"Combinatorial Algorithms","author":"I. Tomohiro","year":"2009","unstructured":"I, T., Deguchi, S., Bannai, H., Inenaga, S., Takeda, M.: Lightweight Parameterized Suffix Array Construction. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 312\u2013323. Springer, Heidelberg (2009)"},{"key":"22_CR16","unstructured":"Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S., Takeda, M.: Parameterized suffix arrays for binary strings. In: PSC 2008, pp. 84-94 (2008)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-642-25011-8_4","volume-title":"Combinatorial Algorithms","author":"R. Beal","year":"2011","unstructured":"Beal, R., Adjeroh, D.: p-Suffix Sorting as Arithmetic Coding. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 44\u201356. Springer, Heidelberg (2011)"},{"key":"22_CR18","first-page":"151","volume":"16","author":"R. Beal","year":"2012","unstructured":"Beal, R., Adjeroh, D.: p-Suffix Sorting as Arithmetic Coding. JDA\u00a016, 151\u2013169 (2012)","journal-title":"JDA"},{"key":"22_CR19","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. Inf. Process. Lett.\u00a049, 111\u2013115 (1994)","journal-title":"Inf. Process. Lett."},{"key":"22_CR20","unstructured":"Baker, B.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: SODA 1995, pp. 541\u2013550 (1995)"},{"issue":"3","key":"22_CR21","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. Inf. Process. Lett.\u00a0100(3), 91\u201396 (2006)","journal-title":"Inf. Process. Lett."},{"key":"22_CR22","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2012.02.004","volume":"437","author":"R. Beal","year":"2012","unstructured":"Beal, R., Adjeroh, D.: Parameterized longest previous factor. Theor. Comput. Sci.\u00a0437, 21\u201334 (2012)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:33:49Z","timestamp":1620135229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}