{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:45:41Z","timestamp":1775054741689,"version":"3.50.1"},"reference-count":6,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"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":["Program Comput Soft"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1134\/s0361768823050031","type":"journal-article","created":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T04:55:24Z","timestamp":1696827324000},"page":"373-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Twenty Similarity Functions for Two Finite Sequences"],"prefix":"10.1134","volume":"49","author":[{"given":"I.","family":"Burdonov","sequence":"first","affiliation":[]},{"given":"A.","family":"Maksimov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2023,10,9]]},"reference":[{"key":"3752_CR1","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1974","unstructured":"Wagner, R. and Fischer, M., The string-to-string correction problem, J. ACM, 1974, vol. 21, no. 1, pp. 168\u2013173. https:\/\/doi.org\/10.1145\/321796.321811","journal-title":"J. ACM"},{"key":"3752_CR2","unstructured":"Wang, H., All common subsequences, Proc. 20th Int. Joint Conf. Artificial Intelligence (IJCAI), Hyderabad, India, 2007. \nhttps:\/\/www.aaai.org\/Papers\/IJCAI\/2007\/IJCAI07-101.pdf."},{"key":"3752_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2008.08.035","volume":"409","author":"C. Elzinga","year":"2008","unstructured":"Elzinga, C., Rahmann, S., and Wang, H., Algorithms for subsequence combinatorics, Theor. Comput. Sci., 2008, vol. 409, no. 3, pp. 394\u2013404. https:\/\/doi.org\/10.1016\/j.tcs.2008.08.035","journal-title":"Theor. Comput. Sci."},{"key":"3752_CR4","unstructured":"Proc. Int. Conf. Sequence Analysis and Related Methods (LaCOSAII), Lausanne, Switzerland, 2016. \nhttps:\/\/www.academia.edu\/83294569\/Proceedings_of_the_International_Conference_on_Sequence_Analysis_and_Related_Methods_LaCOSA_II_Lausanne_Switzerland_June_8_10_2016."},{"key":"3752_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.25209\/2079-3316-2017-8-4-347-357","volume":"8","author":"S.V. Znamenskii","year":"2017","unstructured":"Znamenskii, S.V., Model and axioms of similarity metrics, Program. Sist.: Teor. Prilozh., 2017, vol. 8, no. 4, pp.\u00a0347\u2013357. https:\/\/doi.org\/10.25209\/2079-3316-2017-8-4-347-357","journal-title":"Program. Sist.: Teor. Prilozh."},{"key":"3752_CR6","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00453-021-00898-5","volume":"84","author":"A. Conte","year":"2022","unstructured":"Conte, A., Grossi, R., Punzi, G., et al., Enumeration of maximal common subsequences between two strings, Algorithmica, 2022, vol. 84, pp. 757\u2013783. https:\/\/doi.org\/10.1007\/s00453-021-00898-5","journal-title":"Algorithmica"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823050031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768823050031","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768823050031.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:52:10Z","timestamp":1775011930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768823050031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["3752"],"URL":"https:\/\/doi.org\/10.1134\/s0361768823050031","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]},"assertion":[{"value":"9 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2023","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"}}]}}