{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:49:47Z","timestamp":1743086987492,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031770180"},{"type":"electronic","value":"9783031770197"}],"license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"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-77019-7_10","type":"book-chapter","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:46:49Z","timestamp":1732222009000},"page":"164-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Parikh Matrices for\u00a0Tracking Subsequence Occurrences"],"prefix":"10.1007","author":[{"given":"Szil\u00e1rd","family":"Zsolt Fazekas","sequence":"first","affiliation":[]},{"given":"Xinhao","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/BIOINFORMATICS\/BTV639","volume":"32","author":"M Andreatta","year":"2016","unstructured":"Andreatta, M., Nielsen, M.: Gapped sequence alignment using artificial neural networks: application to the MHC class I system. Bioinform. 32(4), 511\u2013517 (2016). https:\/\/doi.org\/10.1093\/BIOINFORMATICS\/BTV639","journal-title":"Bioinform."},{"issue":"02","key":"10_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1142\/S0129054107004735","volume":"18","author":"A Atanasiu","year":"2007","unstructured":"Atanasiu, A.: Binary Amiable Words. Int. J. Found. Comput. Sci. 18(02), 387\u2013400 (2007). https:\/\/doi.org\/10.1142\/S0129054107004735","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR3","unstructured":"Atanasiu, A.: Parikh matrix mapping and amiability over a ternary alphabet. In: Discrete Mathematics and Computer Science in Memoriam Alexandru Mateescu (1952\u20132005) (2014)"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.tcs.2007.09.017","volume":"390","author":"A Atanasiu","year":"2008","unstructured":"Atanasiu, A., Atanasiu, R., Petre, I.: Parikh matrices and amiable words. Theor. Comput. Sci. 390(1), 102\u2013109 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.017","journal-title":"Theor. Comput. Sci."},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Day, J.D., Kosche, M., Manea, F., Schmid, M.L.: Subsequences with gap constraints: complexity bounds for matching and analysis problems. In: 33rd International Symposium on Algorithms and Computation (ISAAC). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0248, pp. 64:1\u201364:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ISAAC.2022.64","DOI":"10.4230\/LIPIcs.ISAAC.2022.64"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Dick, J., Hutchinson, L.K., Merca\u015f, R., Reidenbach, D.: Reducing the Ambiguity of Parikh Matrices. In: Language and Automata Theory and Applications (LATA). Lecture Notes in Computer Science, vol. 12038, pp. 96\u2013109. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_8","DOI":"10.1007\/978-3-030-40608-0_8"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1186\/1471-2105-5-123","volume":"5","author":"RJ Edwards","year":"2004","unstructured":"Edwards, R.J., Shields, D.C.: GASP: gapped ancestral sequence prediction for proteins. BMC Bioinform. 5, 123 (2004). https:\/\/doi.org\/10.1186\/1471-2105-5-123","journal-title":"BMC Bioinform."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-031-45286-4_12","volume-title":"Reachability Problems","author":"P Fleischmann","year":"2023","unstructured":"Fleischmann, P., Kim, S., Ko\u00df, T., Manea, F., Nowotka, D., Siemer, S., Wiedenh\u00f6ft, M.: Matching patterns with variables under simon\u2019s congruence. In: Bournez, O., Formenti, E., Potapov, I. (eds.) Reachability Problems, pp. 155\u2013170. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-45286-4_12"},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/J.IPL.2004.06.011","volume":"92","author":"S Foss\u00e9","year":"2004","unstructured":"Foss\u00e9, S., Richomme, G.: Some characterizations of Parikh matrix equivalent binary words. Inf. Process. Lett. 92(2), 77\u201382 (2004). https:\/\/doi.org\/10.1016\/J.IPL.2004.06.011","journal-title":"Inf. Process. Lett."},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Gawrychowski, P., Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Efficiently testing Simon\u2019s congruence. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0187, pp. 34:1\u201334:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.34","DOI":"10.4230\/LIPIcs.STACS.2021.34"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Golm, R., Nahvi, M., Gabrys, R., Milenkovic, O.: The gapped k-deck problem. In: IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, 26 June\u20131 July 2022, pp. 49\u201354. IEEE (2022). https:\/\/doi.org\/10.1109\/ISIT50566.2022.9834537","DOI":"10.1109\/ISIT50566.2022.9834537"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Hahn, J., Cheon, H., Han, Y.: M-equivalence of parikh matrix over a ternary alphabet. In: Nagy, B. (ed.) CIAA 2023. LNCS, vol. 14151, pp. 141\u2013152. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-40247-0_10","DOI":"10.1007\/978-3-031-40247-0_10"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. s3-2(1), 326\u2013336 (1952). https:\/\/doi.org\/10.1112\/plms\/s3-2.1.326","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/J.TCS.2020.01.023","volume":"834","author":"J Karhum\u00e4ki","year":"2020","unstructured":"Karhum\u00e4ki, J., Whiteland, M.A.: A compactness property of the k-abelian monoids. Theor. Comput. Sci. 834, 3\u201313 (2020). https:\/\/doi.org\/10.1016\/J.TCS.2020.01.023","journal-title":"Theor. Comput. Sci."},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Kim, S., Han, Y.S., Ko, S.K., Salomaa, K.: On the Simon\u2019s congruence neighborhood of languages. In: Developments in Language Theory: 27th International Conference, DLT 2023, Ume\u00e5, Sweden, 12\u201316 June 2023, Proceedings, pp. 168\u2013181. Springer-Verlag, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33264-7_14","DOI":"10.1007\/978-3-031-33264-7_14"},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114478","volume":"994","author":"S Kim","year":"2024","unstructured":"Kim, S., Ko, S.K., Han, Y.S.: Simon\u2019s congruence pattern matching. Theor. Comput. Sci. 994, 114478 (2024). https:\/\/doi.org\/10.1016\/j.tcs.2024.114478","journal-title":"Theor. Comput. Sci."},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Manea, F., Richardsen, J., Schmid, M.L.: Subsequences with generalised gap constraints: upper and lower complexity bounds. In: Inenaga, S., Puglisi, S.J. (eds.) 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, 25\u201327 June 2024, Fukuoka, Japan. LIPIcs, vol.\u00a0296, pp. 22:1\u201322:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPICS.CPM.2024.22","DOI":"10.4230\/LIPICS.CPM.2024.22"},{"issue":"6","key":"10_CR18","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1051\/ita:2001131","volume":"35","author":"A Mateescu","year":"2001","unstructured":"Mateescu, A., Salomaa, A., Salomaa, K., Yu, S.: A sharpening of the Parikh mapping. RAIRO - Theor. Inf. Appl. 35(6), 551\u2013564 (2001). https:\/\/doi.org\/10.1051\/ita:2001131","journal-title":"RAIRO - Theor. Inf. Appl."},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jcss.2003.07.001","volume":"68","author":"A Mateescu","year":"2004","unstructured":"Mateescu, A., Salomaa, A., Yu, S.: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1), 1\u201321 (2004). https:\/\/doi.org\/10.1016\/j.jcss.2003.07.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10_CR20","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"RJ Parikh","year":"1966","unstructured":"Parikh, R.J.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966). https:\/\/doi.org\/10.1145\/321356.321364","journal-title":"J. ACM"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Renard, A., Rigo, M., Whiteland, M.A.: Introducing $$q$$-deformed binomial coefficients of words. CoRR arxiv:2402.05838 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2402.05838","DOI":"10.48550\/ARXIV.2402.05838"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Renard, A., Rigo, M., Whiteland, M.A.: $$q$$-parikh matrices and $$q$$-deformed binomial coefficients of words. CoRR arxiv:2402.05657 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2402.05657","DOI":"10.48550\/ARXIV.2402.05657"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Rigo, M., Stipulanti, M., Whiteland, M.A.: Gapped binomial complexities in sequences. In: IEEE International Symposium on Information Theory, ISIT 2023, Taipei, Taiwan, 25\u201330 June 2023, pp. 1294\u20131299. IEEE (2023). https:\/\/doi.org\/10.1109\/ISIT54713.2023.10206676","DOI":"10.1109\/ISIT54713.2023.10206676"},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2005.03.032","volume":"340","author":"A Salomaa","year":"2005","unstructured":"Salomaa, A.: Connections between subwords and certain matrix mappings. Theor. Comput. Sci. 340(2), 188\u2013203 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.03.032","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.tcs.2008.05.023","volume":"407","author":"A Salomaa","year":"2008","unstructured":"Salomaa, A.: Subword histories and associated matrices. Theor. Comput. Sci. 407(1), 250\u2013257 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2008.05.023","journal-title":"Theor. Comput. Sci."},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Salomaa, A.: Criteria for the matrix equivalence of words. Theor. Comput. Sci. 411(16), 1818\u20131827 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.01.036. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397510000733","DOI":"10.1016\/j.tcs.2010.01.036"},{"issue":"1\u20133","key":"10_CR27","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(03)00396-7","volume":"310","author":"T Serbanuta","year":"2004","unstructured":"Serbanuta, T.: Extending Parikh matrices. Theor. Comput. Sci. 310(1\u20133), 233\u2013246 (2004). https:\/\/doi.org\/10.1016\/S0304-3975(03)00396-7","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"10_CR28","doi-asserted-by":"publisher","first-page":"305","DOI":"10.3233\/FI-2016-1388","volume":"146","author":"WC Teh","year":"2016","unstructured":"Teh, W.C.: Parikh matrices and parikh rewriting systems. Fundam. Informaticae 146(3), 305\u2013320 (2016). https:\/\/doi.org\/10.3233\/FI-2016-1388","journal-title":"Fundam. Informaticae"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/J.TCS.2015.03.037","volume":"582","author":"WC Teh","year":"2015","unstructured":"Teh, W.C., Kwa, K.H.: Core words and Parikh matrices. Theor. Comput. Sci. 582, 60\u201369 (2015). https:\/\/doi.org\/10.1016\/J.TCS.2015.03.037","journal-title":"Theor. Comput. Sci."},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Zetzsche, G.: The Complexity of Downward Closure Comparisons. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, Rome, Italy, 11\u201315 July 2016. LIPIcs, vol.\u00a055, pp. 123:1\u2013123:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2016.123","DOI":"10.4230\/LIPICS.ICALP.2016.123"},{"key":"10_CR31","doi-asserted-by":"publisher","unstructured":"Zetzsche, G.: Separability by piecewise testable languages and downward closures beyond subwords. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, 09-12 July 2018, pp. 929\u2013938. ACM (2018). https:\/\/doi.org\/10.1145\/3209108.3209201","DOI":"10.1145\/3209108.3209201"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77019-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T21:29:47Z","timestamp":1732224587000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77019-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"ISBN":["9783031770180","9783031770197"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77019-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"22 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangkok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","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":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2024.cs.ait.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}