{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:55Z","timestamp":1759639015350},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_31","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"312-323","source":"Crossref","is-referenced-by-count":7,"title":["Lightweight Parameterized Suffix Array Construction"],"prefix":"10.1007","author":[{"given":"Tomohiro","family":"I","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Deguchi","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","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":"1","key":"31_CR2","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":"31_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":"31_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"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern-matching algorithms. In: Proc. of 14th IEEE Ann. Symp. on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"issue":"5","key":"31_CR6","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"},{"issue":"2","key":"31_CR7","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"issue":"3","key":"31_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th Annual Symposium on Foundations of Computer Science, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D.K. Kim","year":"2003","unstructured":"Kim, D.K., Sim, J.S., Park, H., Park, K.: Linear-time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. Journal of Discrete Algorithms\u00a02(1), 53\u201386 (2004)","journal-title":"Journal of Discrete Algorithms"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/978-3-540-30213-1_22","volume-title":"String Processing and Information Retrieval","author":"D.K. Kim","year":"2004","unstructured":"Kim, D.K., Jeon, J.E., Park, H.: An efficient index data structure with the capabilities of suffix trees and suffix arrays for alphabets of non-negligible size. In: Apostolico, A., Melucci, M. (eds.) SPIRE 2004. LNCS, vol.\u00a03246, pp. 138\u2013149. Springer, Heidelberg (2004)"},{"key":"31_CR15","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"},{"key":"31_CR16","unstructured":"Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S., Takeda, M.: Parameterized suffix arrays for binary strings. In: Proc. PSC 2008, pp. 84\u201394 (2008)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"issue":"3","key":"31_CR18","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":"31_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00453-004-1094-1","volume":"40","author":"G. Manzini","year":"2004","unstructured":"Manzini, G., Ferragina, P.: Engineering a lightweight suffix array construction algorithm. Algorithmica\u00a040, 33\u201350 (2004)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:32Z","timestamp":1619782472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}