{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:54:13Z","timestamp":1773615253032,"version":"3.50.1"},"reference-count":13,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"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":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.3103\/s0146411619070071","type":"journal-article","created":{"date-parts":[[2020,3,4]],"date-time":"2020-03-04T10:02:40Z","timestamp":1583316160000},"page":"617-627","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Application of a Genetic Algorithm for Finding Edit Distances between Process Models"],"prefix":"10.3103","volume":"53","author":[{"given":"A. A.","family":"Kalenkova","sequence":"first","affiliation":[]},{"given":"D. A.","family":"Kolesnikov","sequence":"additional","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2020,3,4]]},"reference":[{"key":"7162_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49851-4","volume-title":"Process Mining: Data Science in Action","author":"W.M.P. Van der Aalst","year":"2016","unstructured":"Van der Aalst, W.M.P., Process Mining: Data Science in Action, Springer, 2016, 2nd ed."},{"key":"7162_CR2","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"W.M.P. Van der Aalst","year":"2004","unstructured":"Van der Aalst, W.M.P., Weijters, T., and Maruster, L., Workow mining: Discovering process models from event logs, IEEE Trans. Knowl. Data Eng., 2004, vol. 16, no. 9, pp. 1128\u20131142.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"7162_CR3","doi-asserted-by":"crossref","unstructured":"Leemans, S.J.J., Fahland, D., and van der Aalst, W.M.P., Discovering block-structured process models from incomplete event logs, in Application and Theory of Petri Nets and Concurrency, Springer; Lect. Notes Comput. Sci., 2014, vol. 8489, pp. 91\u2013110.","DOI":"10.1007\/978-3-319-07734-5_6"},{"key":"7162_CR4","series-title":"E-government services: Comparing real and expected user behavior","volume-title":"Business Process Management Workshops","author":"A.A. Kalenkova","year":"2018","unstructured":"Kalenkova, A.A., Ageev, A.A., Lomazova, I.A., and van der Aalst, W.M.P., E-government services: Comparing real and expected user behavior, in Business Process Management Workshops, Springer International Publishing, 2018, pp. 484\u2013496."},{"key":"7162_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.\u00a0Freeman & Co., 1990."},{"key":"7162_CR6","unstructured":"Ivanov, S.Y., Kalenkova, A.A., and van der Aalst, W.M.P., BPMNDiffViz: A tool for BPMN models comparison, Proceedings of the BPM Demo Session 2015 Co-located with the 13th International Conference on Business Process Management (BPM 2015) (Innsbruck, Austria, September 2, 2015), 2015, pp. 35\u201339."},{"key":"7162_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., and Raphael, B., A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Syst. Sci. Cybern., 1968, vol. 4, no. 2, pp. 100\u2013107.","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"7162_CR8","unstructured":"Business Process Model and Notation (BPMN), Object Management Group, formal\/2013-12-09, 2013."},{"key":"7162_CR9","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/S0031-3203(96)00123-9","volume":"30","author":"A.D.J. Cross","year":"1997","unstructured":"Cross, A.D.J., Wilson, R.C., and Hancock, E.R., Inexact graph matching using genetic search, Pattern Recognit., 1997, vol. 30, no. 6, pp. 953\u2013970.","journal-title":"Pattern Recognit."},{"key":"7162_CR10","first-page":"63","volume-title":"Lecture Notes in Computer Science","author":"Kaspar Riesen","year":"2014","unstructured":"Riesen, K., Fischer, A., and Bunke, H., Improving approximate graph edit distance using genetic algorithms, in Structural, Syntactic, and Statistical Pattern Recognition, Springer Berlin Heidelberg, 2014, pp. 63\u201372."},{"key":"7162_CR11","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/s10270-015-0502-0","volume":"16","author":"A.A. Kalenkova","year":"2017","unstructured":"Kalenkova, A.A., van der Aalst, W.M.P., Lomazova, I.A., and Rubin, V.A., Process mining using BPMN: Relating event logs and process models, Software Syst. Model., 2017, vol. 16, no. 4, pp. 1019\u20131048.","journal-title":"Software Syst. Model."},{"key":"7162_CR12","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"Levenshtein, V.I., Binary codes capable of correcting deletions, insertions and reversals, Sov. Phys. Dokl., 1966, vol. 10, p. 707.","journal-title":"Sov. Phys. Dokl."},{"key":"7162_CR13","unstructured":"Gladkov, L.A., Kureichik, V.V., and Kureichik, V.M., Geneticheskie algoritmy (Genetic Algorithms), Moscow: Fizmatlit, 2010."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411619070071.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411619070071","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411619070071.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:57:26Z","timestamp":1773611846000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411619070071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":13,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["7162"],"URL":"https:\/\/doi.org\/10.3103\/s0146411619070071","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12]]},"assertion":[{"value":"1 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"CONFLICT OF INTEREST"}}]}}