{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:38Z","timestamp":1746331418327,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_26","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"252-261","source":"Crossref","is-referenced-by-count":5,"title":["Most Recent Match Queries in On-Line Suffix Trees"],"prefix":"10.1007","author":[{"given":"N. Jesper","family":"Larsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"nato asi series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-82456-2_6","volume-title":"Combinatorial Algorithms on Words","author":"A. Apostolico","year":"1985","unstructured":"Apostolico, A.: The myriad virtues of subword trees. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. nato asi series, vol.\u00a0F12, pp. 85\u201396. Springer, Heidelberg (1985)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"26_CR3","unstructured":"Larsson, N.J.: Structures of String Matching and Data Compression. Ph.D. thesis, Department of Computer Science, Lund University, Sweden (September 1999)"},{"key":"26_CR4","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"},{"issue":"2","key":"26_CR5","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"},{"issue":"3","key":"26_CR6","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":"26_CR7","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"},{"issue":"5","key":"26_CR8","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(5), 935\u2013948 (1993)","journal-title":"siam J. Comput."},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1242471.1242472","volume":"39","author":"S.J. Puglisi","year":"2007","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. acm Computing Surveys (CSUR)\u00a039(2), 4 (2007)","journal-title":"acm Computing Surveys (CSUR)"},{"issue":"5","key":"26_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0020-0190(01)00275-7","volume":"82","author":"A. Amir","year":"2002","unstructured":"Amir, A., Landau, G.M., Ukkonen, E.: Online timestamped text indexing. Information processing letters\u00a082(5), 253\u2013259 (2002)","journal-title":"Information processing letters"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Nitto, I., Venturini, R.: On the bit-complexity of Lempel-Ziv compression. In: Proc. Twentieth Ann. acm \u2013 siam Symp. Discr. Alg. pp. 768\u2013777 (2009)","DOI":"10.1137\/1.9781611973068.84"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Langiu, A., Mignosi, F.: The rightmost equal-cost position problem. In: Proc. ieee Data Compression Conf. pp. 421\u2013430 (March 2013)","DOI":"10.1109\/DCC.2013.50"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2012.07.018","volume":"457","author":"D. Breslauer","year":"2012","unstructured":"Breslauer, D., Italiano, G.F.: On suffix extensions in suffix trees. Theoretical Computer Science\u00a0457, 27\u201334 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"26_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"IT\u00a023","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. ieee Trans. Inf. Theory\u00a0IT\u00a023(3), 337\u2013343 (1977)","journal-title":"ieee Trans. Inf. Theory"},{"key":"26_CR15","unstructured":"Larsson, N.J., Fuglsang, K., Karlsson, K.: Efficient representation for online suffix tree construction. Preprint, arXiv:1403.0457 [cs.DS], http:\/\/arxiv.org\/abs\/1403.0457"},{"key":"26_CR16","unstructured":"Larsson, N.J.: Most recent match queries in on-line suffix trees (with appendix), arXiv:1403.0800 [cs.DS], http:\/\/arxiv.org\/abs\/1403.0800"},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1137\/S0097539700370539","volume":"34","author":"R. Cole","year":"2005","unstructured":"Cole, R., Hariharan, R.: Dynamic lca queries on trees. SIAM Journal on Computing\u00a034(4), 894\u2013923 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"26_CR18","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/63334.63341","volume":"32","author":"E.R. Fiala","year":"1989","unstructured":"Fiala, E.R., Greene, D.H.: Data compression with finite windows. Commun. acm\u00a032(4), 490\u2013505 (1989)","journal-title":"Commun. acm"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Larsson, N.J.: Extended application of suffix trees to data compression. In: Proc. acm Data Compression Conf. pp. 190\u2013199 (March-April 1996)","DOI":"10.1109\/DCC.1996.488324"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Dietz, P., Sleator, D.: Two algorithms for maintaining order in a list. In: Proc. 19th Ann. acm Symp. Theory of Computing, pp. 365\u2013372. ACM (1987)","DOI":"10.1145\/28395.28434"},{"key":"26_CR21","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-319-07566-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:38:49Z","timestamp":1746265129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}