{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:30Z","timestamp":1725455010462},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341083"},{"type":"electronic","value":"9783642341090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34109-0_38","type":"book-chapter","created":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T07:14:53Z","timestamp":1347520493000},"page":"360-371","source":"Crossref","is-referenced-by-count":4,"title":["The Position Heap of a Trie"],"prefix":"10.1007","author":[{"given":"Yuto","family":"Nakashima","sequence":"first","affiliation":[]},{"given":"Tomohiro","family":"I","sequence":"additional","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":"2","key":"38_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/1103963.1103966","volume":"1","author":"S. Alstrup","year":"2005","unstructured":"Alstrup, S., Holm, J., de Lichtenberg, K., Thorup, M.: Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms\u00a01(2), 243\u2013264 (2005)","journal-title":"ACM Transactions on Algorithms"},{"issue":"2","key":"38_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/inco.1995.1090","volume":"119","author":"A. Amir","year":"1995","unstructured":"Amir, A., Farach, M., Idury, R.M., La Poutr\u00e9, J.A., Sch\u00e4ffer, A.A.: Improved dynamic dictionary matching. Information and Computation\u00a0119(2), 258\u2013282 (1995)","journal-title":"Information and Computation"},{"issue":"1","key":"38_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"M.A. Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci.\u00a0321(1), 5\u201312 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"38_CR4","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/S0022-0000(05)80002-9","volume":"48","author":"O. Berkman","year":"1994","unstructured":"Berkman, O., Vishkin, U.: Finding level-ancestors in trees. J. Comput. Syst. Sci.\u00a048(2), 214\u2013230 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"38_CR5","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., Mcconnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. J. ACM\u00a034(3), 578\u2013595 (1987)","journal-title":"J. ACM"},{"key":"38_CR6","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. Theoret. Comput. Sci.\u00a040, 31\u201355 (1985)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-2","key":"38_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(96)00319-2","volume":"191","author":"D. Breslauer","year":"1998","unstructured":"Breslauer, D.: The suffix tree of a tree and minimizing sequential transducers. Theoretical Computer Science\u00a0191(1-2), 131\u2013144 (1998)","journal-title":"Theoretical Computer Science"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/362686.362693","volume":"13","author":"E. Coffman","year":"1970","unstructured":"Coffman, E., Eve, J.: File structures using hashing functions. Communications of the ACM\u00a013, 427\u2013432 (1970)","journal-title":"Communications of the ACM"},{"issue":"1","key":"38_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.jda.2010.12.001","volume":"9","author":"A. Ehrenfeucht","year":"2011","unstructured":"Ehrenfeucht, A., McConnell, R.M., Osheim, N., Woo, S.-W.: Position heaps: A simple and dynamic text indexing data structure. Journal of Discrete Algorithms\u00a09(1), 100\u2013121 (2011)","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"38_CR10","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.dam.2004.04.012","volume":"146","author":"S. Inenaga","year":"2005","unstructured":"Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S., Mauri, G., Pavesi, G.: On-line construction of compact directed acyclic word graphs. Discrete Applied Mathematics\u00a0146(2), 156\u2013179 (2005)","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"38_CR11","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM\u00a053(6), 918\u2013936 (2006)","journal-title":"J. ACM"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Efficient tree pattern matching. In: Proc. FOCS 1989, pp. 178\u2013183 (1989)","DOI":"10.1109\/SFCS.1989.63475"},{"key":"38_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-24583-1_32","volume-title":"String Processing and Information Retrieval","author":"G. Kucherov","year":"2011","unstructured":"Kucherov, G.: On-Line Construction of Position Heaps. In: Grossi, R., Sebastiani, F., Silvestri, F. (eds.) SPIRE 2011. LNCS, vol.\u00a07024, pp. 326\u2013337. Springer, Heidelberg (2011)"},{"issue":"5","key":"38_CR14","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.\u00a0Computing\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J.\u00a0Computing"},{"issue":"5","key":"38_CR15","first-page":"1061","volume":"E86-A","author":"T. Shibuya","year":"2003","unstructured":"Shibuya, T.: Constructing the suffix tree of a tree with a large alphabet. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences\u00a0E86-A(5), 1061\u20131066 (2003)","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"3","key":"38_CR16","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":"38_CR17","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"},{"key":"38_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-55719-9_86","volume-title":"Automata, Languages and Programming","author":"J. Westbrook","year":"1992","unstructured":"Westbrook, J.: Fast Incremental Planarity Testing. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 342\u2013353. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34109-0_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:45:16Z","timestamp":1620117916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34109-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341083","9783642341090"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34109-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}