{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:32:26Z","timestamp":1742913146151,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_15","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"206-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["String Rearrangement Inequalities and\u00a0a\u00a0Total Order Between Primitive Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0483-0119","authenticated-orcid":false,"given":"Ruixi","family":"Luo","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7365-9576","authenticated-orcid":false,"given":"Taikun","family":"Zhu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3720-5117","authenticated-orcid":false,"given":"Kai","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"15_CR1","unstructured":"Orderings - oeiswiki (2022). https:\/\/oeis.org\/wiki\/Orderings"},{"key":"15_CR2","unstructured":"Wikipedia: Shortlex order (2022). https:\/\/en.wikipedia.org\/wiki\/Shortlex_order"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Alatabbi, A., Daykin, J., Rahman, M., Smyth, W.: Simple linear comparison of strings in v-order. In: Pal, S., Sadakane, K. (eds.) WALCOM 2014, LNCS, Vol. 8344, pp. 80\u201389 (2014)","DOI":"10.1007\/978-3-319-04657-0_10"},{"issue":"12","key":"15_CR4","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1016\/j.disc.2015.05.025","volume":"338","author":"Y Au","year":"2015","unstructured":"Au, Y.: Generalized de bruijn words for primitive words and powers. Discret. Math. 338(12), 2320\u20132331 (2015). https:\/\/doi.org\/10.1016\/j.disc.2015.05.025","journal-title":"Discret. Math."},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Bannai, H.I.T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: The \"runs\" theorem. SIAM J. Comput. 46(5), 1501\u20131514 (2017). https:\/\/doi.org\/10.1137\/15M1011032","DOI":"10.1137\/15M1011032"},{"key":"15_CR6","unstructured":"Berstel, J., Boasson, L.: The set of lyndon words is not context-free. Bull. EATCS 63 (1997)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Chen, K., Fox, R., Lyndon, R.: Free differential calculus, iv. the quotient groups of the lower central series. Ann. Math. 81\u201395 (1958)","DOI":"10.2307\/1970044"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2018.08.011","volume":"806","author":"M Crochemore","year":"2020","unstructured":"Crochemore, M., Russo, L.: Cartesian and lyndon trees. Theor. Comput. Sci. 806, 1\u20139 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2018.08.011","journal-title":"Theor. Comput. Sci."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Daykin, D., Daykin, J., Smyth, W.: String comparison and lyndon-like factorization using v-order in linear time. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011, LNCS 6661, pp. 65\u201376 (2011)","DOI":"10.1007\/978-3-642-21458-5_8"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"D.E. Knuth, J.M., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977). https:\/\/doi.org\/10.1137\/0206024","DOI":"10.1137\/0206024"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Dolce, F., Restivo, A., Reutenauer, C.: On generalized lyndon words. ArXiv:abs\/1812.04515 (2019)","DOI":"10.1016\/j.tcs.2018.12.015"},{"key":"15_CR12","unstructured":"D\u00f6m\u00f6si, P., Horv\u00e1th, S., Ito., M.: On the connection between formal languages and primitive words. In: Proceedings of the First Session on Scientific Communication, pp. 59\u201367. University of Oradea, Oradea, Romania (1991)"},{"key":"15_CR13","doi-asserted-by":"publisher","unstructured":"D\u00f6m\u00f6si, P., Ito, M.: Context-free languages and primitive words (2014). https:\/\/doi.org\/10.1142\/7265","DOI":"10.1142\/7265"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J Duval","year":"1983","unstructured":"Duval, J.: Factorizing words over an ordered alphabet. J. Algor. 4(4), 363\u2013381 (1983). https:\/\/doi.org\/10.1016\/0196-6774(83)90017-2","journal-title":"J. Algor."},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H Fredricksen","year":"1979","unstructured":"Fredricksen, H., Maiorana, J.: Necklaces of beads in $$k$$ colors and $$k$$-ary de bruijn sequences. Discrete Math. 23, 207\u2013210 (1979)","journal-title":"Discrete Math."},{"key":"15_CR16","unstructured":"Lischke, G.: Primitive words and roots of words. Acta Univ. Sapientiae, Informatica 3(1), 5\u201334 (2011)"},{"key":"15_CR17","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics, vol. 17, Addison-Wesley, MA (1983)"},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R Lyndon","year":"1962","unstructured":"Lyndon, R., Sch\u00fctzenberger, M.: The equation $$a^m=b^nc^p$$ in a free group. Michigan Math. J. 9(4), 289\u2013298 (1962). https:\/\/doi.org\/10.1307\/mmj\/1028998766","journal-title":"Michigan Math. J."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0304-3975(95)00098-4","volume":"161","author":"H Petersen","year":"1996","unstructured":"Petersen, H.: On the language of primitive words. Theor. Comput. Sci. 161, 141\u2013156 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejc.2012.07.010","volume":"34","author":"W Smyth","year":"2013","unstructured":"Smyth, W.: Computing regularities in strings: a survey. Eur. J. Combin. 34(1), 3\u201314 (2013). https:\/\/doi.org\/10.1016\/j.ejc.2012.07.010","journal-title":"Eur. J. Combin."},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"114965","DOI":"10.1109\/ACCESS.2021.3105607","volume":"9","author":"D Zhang","year":"2021","unstructured":"Zhang, D., Jin, K.: Fast algorithms for computing the statistics of pattern matching. IEEE Access 9, 114965\u2013114976 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3105607","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:50:15Z","timestamp":1672552215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"19","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":"76% - 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)"}}]}}