{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:29:32Z","timestamp":1742927372146,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_4","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"44-56","source":"Crossref","is-referenced-by-count":1,"title":["p-Suffix Sorting as Arithmetic Coding"],"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":"4_CR1","first-page":"71","volume-title":"STOC 1993","author":"B. Baker","year":"1993","unstructured":"Baker, B.: A theory of parameterized pattern matching: Algorithms and applications. In: STOC 1993, pp. 71\u201380. ACM, New York (1993)"},{"issue":"1","key":"4_CR2","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":"4_CR3","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."},{"key":"4_CR4","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":"4_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. Inf. Process. Lett.\u00a049, 111\u2013115 (1994)","journal-title":"Inf. Process. Lett."},{"key":"4_CR6","first-page":"541","volume-title":"SODA 1995","author":"B. Baker","year":"1995","unstructured":"Baker, B.: Parameterized pattern matching by Boyer-Moore-type algorithms. In: SODA 1995, pp. 541\u2013550. ACM, Philadelphia (1995)"},{"key":"4_CR7","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":"Tomohiro, I., 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)"},{"unstructured":"Deguchi, S., Higashijima, F., Bannai, H., Inenaga, S., Takeda, M.: Parameterized suffix arrays for binary strings. In: PSC 2008, Czech Republic, pp. 84\u201394 (2008)","key":"4_CR8"},{"key":"4_CR9","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":"4_CR10","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":"4_CR11","volume-title":"Computing Patterns in Strings","author":"W. Smyth","year":"2003","unstructured":"Smyth, W.: Computing Patterns in Strings. Pearson, New York (2003)"},{"key":"4_CR12","first-page":"631","volume-title":"FOCS 1995","author":"S. Kosaraju","year":"1995","unstructured":"Kosaraju, S.: Faster algorithms for the construction of parameterized suffix trees. In: FOCS 1995, pp. 631\u2013637. ACM, Washington, DC (1995)"},{"key":"4_CR13","first-page":"407","volume-title":"STOC 2000","author":"R. Cole","year":"2000","unstructured":"Cole, R., Hariharan, R.: Faster suffix tree construction with missing suffix links. In: STOC 2000, pp. 407\u2013415. ACM, New York (2000)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-03784-9_4","volume-title":"String Processing and Information Retrieval","author":"T. Lee","year":"2009","unstructured":"Lee, T., Na, J.C., Park, K.: On-Line Construction of Parameterized Suffix Trees. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 31\u201338. Springer, Heidelberg (2009)"},{"key":"4_CR15","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. Comput.\u00a022, 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"unstructured":"Beal, R.: Parameterized Strings: Algorithms and Data Structures. MS Thesis. West Virginia University (2011)","key":"4_CR16"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"Karp, R., Rabin, M.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev.\u00a031, 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/290159.290162","volume":"16","author":"A. Moffat","year":"1995","unstructured":"Moffat, A., Neal, R., Witten, I.: Arithmetic coding revisited. ACM Trans. Inf. Syst.\u00a016, 256\u2013294 (1995)","journal-title":"ACM Trans. Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley (1991)","key":"4_CR19","DOI":"10.1002\/0471200611"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.3390\/a3020145","volume":"3","author":"D. Adjeroh","year":"2010","unstructured":"Adjeroh, D., Nan, F.: Suffix sorting via Shannon-Fano-Elias codes. Algorithms\u00a03(2), 145\u2013167 (2010)","journal-title":"Algorithms"},{"issue":"18","key":"4_CR21","doi-asserted-by":"publisher","first-page":"5660","DOI":"10.1073\/pnas.80.18.5660","volume":"80","author":"S. Karlin","year":"1983","unstructured":"Karlin, S., Ghandour, G., et al.: New approaches for computer analysis of nucleic acid sequences. PNAS\u00a080(18), 5660\u20135664 (1983)","journal-title":"PNAS"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/0221005","volume":"21","author":"L. Devroye","year":"1992","unstructured":"Devroye, L., Szpankowski, W., Rais, B.: A note on the height of suffix trees. SIAM J. Comput.\u00a021, 48\u201353 (1992)","journal-title":"SIAM J. Comput."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-540-73420-8_47","volume-title":"Automata, Languages and Programming","author":"G. Franceschini","year":"2007","unstructured":"Franceschini, G., Muthukrishnan, S.: In-Place Suffix Sorting. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 533\u2013545. Springer, Heidelberg (2007)"},{"key":"4_CR24","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, 918\u2013936 (2006)","journal-title":"J. ACM."},{"key":"4_CR25","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. Algorithmca\u00a040, 33\u201350 (2004)","journal-title":"Algorithmca"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T01:16:11Z","timestamp":1555377371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}