{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:37:14Z","timestamp":1743154634505,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030326852"},{"type":"electronic","value":"9783030326869"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-32686-9_12","type":"book-chapter","created":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T18:02:27Z","timestamp":1570212147000},"page":"162-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Longest Common Property Preserved Substring Queries"],"prefix":"10.1007","author":[{"given":"Kazuki","family":"Kai","sequence":"first","affiliation":[]},{"given":"Yuto","family":"Nakashima","sequence":"additional","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6856-5185","authenticated-orcid":false,"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2477-1702","authenticated-orcid":false,"given":"Tomasz","family":"Kociumaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,3]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-030-00479-8_4","volume-title":"String Processing and Information Retrieval","author":"LAK Ayad","year":"2018","unstructured":"Ayad, L.A.K., et al.: Longest property-preserved common factor. In: Gagie, T., Moffat, A., Navarro, G., Cuadros-Vargas, E. (eds.) SPIRE 2018. LNCS, vol. 11147, pp. 42\u201349. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-030-00479-8_4"},{"key":"12_CR2","unstructured":"Ayad, L.A.K., et al.: Longest property-preserved common factor (2018). \n                      http:\/\/arxiv.org\/abs\/1810.02099"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2017.02.018","volume":"710","author":"SW Bae","year":"2018","unstructured":"Bae, S.W., Lee, I.: On finding a longest common palindromic subsequence. Theor. Comput. Sci. 710, 29\u201334 (2018). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2017.02.018","journal-title":"Theor. Comput. Sci."},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Bannai, H., Inenaga, S., K\u00f6ppl, D.: Computing all distinct squares in linear time for integer alphabets. In: K\u00e4rkk\u00e4inen, J., Radoszewski, J., Rytter, W. (eds.) 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017. LIPIcs, vol. 78, pp. 22:1\u201322:18. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2017). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.22","DOI":"10.4230\/LIPIcs.CPM.2017.22"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.tcs.2003.05.002","volume":"321","author":"MA Bender","year":"2004","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theor. Comput. Sci. 321(1), 5\u201312 (2004). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2003.05.002","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"12_CR6","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theor. Comput. Sci. 255(1\u20132), 539\u2013553 (2001). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(99)00320-5","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. ACM 47(6), 987\u20131011 (2000). \n                      https:\/\/doi.org\/10.1145\/355541.355547","journal-title":"J. ACM"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/s0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16(1), 109\u2013114 (1965). \n                      https:\/\/doi.org\/10.1090\/s0002-9939-1965-0174934-9","journal-title":"Proc. Am. Math. Soc."},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011). \n                      https:\/\/doi.org\/10.1137\/090779759","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theory Ser. A 82(1), 112\u2013120 (1998). \n                      https:\/\/doi.org\/10.1006\/jcta.1997.2843","journal-title":"J. Comb. Theory Ser. A"},{"issue":"20","key":"12_CR11","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1016\/j.ipl.2010.07.018","volume":"110","author":"R Groult","year":"2010","unstructured":"Groult, R., Prieur, \u00c9., Richomme, G.: Counting distinct palindromes in a word in linear time. Inf. Process. Lett. 110(20), 908\u2013912 (2010). \n                      https:\/\/doi.org\/10.1016\/j.ipl.2010.07.018","journal-title":"Inf. Process. Lett."},{"key":"12_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997). \n                      https:\/\/doi.org\/10.1017\/cbo9780511574931"},{"key":"12_CR13","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). \n                      https:\/\/doi.org\/10.1007\/3-540-56024-6_19"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Inoue, T., Inenaga, S., Hyyr\u00f6, H., Bannai, H., Takeda, M.: Computing longest common square subsequences. In: Navarro, G., Sankoff, D., Zhu, B. (eds.) 29th Annual Symposium on Combinatorial Pattern Matching, CPM 2018. LIPIcs, vol. 105, pp. 15:1\u201315:13. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2018). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2018.15","DOI":"10.4230\/LIPIcs.CPM.2018.15"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Kociumaka, T.: Minimal suffix and rotation of a substring in optimal time. In: Grossi, R., Lewenstein, M. (eds.) 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016. LIPIcs, vol. 54, pp. 28:1\u201328:12. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2016). \n                      https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2016.28","DOI":"10.4230\/LIPIcs.CPM.2016.28"},{"key":"12_CR16","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear time algorithm for seeds computation (2019). \n                      http:\/\/arxiv.org\/abs\/1107.2422v2"},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1090\/s0002-9947-1954-0064049-x","volume":"77","author":"RC Lyndon","year":"1954","unstructured":"Lyndon, R.C.: On Burnside\u2019s problem. Trans. Am. Math. Soc. 77(2), 202\u2013215 (1954). \n                      https:\/\/doi.org\/10.1090\/s0002-9947-1954-0064049-x","journal-title":"Trans. Am. Math. Soc."},{"issue":"3","key":"12_CR18","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). \n                      https:\/\/doi.org\/10.1007\/BF01206331","journal-title":"Algorithmica"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: 14th Annual Symposium on Switching and Automata Theory, SWAT 1973, pp. 1\u201311. IEEE Computer Society (1973). \n                      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":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32686-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T21:06:40Z","timestamp":1570223200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32686-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030326852","9783030326869"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32686-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 October 2019","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":"Segovia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/spire19.lbd.org.es\/","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":"59","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":"28","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":"8","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":"47% - 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":"1","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)"}}]}}