{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:23:01Z","timestamp":1755998581200},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389047"},{"type":"electronic","value":"9783642389054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38905-4_11","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T23:28:54Z","timestamp":1368660534000},"page":"95-106","source":"Crossref","is-referenced-by-count":6,"title":["New Algorithms for Position Heaps"],"prefix":"10.1007","author":[{"given":"Travis","family":"Gagie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kai","family":"Hon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsung-Han","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-34109-0_10","volume-title":"String Processing and Information Retrieval","author":"H. Bannai","year":"2012","unstructured":"Bannai, H., Inenaga, S., Takeda, M.: Efficient LZ78 factorization of grammar compressed text. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 86\u201398. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Barbay, J., Claude, F., Gagie, T., Navarro, G., Nekrich, Y.: Efficient fully-compressed sequence representations. Algorithmica (to appear), doi:10.1007\/s00453-012-9726-3","key":"11_CR2","DOI":"10.1007\/s00453-012-9726-3"},{"doi-asserted-by":"crossref","unstructured":"Belazzougui, D., Gagie, T., Navarro, G.: Better space bounds for parameterized range majority and minority. Technical Report 1210.1765 (2012), \n                  \n                    http:\/\/www.arxiv.org","key":"11_CR3","DOI":"10.1007\/978-3-642-40104-6_11"},{"issue":"2","key":"11_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":"7","key":"11_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/362686.362693","volume":"13","author":"E.G. Coffman Jr.","year":"1970","unstructured":"Coffman Jr., E.G., Eve, J.: File structures using hashing functions. Commun. ACM\u00a013(7), 427\u2013432 (1970)","journal-title":"Commun. ACM"},{"issue":"1","key":"11_CR6","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. J. Discrete Algorithms\u00a09(1), 100\u2013121 (2011)","journal-title":"J. Discrete Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Kucherov, G.: On-line construction of position heaps. J. Discrete Algorithms (to appear), doi:10.1016\/j.jda.2012.08.002","key":"11_CR7","DOI":"10.1016\/j.jda.2012.08.002"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-34109-0_38","volume-title":"String Processing and Information Retrieval","author":"Y. Nakashima","year":"2012","unstructured":"Nakashima, Y., Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.: The position heap of a trie. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 360\u2013371. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv.\u00a039(1) (2007)","key":"11_CR9","DOI":"10.1145\/1216370.1216372"},{"issue":"43","key":"11_CR10","doi-asserted-by":"publisher","first-page":"4350","DOI":"10.1016\/j.tcs.2009.07.016","volume":"410","author":"M. Salson","year":"2009","unstructured":"Salson, M., Lecroq, T., L\u00e9onard, M., Mouchard, L.: A four-stage algorithm for updating a Burrows-Wheeler transform. Theor. Comput. Sci.\u00a0410(43), 4350\u20134359 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.jda.2009.02.007","volume":"8","author":"M. Salson","year":"2010","unstructured":"Salson, M., Lecroq, T., L\u00e9onard, M., Mouchard, L.: Dynamic extended suffix arrays. J. Discrete Algorithms\u00a08(2), 241\u2013257 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"11_CR12","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","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38905-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T22:38:40Z","timestamp":1557700720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38905-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389047","9783642389054"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38905-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}