{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:34:34Z","timestamp":1743100474998,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031721991"},{"type":"electronic","value":"9783031722004"}],"license":[{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T00:00:00Z","timestamp":1726704000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-72200-4_12","type":"book-chapter","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:01:50Z","timestamp":1726686110000},"page":"159-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Computation of\u00a0String Net Frequency"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9098-1783","authenticated-orcid":false,"given":"Peaker","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6984-4007","authenticated-orcid":false,"given":"Seeun William","family":"Umboh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3746-6704","authenticated-orcid":false,"given":"Anthony","family":"Wirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6622-032X","authenticated-orcid":false,"given":"Justin","family":"Zobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07566-2","volume-title":"Combinatorial Pattern Matching","year":"2014","unstructured":"Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.): CPM 2014. LNCS, vol. 8486. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07566-2"},{"issue":"6","key":"12_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975). https:\/\/doi.org\/10.1145\/360825.360855","journal-title":"Commun. ACM"},{"issue":"2","key":"12_CR3","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/INCO.1995.1090","volume":"119","author":"A Amir","year":"1995","unstructured":"Amir, A., Farach, M., Idury, R.M., Poutr\u00e9, J.A.L., Sch\u00e4ffer, A.A.: Improved dynamic dictionary matching. Inf. Comput. 119(2), 258\u2013282 (1995). https:\/\/doi.org\/10.1006\/INCO.1995.1090","journal-title":"Inf. Comput."},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Cunial, F.: Fully-functional bidirectional Burrows-Wheeler indexes and infinite-order de Bruijn graphs. In: 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy. LIPIcs, vol.\u00a0128, pp. 10:1\u201310:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2019.10","DOI":"10.4230\/LIPICS.CPM.2019.10"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45749-6_17","volume-title":"Algorithms \u2014 ESA 2002","author":"MA Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: M\u00f6hring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 152\u2013164. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45749-6_17"},{"key":"12_CR6","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. Theoret. Comput. Sci. 457, 27\u201334 (2012). https:\/\/doi.org\/10.1016\/J.TCS.2012.07.018","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR7","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). https:\/\/doi.org\/10.1016\/J.JDA.2012.07.003","journal-title":"J. Discrete Algorithms"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Feigenblat, G., Porat, E., Shiftan, A.: An improved query time for succinct dynamic dictionary matching. In: 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, June 16-18, Moscow, Russia [1], pp. 120\u2013129 (2014). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_13","DOI":"10.1007\/978-3-319-07566-2_13"},{"key":"12_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2023.114093","volume":"973","author":"Y Fujishige","year":"2023","unstructured":"Fujishige, Y., Tsujimaru, Y., Inenaga, S., Bannai, H., Takeda, M.: Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets. Theoret. Comput. Sci. 973, 114093 (2023). https:\/\/doi.org\/10.1016\/J.TCS.2023.114093","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Guo, P., Eades, P., Wirth, A., Zobel, J.: Exploiting new properties of string net frequency for efficient computation. In: 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, June 25-27 2024, Fukuoka, Japan. LIPIcs, vol.\u00a0296, pp. 16:1\u201316:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2024.16","DOI":"10.4230\/LIPICS.CPM.2024.16"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997). https:\/\/doi.org\/10.1017\/CBO9780511574931","DOI":"10.1017\/CBO9780511574931"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/11780441_7","volume-title":"Combinatorial Pattern Matching","author":"S Inenaga","year":"2006","unstructured":"Inenaga, S., Takeda, M.: On-line linear-time construction of word suffix trees. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 60\u201371. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780441_7"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Larsson, N.J.: Most recent match queries in on-line suffix trees. In: 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, June 16-18, 2014. Moscow, Russia [1], pp. 252\u2013261 (2014). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_26","DOI":"10.1007\/978-3-319-07566-2_26"},{"key":"12_CR14","unstructured":"Lin, Y., Yu, M.: Extracting Chinese frequent strings without dictionary from a Chinese corpus and its applications. J. Inf. Sci. Eng. 17(5), 805\u2013824 (2001), https:\/\/jise.iis.sinica.edu.tw\/JISESearch\/pages\/View\/PaperView.jsf?keyId=86_1308"},{"key":"12_CR15","unstructured":"Lin, Y., Yu, M.: The properties and further applications of Chinese frequent strings. Int. J. Comput. Linguist. Chin. Lang. Process. 9(1), 113\u2013128 (2004). http:\/\/www.aclclp.org.tw\/clclp\/v9n1\/v9n1a7.pdf"},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. ACM 23(2), 262\u2013272 (1976). https:\/\/doi.org\/10.1145\/321941.321946","journal-title":"J. ACM"},{"issue":"11","key":"12_CR17","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1109\/26.61469","volume":"38","author":"A Moffat","year":"1990","unstructured":"Moffat, A.: Implementing the PPM data compression scheme. IEEE Trans. Commun. 38(11), 1917\u20131921 (1990). https:\/\/doi.org\/10.1109\/26.61469","journal-title":"IEEE Trans. Commun."},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/J.TCS.2022.09.008","volume":"933","author":"K Nakashima","year":"2022","unstructured":"Nakashima, K., et al.: Parameterized DAWGs: efficient constructions and bidirectional pattern searches. Theoret. Comput. Sci. 933, 21\u201342 (2022). https:\/\/doi.org\/10.1016\/J.TCS.2022.09.008","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/J.JDA.2015.01.005","volume":"32","author":"T Starikovskaya","year":"2015","unstructured":"Starikovskaya, T., Vildh\u00f8j, H.W.: A suffix tree or not a suffix tree? J. Discrete Algorithms 32, 14\u201323 (2015). https:\/\/doi.org\/10.1016\/J.JDA.2015.01.005","journal-title":"J. Discrete Algorithms"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Takagi, T., Inenaga, S., Arimura, H.: Fully-online construction of suffix trees for multiple texts. In: 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. LIPIcs, vol.\u00a054, pp. 22:1\u201322:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2016.22","DOI":"10.4230\/LIPICS.CPM.2016.22"},{"issue":"3","key":"12_CR21","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). https:\/\/doi.org\/10.1007\/BF01206331","journal-title":"Algorithmica"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, October 15\u201317, 1973, pp. 1\u201311. IEEE Computer Society (1973). https:\/\/doi.org\/10.1109\/SWAT.1973.13","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-72200-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T19:02:37Z","timestamp":1726686157000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-72200-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,19]]},"ISBN":["9783031721991","9783031722004"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-72200-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,9,19]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Vallarta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/computo.fismat.umich.mx\/spire2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}