{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T15:10:02Z","timestamp":1755875402316,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T00:00:00Z","timestamp":1701993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,12,8]]},"DOI":"10.1145\/3638584.3638607","type":"proceedings-article","created":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T11:15:19Z","timestamp":1710414919000},"page":"361-368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Some General Heuristics in the Traveling Salesman Problem and the Problem of Reconstructing the DNA Chain Distance Matrix"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6765-6800","authenticated-orcid":false,"given":"Boris F.","family":"Melnikov","sequence":"first","affiliation":[{"name":"Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0063-106X","authenticated-orcid":false,"given":"Dmitrii","family":"Chaikovskii","sequence":"additional","affiliation":[{"name":"Faculty of Computational Mathematics and Cybernetics, Shenzhen MSU-BIT University, China"}]}],"member":"320","published-online":{"date-parts":[[2024,3,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.18287\/1613-0073-2018-2212-63-72"},{"key":"e_1_3_2_1_2_1","volume-title":"CEUR Workshop Proceedings","volume":"2258","author":"Melnikov B.","year":"2018","unstructured":"[2] Melnikov B., Trenina M. On possible methods for solving the problem of reconstructing the matrix of distances between DNA strings. CEUR Workshop Proceedings, 2018, vol. 2258, P. 11\u201320."},{"key":"e_1_3_2_1_3_1","volume-title":"On one problem of reconstructing matrix distances between chains of DNA. IFAC\u2013 Papers Online","author":"Melnikov B.","year":"2018","unstructured":"[3] Melnikov B., Trenina M., Kochergin A. On one problem of reconstructing matrix distances between chains of DNA. IFAC\u2013 Papers Online, 2018, vol. 51, issue 32, P. 378\u2013383."},{"key":"e_1_3_2_1_4_1","volume-title":"International Journal of Open Information Technologies","author":"Melnikov B.","year":"2018","unstructured":"[4] Melnikov B., Trenina M. On a problem of the reconstruction of distance matrices between DNA sequences. International Journal of Open Information Technologies, 2018, vol. 6, nom. 6, P. 1\u201313."},{"key":"e_1_3_2_1_5_1","volume-title":"International Journal of Open Information Technologies","author":"Melnikov B.","year":"2018","unstructured":"[5] Melnikov B., Trenina M. The application of the branch and bound method in the problem of reconstructing the matrix of distances between DNA strings. International Journal of Open Information Technologies, 2018, vol. 6, nom. 8, P. 1\u201313."},{"key":"e_1_3_2_1_6_1","volume-title":"Multiheuristic approach to discrete optimization problems. Cybernetics and Systems Analysis","author":"Melnikov B.","year":"2006","unstructured":"[6] Melnikov B. Multiheuristic approach to discrete optimization problems. Cybernetics and Systems Analysis, 2006, vol. 42, nom. 3, P. 335\u2013341."},{"key":"e_1_3_2_1_7_1","volume-title":"3rd IEEE International Workshop","author":"Ganesh A.","year":"2009","unstructured":"[7] Ganesh A., Lin Z., Wright J., Wu L., Chen M. Fast algorithms for recovering a corrupted low-rank matrix. Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 3rd IEEE International Workshop, 2009, P. 213\u2013216."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1039\/C3AY41907J"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/578654"},{"key":"e_1_3_2_1_10_1","volume-title":"Randomization, Approximation, and Heuristics.","author":"Hromkovi\u010d J.","year":"2003","unstructured":"[10] Hromkovi\u010d J. Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics. Berlin: Springer, 2003, 538\u00a0p."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of Higher Educational Institutions. Volga Region. Physical and Mathematical Science","volume":"45","author":"Melnikov B.","year":"2018","unstructured":"[11] Melnikov B., Trenina M., Kochergin A. The approach to improving algorithms for calculating distances between DNA strings (using the example of the Needleman-Wunsch algorithm). Proceedings of Higher Educational Institutions. Volga Region. Physical and Mathematical Science, 2018, vol. 45, nom. 1, P. 46\u201359."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.18287\/1613-0073-2017-1902-43-50"},{"key":"e_1_3_2_1_13_1","first-page":"13","volume-title":"Trenina","author":"Melnikov B.","year":"2018","unstructured":"[13] Melnikov, B., Trenina, M.: On a problem of the reconstruction of distance matrices between DNA sequences. International Journal of Open Information Technologies, 6(6), pp.\u00a01\u201313 (in Russian) (2018)"},{"key":"e_1_3_2_1_14_1","first-page":"13","volume-title":"Trenina","author":"Melnikov B.","year":"2018","unstructured":"[14] Melnikov, B., Trenina, M.: Application of the branches and boundaries method in a problem of the reconstruction of distance matrices between DNA sequences. International Journal of Open Information Technologies, 6(8), pp.\u00a01\u201313 (in Russian) (2018)"},{"key":"e_1_3_2_1_15_1","volume-title":"Modern genetics. V. 1","author":"Ayala F.","year":"1980","unstructured":"[15] Ayala F., Kayger J. Modern genetics. V. 1. California: Menlo Park, 1980, 295\u00a0p."},{"key":"e_1_3_2_1_16_1","unstructured":"[16] Nucleotide\u2013 NCBI [Electron. resource].\u2013 Access mode: free https:\/\/www.ncbi.nlm.nih.gov\/nuccore."}],"event":{"name":"CSAI 2023: 2023 7th International Conference on Computer Science and Artificial Intelligence","acronym":"CSAI 2023","location":"Beijing China"},"container-title":["Proceedings of the 2023 7th International Conference on Computer Science and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638584.3638607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3638584.3638607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T14:57:04Z","timestamp":1755874624000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3638584.3638607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,8]]},"references-count":16,"alternative-id":["10.1145\/3638584.3638607","10.1145\/3638584"],"URL":"https:\/\/doi.org\/10.1145\/3638584.3638607","relation":{},"subject":[],"published":{"date-parts":[[2023,12,8]]},"assertion":[{"value":"2024-03-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}