{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:43:43Z","timestamp":1743011023168,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031439797"},{"type":"electronic","value":"9783031439803"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43980-3_28","type":"book-chapter","created":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:02:15Z","timestamp":1695124935000},"page":"345-352","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Frequency-Constrained Substring Complexity"],"prefix":"10.1007","author":[{"given":"Solon P.","family":"Pissis","sequence":"first","affiliation":[]},{"given":"Michael","family":"Shekelyan","sequence":"additional","affiliation":[]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Grigorios","family":"Loukides","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,20]]},"reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1240233.1240242","volume":"3","author":"A Amir","year":"2007","unstructured":"Amir, A., Landau, G.M., Lewenstein, M., Sokol, D.: Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2), 19 (2007). https:\/\/doi.org\/10.1145\/1240233.1240242","journal-title":"ACM Trans. Algorithms"},{"key":"28_CR2","doi-asserted-by":"publisher","unstructured":"Belazzougui, D., Kosolobov, D., Puglisi, S.J., Raman, R.: Weighted ancestors in suffix trees revisited. In: Gawrychowski, P., Starikovskaya, T. (eds.) 32nd Annual Symposium on Combinatorial Pattern Matching, CPM 2021, 5\u20137 July 2021, Wroc\u0142aw, Poland. LIPIcs, vol. 191, pp. 8:1\u20138:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2021.8","DOI":"10.4230\/LIPIcs.CPM.2021.8"},{"issue":"4\/5","key":"28_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"WI Chang","year":"1994","unstructured":"Chang, W.I., Lawler, E.L.: Sublinear approximate string matching and biological applications. Algorithmica 12(4\/5), 327\u2013344 (1994). https:\/\/doi.org\/10.1007\/BF01185431","journal-title":"Algorithmica"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"28_CR5","doi-asserted-by":"publisher","unstructured":"Delcher, A.L., Kasif, S., Fleischmann, R.D., Peterson, J., White, O., Salzberg, S.L.: Alignment of whole genomes. Nucleic Acids Res. 27(11), 2369\u20132376 (1999). https:\/\/doi.org\/10.1093\/nar\/27.11.2369","DOI":"10.1093\/nar\/27.11.2369"},{"issue":"3","key":"28_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P van Emde Boas","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett. 6(3), 80\u201382 (1977). https:\/\/doi.org\/10.1016\/0020-0190(77)90031-X","journal-title":"Inf. Process. Lett."},{"key":"28_CR7","doi-asserted-by":"publisher","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, FOCS \u201997, Miami Beach, Florida, USA, 19\u201322 October 1997, pp. 137\u2013143. IEEE Computer Society (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646102","DOI":"10.1109\/SFCS.1997.646102"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-61258-0_11","volume-title":"Combinatorial Pattern Matching","author":"M Farach","year":"1996","unstructured":"Farach, M., Muthukrishnan, S.: Perfect hashing for strings: formalization and algorithms. In: Hirschberg, D., Myers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 130\u2013140. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61258-0_11"},{"issue":"1\u20133","key":"28_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0012-365X(98)00400-2","volume":"206","author":"S Ferenczi","year":"1999","unstructured":"Ferenczi, S.: Complexity of sequences and dynamical systems. Discret. Math. 206(1\u20133), 145\u2013154 (1999). https:\/\/doi.org\/10.1016\/S0012-365X(98)00400-2","journal-title":"Discret. Math."},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"ML Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with 0(1) worst case access time. J. ACM 31(3), 538\u2013544 (1984). https:\/\/doi.org\/10.1145\/828.1884","journal-title":"J. ACM"},{"key":"28_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":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-56024-6_19","volume-title":"Combinatorial Pattern Matching","author":"L Chi","year":"1992","unstructured":"Chi, L., Hui, K.: Color set size problem with applications to string matching. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) CPM 1992. LNCS, vol. 644, pp. 230\u2013243. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-56024-6_19"},{"issue":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"2074","DOI":"10.1109\/TIT.2022.3224382","volume":"69","author":"T Kociumaka","year":"2023","unstructured":"Kociumaka, T., Navarro, G., Prezza, N.: Toward a definitive compressibility measure for repetitive sequences. IEEE Trans. Inf. Theory 69(4), 2074\u20132092 (2023). https:\/\/doi.org\/10.1109\/TIT.2022.3224382","journal-title":"IEEE Trans. Inf. Theory"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-59212-7_15","volume-title":"String Processing and Information Retrieval","author":"K Kutsukake","year":"2020","unstructured":"Kutsukake, K., Matsumoto, T., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: On repetitiveness measures of thue-morse words. In: Boucher, C., Thankachan, S.V. (eds.) SPIRE 2020. LNCS, vol. 12303, pp. 213\u2013220. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_15"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Rajaraman, A., Ullman, J.D.: Mining of Massive Datasets, 2nd ed. Cambridge University Press, Cambridge (2014). https:\/\/www.mmds.org\/","DOI":"10.1017\/CBO9781139924801"},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Loukides, G., Pissis, S.P.: Bidirectional string anchors: a new string sampling mechanism. In: Mutzel, P., Pagh, R., Herman, G. (eds.) 29th Annual European Symposium on Algorithms, ESA 2021, 6\u20138 September 2021, Lisbon, Portugal (Virtual Conference). LIPIcs, vol. 204, pp. 64:1\u201364:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.64","DOI":"10.4230\/LIPIcs.ESA.2021.64"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(89)90046-7","volume":"65","author":"F Mignosi","year":"1989","unstructured":"Mignosi, F.: Infinite words with linear subword complexity. Theor. Comput. Sci. 65(2), 221\u2013242 (1989). https:\/\/doi.org\/10.1016\/0304-3975(89)90046-7","journal-title":"Theor. Comput. Sci."},{"key":"28_CR18","doi-asserted-by":"publisher","unstructured":"Navarro, G., Rojas-Ledesma, J.: Predecessor search. ACM Comput. Surv. 53(5), 105:1\u2013105:35 (2021). https:\/\/doi.org\/10.1145\/3409371","DOI":"10.1145\/3409371"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1186\/1471-2105-15-235","volume":"15","author":"SP Pissis","year":"2014","unstructured":"Pissis, S.P.: MoTeX-II: structured MoTif eXtraction from large-scale datasets. BMC Bioinform. 15, 235 (2014). https:\/\/doi.org\/10.1186\/1471-2105-15-235","journal-title":"BMC Bioinform."},{"key":"28_CR20","doi-asserted-by":"publisher","unstructured":"Puglisi, S.J., Zhukova, B.: Document retrieval hacks. In: Coudert, D., Natale, E. (eds.) 19th International Symposium on Experimental Algorithms, SEA 2021, 7\u20139 June 2021, Nice, France. LIPIcs, vol. 190, pp. 12:1\u201312:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2021.12","DOI":"10.4230\/LIPIcs.SEA.2021.12"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s00453-012-9618-6","volume":"65","author":"S Raskhodnikova","year":"2013","unstructured":"Raskhodnikova, S., Ron, D., Rubinfeld, R., Smith, A.D.: Sublinear algorithms for approximating string compressibility. Algorithmica 65(3), 685\u2013709 (2013). https:\/\/doi.org\/10.1007\/s00453-012-9618-6","journal-title":"Algorithmica"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2018.09.010","volume":"792","author":"JO Shallit","year":"2019","unstructured":"Shallit, J.O., Shur, A.M.: Subword complexity and power avoidance. Theor. Comput. Sci. 792, 96\u2013116 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2018.09.010","journal-title":"Theor. Comput. Sci."},{"key":"28_CR23","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, Iowa City, Iowa, USA, 15\u201317 October 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-43980-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T12:04:29Z","timestamp":1695125069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43980-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031439797","9783031439803"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43980-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"20 September 2023","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":"Pisa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spire2023.isti.cnr.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}