{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:11Z","timestamp":1750694711582,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_68","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"789-799","source":"Crossref","is-referenced-by-count":8,"title":["Computing Lempel-Ziv Factorization Online"],"prefix":"10.1007","author":[{"given":"Tatiana","family":"Starikovskaya","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(86)90041-1","volume":"45","author":"M. Crochemore","year":"1986","unstructured":"Crochemore, M.: Transducers and repetitions. Theor. Comput. Sci.\u00a045, 63\u201386 (1986)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"68_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Transactions on Information Theory"},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of the 1999 Symposium on Foundations of Computer Science, pp. 596\u2013604. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"68_CR4","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci.\u00a069, 525\u2013546 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"68_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-21458-5_6","volume-title":"Combinatorial Pattern Matching","author":"S. Kreft","year":"2011","unstructured":"Kreft, S., Navarro, G.: Self-indexing Based on LZ77. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 41\u201354. Springer, Heidelberg (2011)"},{"key":"68_CR6","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1981","unstructured":"Rodeh, M., Pratt, V.R., Even, S.: Linear algorithm for data compression via string matching. J. ACM\u00a028, 16\u201324 (1981)","journal-title":"J. ACM"},{"key":"68_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","volume":"2","author":"M.I. Abouelhoda","year":"2004","unstructured":"Abouelhoda, M.I., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. of Discrete Algorithms\u00a02, 53\u201386 (2004)","journal-title":"J. of Discrete Algorithms"},{"issue":"4","key":"68_CR8","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/s11786-007-0024-4","volume":"1","author":"G. Chen","year":"2008","unstructured":"Chen, G., Puglisi, S.J., Smyth, W.F.: Lempel-Ziv factorization using less time & space. Mathematics in Computer Science\u00a01(4), 605\u2013623 (2008)","journal-title":"Mathematics in Computer Science"},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2007.10.006","volume":"106","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Computing longest previous factor in linear time and applications. Inf. Process. Lett.\u00a0106, 75\u201380 (2008)","journal-title":"Inf. Process. Lett."},{"key":"68_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-10217-2_18","volume-title":"Combinatorial Algorithms","author":"M. Crochemore","year":"2009","unstructured":"Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Wale\u0144, T.: LPF Computation Revisited. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 158\u2013169. Springer, Heidelberg (2009)"},{"key":"68_CR11","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/DCC.2008.36","volume-title":"Proceedings of the Data Compression Conference","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L., Smyth, W.F.: A simple algorithm for computing the Lempel-Ziv factorization. In: Proceedings of the Data Compression Conference, pp. 482\u2013488. IEEE Computer Society, Washington, DC (2008)"},{"key":"68_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-21458-5_4","volume-title":"Combinatorial Pattern Matching","author":"E. Ohlebusch","year":"2011","unstructured":"Ohlebusch, E., Gog, S.: Lempel-Ziv Factorization Revisited. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 15\u201326. Springer, Heidelberg (2011)"},{"key":"68_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-540-87744-8_58","volume-title":"Algorithms - ESA 2008","author":"D. Okanohara","year":"2008","unstructured":"Okanohara, D., Sadakane, K.: An Online Algorithm for Finding the Longest Previous Factors. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 696\u2013707. Springer, Heidelberg (2008)"},{"key":"68_CR14","doi-asserted-by":"crossref","unstructured":"Chiu, S.-Y., Hon, W.-K., Shah, R., Vitter, J.S.: Geometric Burrows-Wheeler transform: Linking range searching and text indexing. In: Proceedings of the Data Compression Conference, pp. 252\u2013261. IEEE Computer Society (2008)","DOI":"10.1109\/DCC.2008.67"},{"key":"68_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-03784-9_8","volume-title":"String Processing and Information Retrieval","author":"W.-K. Hon","year":"2009","unstructured":"Hon, W.-K., Shah, R., Thankachan, S.V., Vitter, J.S.: On Entropy-Compressed Text Indexing in External Memory. In: Karlgren, J., Tarhio, J., Hyyr\u00f6, H. (eds.) SPIRE 2009. LNCS, vol.\u00a05721, pp. 75\u201389. Springer, Heidelberg (2009)"},{"key":"68_CR16","doi-asserted-by":"crossref","unstructured":"Chiu, S.-Y., Hon, W.-K., Shah, R., Vitter, J.S.: I\/O-efficient compressed text indexes: From theory to practice. In: Proceedings of the Data Compression Conference, pp. 426\u2013434. IEEE Computer Society (2010)","DOI":"10.1109\/DCC.2010.45"},{"key":"68_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"Computing and Combinatorics","author":"J. K\u00e4rkk\u00e4inen","year":"1996","unstructured":"K\u00e4rkk\u00e4inen, J., Ukkonen, E.: Sparse Suffix Trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 219\u2013230. Springer, Heidelberg (1996)"},{"key":"68_CR18","doi-asserted-by":"crossref","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica, 249\u2013260 (1995)","DOI":"10.1007\/BF01206331"},{"key":"68_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1367064.1367072","volume":"4","author":"V. M\u00e4kinen","year":"2008","unstructured":"M\u00e4kinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Algorithms\u00a04, 32:1\u201332:38 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"68_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/11682462_64","volume-title":"LATIN 2006: Theoretical Informatics","author":"V. M\u00e4kinen","year":"2006","unstructured":"M\u00e4kinen, V., Navarro, G.: Position-Restricted Substring Searching. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 703\u2013714. Springer, Heidelberg (2006)"},{"key":"68_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-31265-6_16","volume-title":"Combinatorial Pattern Matching","author":"G. Kucherov","year":"2012","unstructured":"Kucherov, G., Nekrich, Y., Starikovskaya, T.: Cross-Document Pattern Matching. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 196\u2013207. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T11:21:16Z","timestamp":1743938476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}