{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T12:45:38Z","timestamp":1780922738504,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031813740","type":"print"},{"value":"9783031813757","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-81375-7_5","type":"book-chapter","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T03:15:28Z","timestamp":1739416528000},"page":"75-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["All Optimal k-Bounded Alignments Using the\u00a0FM-Index"],"prefix":"10.1007","author":[{"given":"Astrid","family":"Rivera-Partida","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0302-9610","authenticated-orcid":false,"given":"Abel","family":"Armas-Cervantes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9076-903X","authenticated-orcid":false,"given":"Luciano","family":"Garc\u00eda-Ba\u00f1uelos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0070-1248","authenticated-orcid":false,"given":"Luis","family":"Rodr\u00edguez-Flores","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,2,14]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19345-3","volume-title":"Process Mining - Discovery","author":"WMP van der Aalst","year":"2011","unstructured":"van der Aalst, W.M.P.: Process Mining - Discovery. Springer, Conformance and Enhancement of Business Processes (2011)"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10619-013-7127-5","volume":"31","author":"WMP van der Aalst","year":"2013","unstructured":"van der Aalst, W.M.P.: Decomposing petri nets for process mining: a generic approach. Distrib. Parall. Databases 31(4), 471\u2013507 (2013)","journal-title":"Distrib. Parall. Databases"},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1002\/widm.1045","volume":"2","author":"WMP van der Aalst","year":"2012","unstructured":"van der Aalst, W.M.P., Adriansyah, A., van Dongen, B.F.: Replaying history on process models for conformance checking and performance analysis. WIREs Data Mining Knowl. Discov. 2(2), 182\u2013192 (2012)","journal-title":"WIREs Data Mining Knowl. Discov."},{"key":"5_CR4","unstructured":"Adriansyah, A.: Aligning observed and modeled behavior. Phd Thesis, Technische Universiteit Eindhoven, Mathematics and Computer Science (2014)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Adriansyah, A., van Dongen, B.F., van\u00a0der Aalst, W.M.P.: Conformance checking using cost-based fitness analysis. In: EDOC, pp. 55\u201364. IEEE Comp Soc (2011)","DOI":"10.1109\/EDOC.2011.12"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.is.2015.09.009","volume":"56","author":"A Armas-Cervantes","year":"2016","unstructured":"Armas-Cervantes, A., Baldan, P., Dumas, M., Garcia-Ba\u00f1uelos, L.: Diagnosing behavioral differences between business process models: an approach based on event structures. Inf. Syst. 56, 304\u2013325 (2016)","journal-title":"Inf. Syst."},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"100556","DOI":"10.1016\/j.simpa.2023.100556","volume":"17","author":"A Berti","year":"2023","unstructured":"Berti, A., van Zelst, S.J., Schuster, D.: Pm4py: a process mining library for python. Softw. Impacts 17, 100556 (2023)","journal-title":"Softw. Impacts"},{"key":"5_CR8","unstructured":"Burrows, M., Wheeler, D.: A block-sorting lossless data compression algorithm. Technical Report, number 124, Digital Equipment Corporation (1994)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Carmona, J., van Dongen, B.F., Weidlich, M.: Conformance checking: foundations, milestones and challenges. In: van\u00a0der Aalst, W.M.P., Carmona, J. (eds.) Process Mining Handbook, LNBIP, vol.\u00a0448, pp. 155\u2013190. Springer (2022)","DOI":"10.1007\/978-3-031-08848-3_5"},{"key":"5_CR10","unstructured":"de Leoni, M., Mannhardt, F.: Road traffic fine management process. https:\/\/doi.org\/10.4121\/uuid:270fd440-1057-4fb9-89a9-b699b47990f5"},{"key":"5_CR11","unstructured":"van Dongen, B.: BPI challenge 2012. https:\/\/doi.org\/10.4121\/uuid:3926db30-f712-4394-aebc-75976070e91f"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-98648-7_12","volume-title":"Business Process Management","author":"BF Dongen","year":"2018","unstructured":"Dongen, B.F.: Efficiently computing alignments. In: Weske, M., Montali, M., Weber, I., vom Brocke, J. (eds.) BPM 2018. LNCS, vol. 11080, pp. 197\u2013214. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98648-7_12"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1014746130920","volume":"30","author":"J Esparza","year":"2002","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. Formal Methods Syst. Des. 30(2), 285\u2013310 (2002)","journal-title":"Formal Methods Syst. Des."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: FOCS, pp. 390\u2013398. IEEE Computer Society (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1109\/TSE.2017.2668418","volume":"44","author":"L Garc\u00eda-Ba\u00f1uelos","year":"2018","unstructured":"Garc\u00eda-Ba\u00f1uelos, L., van Beest, N., Dumas, M., Rosa, M.L., Mertens, W.: Complete and interpretable conformance checking of business processes. IEEE Trans. Software Eng. 44(3), 262\u2013290 (2018)","journal-title":"IEEE Trans. Software Eng."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Lee, W.L.J., Verbeek, H.M.W., Munoz-Gama, J., van\u00a0der Aalst, W.M.P., Sep\u00falveda, M.: Recomposing conformance: closing the circle on decomposed alignment-based conf. checking in process mining. Inf. Sci. 466, 55\u201391 (2018)","DOI":"10.1016\/j.ins.2018.07.026"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.eswa.2017.03.047","volume":"82","author":"M de Leoni","year":"2017","unstructured":"de Leoni, M., Marrella, A.: Aligning real process executions and prescriptive process models through automated planning. Expert Syst. Appl. 82, 162\u2013183 (2017)","journal-title":"Expert Syst. Appl."},{"key":"5_CR18","unstructured":"Lu, X.: Handling duplicated tasks in process discovery by refining event labels. https:\/\/doi.org\/10.4121\/uuid:ea90c4be-64b6-4f4b-b27c-10ede28da6b6"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Symbolic model checking. Kluwer (1993)","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Montanari, U., Rossi, F.: Contextual occurence nets and concurrent constraint programming. In: Int. Wksp. Graph Transfer in Computer Science, LNCS, vol.\u00a0776, pp. 280\u2013295. Springer (1993)","DOI":"10.1007\/3-540-57787-4_18"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.is.2014.04.003","volume":"46","author":"J Munoz-Gama","year":"2014","unstructured":"Munoz-Gama, J., Carmona, J., van der Aalst, W.M.P.: Single-entry single-exit decomposed conformance checking. Inf. Syst. 46, 102\u2013122 (2014)","journal-title":"Inf. Syst."},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: Properties, analysis and applications. Proc. of the IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. of the IEEE"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for sim. in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443\u2013453 (1970)","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Linear suffix array construction by almost pure induced-sorting. In: 2009 Data Compression Conference, pp. 193\u2013202 (2009)","DOI":"10.1109\/DCC.2009.42"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"101561","DOI":"10.1016\/j.is.2020.101561","volume":"94","author":"D Rei\u00dfner","year":"2020","unstructured":"Rei\u00dfner, D., Armas-Cervantes, A., Conforti, R., Dumas, M., Fahland, D., Rosa, M.L.: Scalable alignment of process models and event logs: an approach based on automata and s-components. Inf. Syst. 94, 101561 (2020)","journal-title":"Inf. Syst."},{"key":"5_CR26","unstructured":"Renders, L.: Approximate Sequence Alignment using the Bidirectional FM-index. Ph.D. thesis, Ghent University (2020)"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Sani, M.F., Kabierski, M., van Zelst, S.J., van\u00a0der Aalst, W.M.P.: Model-independent error bound estimation for conformance checking approximation. In: BPM Workshops, LNBIP, vol.\u00a0492, pp. 369\u2013382. Springer (2023)","DOI":"10.1007\/978-3-031-50974-2_28"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-030-49435-3_15","volume-title":"Advanced Information Systems Engineering","author":"M Fani\u00a0Sani","year":"2020","unstructured":"Fani\u00a0Sani, M., van Zelst, S.J., van\u00a0der Aalst, W.M.P.: Conformance checking approximation using subset selection and edit distance. In: Dustdar, S., Yu, E., Salinesi, C., Rieu, D., Pant, V. (eds.) CAiSE 2020. LNCS, vol. 12127, pp. 234\u2013251. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-49435-3_15"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ic.2011.03.007","volume":"213","author":"T Schnattinger","year":"2012","unstructured":"Schnattinger, T., Ohlebusch, E., Gog, S.: Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. 213, 13\u201322 (2012)","journal-title":"Inf. Comput."},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Sommers, D., Menkovski, V., Fahland, D.: Process discovery using graph neural networks. In: ICPM, pp. 40\u201347. IEEE Comp Soc (2021)","DOI":"10.1109\/ICPM53251.2021.9576849"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-45348-4_12","volume-title":"Business Process Management","author":"F Taymouri","year":"2016","unstructured":"Taymouri, F., Carmona, J.: A recursive paradigm for aligning observed behavior of large structured process models. In: La Rosa, M., Loos, P., Pastor, O. (eds.) BPM 2016. LNCS, vol. 9850, pp. 197\u2013214. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45348-4_12"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Taymouri, F., Carmona, J.: An evolutionary technique to approximate multiple optimal algns. In: BPM, LNCS, vol. 11080, pp. 215\u2013232. Springer (2018)","DOI":"10.1007\/978-3-319-98648-7_13"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"106557","DOI":"10.1016\/j.knosys.2020.106557","volume":"211","author":"F Taymouri","year":"2021","unstructured":"Taymouri, F., Rosa, M.L., Dumas, M., Maggi, F.M.: Business process variant analysis: survey and classification. Knowl. Based Syst. 211, 106557 (2021)","journal-title":"Knowl. Based Syst."}],"container-title":["Lecture Notes in Computer Science","Cooperative Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81375-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T05:01:50Z","timestamp":1757134910000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81375-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031813740","9783031813757"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81375-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"14 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CoopIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cooperative Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"20 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2024","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":"coopis2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/coopis.scitevents.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}