{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:31Z","timestamp":1740109291069,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T00:00:00Z","timestamp":1572480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T00:00:00Z","timestamp":1572480000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00453-019-00646-w","type":"journal-article","created":{"date-parts":[[2019,10,31]],"date-time":"2019-10-31T11:16:37Z","timestamp":1572520597000},"page":"1346-1377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts"],"prefix":"10.1007","volume":"82","author":[{"given":"Takuya","family":"Takagi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1833-010X","authenticated-orcid":false,"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dany","family":"Breslauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diptarama","family":"Hendrian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,31]]},"reference":[{"key":"646_CR1","first-page":"1","volume":"2002","author":"B Babcock","year":"2002","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. PODS 2002, 1\u201316 (2002)","journal-title":"PODS"},{"key":"646_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40, 31\u201355 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"646_CR3","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A Blumer","year":"1987","unstructured":"Blumer, A., Blumer, J., Haussler, D., Mcconnell, R., Ehrenfeucht, A.: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3), 578\u2013595 (1987)","journal-title":"J. ACM"},{"key":"646_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jda.2012.07.003","volume":"18","author":"D Breslauer","year":"2013","unstructured":"Breslauer, D., Italiano, G.F.: Near real-time suffix tree construction via the fringe marked ancestor problem. J. Discrete Algorithms 18, 32\u201348 (2013)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"646_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1240233.1240244","volume":"3","author":"Ho-Leung Chan","year":"2007","unstructured":"Chan, H., Hon, W., Lam, T.W., Sadakane, K.: Compressed indexes for dynamic text collections. ACM Trans. Algorithms 3(2), Article no 21 (2007)","journal-title":"ACM Transactions on Algorithms"},{"issue":"1","key":"646_CR6","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. 45(1), 63\u201386 (1986)","journal-title":"Theor. Comput. Sci."},{"key":"646_CR7","volume-title":"Text Algorithms","author":"M Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"issue":"2","key":"646_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1006\/jagm.1998.0999","volume":"31","author":"P Ferragina","year":"1999","unstructured":"Ferragina, P., Grossi, R.: Improved dynamic text indexing. J. Algorithms 31(2), 291\u2013319 (1999)","journal-title":"J. Algorithms"},{"key":"646_CR9","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-19929-0_14","volume-title":"Combinatorial Pattern Matching","author":"Johannes Fischer","year":"2015","unstructured":"Fischer, J., Gawrychowski, P.: Alphabet-dependent string searching with wexponential search trees. In: CPM 2015, pp. 160\u2013171 (2015). arXiv preprint \narXiv:1302.3347"},{"key":"646_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences\u2014Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences\u2014Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"646_CR11","first-page":"52","volume":"10","author":"S Inenaga","year":"2003","unstructured":"Inenaga, S.: Bidirectional construction of suffix trees. Nord. J. Comput. 10(1), 52\u201367 (2003)","journal-title":"Nord. J. Comput."},{"key":"646_CR12","first-page":"550","volume":"2002","author":"EJ Keogh","year":"2002","unstructured":"Keogh, E.J., Lonardi, S., Chiu, B.Y.: Finding surprising patterns in a time series database in linear time and space. KDD 2002, 550\u2013556 (2002)","journal-title":"KDD"},{"key":"646_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"key":"646_CR14","unstructured":"Takagi, T., Inenaga, S., Arimura, H.: Fully-online construction of suffix trees for multiple texts. In: Proceedings of CPM 2016, pp. 22:1\u201322:13 (2016). arXiv preprint \narXiv:1507.07622"},{"issue":"3","key":"646_CR15","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 14(3), 249\u2013260 (1995)","journal-title":"Algorithmica"},{"key":"646_CR16","first-page":"25","volume":"2014","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Zheng, Y., Xue, Y.: Travel time estimation of a path using sparse trajectories. KDD 2014, 25\u201334 (2014)","journal-title":"KDD"},{"key":"646_CR17","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern-matching algorithms. In: Proceedings of 14th IEEE Annual Symposium on Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"646_CR18","first-page":"342","volume":"1992","author":"J Westbrook","year":"1992","unstructured":"Westbrook, J.: Fast incremental planarity testing. ICALP 1992, 342\u2013353 (1992)","journal-title":"ICALP"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00646-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00646-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00646-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:13:18Z","timestamp":1604016798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00646-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,31]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["646"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00646-w","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,10,31]]},"assertion":[{"value":"8 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}