{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:40:11Z","timestamp":1746265211465,"version":"3.40.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_34","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:44:25Z","timestamp":1402418665000},"page":"400-411","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Representation for Online Suffix Tree Construction"],"prefix":"10.1007","author":[{"given":"N. Jesper","family":"Larsson","sequence":"first","affiliation":[]},{"given":"Kasper","family":"Fuglsang","sequence":"additional","affiliation":[]},{"given":"Kenneth","family":"Karlsson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Apostolico, A.: The myriad virtues of subword trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO ASI Series, vol.\u00a0F 12, pp. 85\u201396. Springer (1985)","DOI":"10.1007\/978-3-642-82456-2_6"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Arbitman, Y., Naor, M., Segev, G.: Backyard cuckoo hashing: Constant worst-case operations with a succinct representation. In: Proc. 51st Ann. IEEE Symp. Foundations of Comput. Sci., pp. 787\u2013796 (2010)","DOI":"10.1109\/FOCS.2010.80"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-13193-6_9","volume-title":"Experimental Algorithms","author":"R. C\u00e1novas","year":"2010","unstructured":"C\u00e1novas, R., Navarro, G.: Practical compressed suffix trees. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 94\u2013105. Springer, Heidelberg (2010)"},{"key":"34_CR4","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage. In: Proc. Seventh Ann. ACM\u2013SISM Symp. Discrete Algorithms, pp. 383\u2013391 (1996)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th Ann. IEEE Symp. Foundations of Comput. Sci., pp. 137\u2013143 (October 1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Ferragina, P.: Suffix tree construction in hierarchical memory. In: Encyclopedia of Algorithms, pp. 922\u2013925. Springer (2008)","DOI":"10.1007\/978-0-387-30162-4_413"},{"key":"34_CR7","unstructured":"Ferragina, P., Navarro, G.: Pizza & chili corpus (2005), http:\/\/pizzachili.dcc.uchile.cl\/"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Frigo, M., Leiserson, C., Prokop, H., Ramachandran, S.: Cache-oblivious algorithms. In: Proc. 40th Ann. IEEE Symp. Foundations of Comput. Sci., pp. 285\u2013297 (1999)","DOI":"10.1109\/SFFCS.1999.814600"},{"issue":"11","key":"34_CR9","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1002\/spe.535","volume":"33","author":"R. Giegerich","year":"2001","unstructured":"Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Software \u2013 Practice and Experience\u00a033(11), 1035\u20131049 (2001)","journal-title":"Software \u2013 Practice and Experience"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/jagm.2001.1171","volume":"41","author":"T. Hagerup","year":"2001","unstructured":"Hagerup, T., Miltersen, P.B., Pagh, R.: Deterministic dictionaries. Journal of Algorithms\u00a041(1), 69\u201385 (2001)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"34_CR12","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1101\/gr.113985.110","volume":"21","author":"S.M. Kie\u0142basa","year":"2011","unstructured":"Kie\u0142basa, S.M., Wan, R., Sato, K., Horton, P., Frith, M.C.: Adaptive seeds tame genomic sequence comparison. Genome Research\u00a021(3), 487\u2013493 (2011)","journal-title":"Genome Research"},{"issue":"13","key":"34_CR13","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O","volume":"29","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S.: Reducing the space requirement of suffix trees. Software \u2013 Practice and Experience\u00a029(13), 1149\u20131171 (1999)","journal-title":"Software \u2013 Practice and Experience"},{"key":"34_CR14","doi-asserted-by":"crossref","unstructured":"Larsson, N.J.: Extended application of suffix trees to data compression. In: Proc. IEEE Data Compression Conf., pp. 190\u2013199 (March-April 1996)","DOI":"10.1109\/DCC.1996.488324"},{"issue":"5","key":"34_CR15","first-page":"935","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"J. Comput."},{"key":"34_CR16","unstructured":"Manzini, G., Ferragina, P.: Lightweight corpus (2004), http:\/\/people.unipmn.it\/manzini\/lightweight\/corpus\/"},{"issue":"2","key":"34_CR17","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. J. ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"J. ACM"},{"key":"34_CR18","unstructured":"Perf: Linux profiling with performance counters, https:\/\/perf.wiki.kernel.org\/"},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Senft, M., Dvo\u0159\u00e1k, T.: On-line suffix tree construction with reduced branching. Journal of Discrete Algorithms\u00a012(0), 48\u201360 (2012)","DOI":"10.1016\/j.jda.2012.01.001"},{"issue":"3","key":"34_CR20","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00778-005-0154-8","volume":"14","author":"Y. Tian","year":"2005","unstructured":"Tian, Y., Tata, S., Hankins, R.A., Patel, J.M.: Practical methods for constructing suffix trees. The VLDB Journal\u00a014(3), 281\u2013289 (2005)","journal-title":"The VLDB Journal"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Tsirogiannis, D., Koudas, N.: Suffix tree construction algorithms on modern hardware. In: Proc. 13th International Conference on Extending Database Technology, pp. 263\u2013274 (2010)","DOI":"10.1145\/1739041.1739075"},{"issue":"3","key":"34_CR22","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":"34_CR23","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th Ann. IEEE Symp. Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:04:14Z","timestamp":1746263054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}