{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T15:46:47Z","timestamp":1772898407139,"version":"3.50.1"},"reference-count":132,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Council of Technological and Scientific Development, CNPq","award":["425340\/2016-3 and 202292\/2020-7"],"award-info":[{"award-number":["425340\/2016-3 and 202292\/2020-7"]}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior - Brasil","doi-asserted-by":"crossref","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"crossref"}]},{"name":"S\u00e3o Paulo Research Foundation, FAPESP","award":["2013\/08293-7, 2015\/11937-9, and 2019\/27331-3"],"award-info":[{"award-number":["2013\/08293-7, 2015\/11937-9, and 2019\/27331-3"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2024,8,31]]},"abstract":"<jats:p>One of the challenges in the Comparative Genomics field is to infer how close two organisms are based on the similarities and differences between their genetic materials. Recent advances in DNA sequencing have made complete genomes increasingly available. That said, several new algorithms trying to infer the distance between two organisms based on genome rearrangements have been proposed in the literature. However, given the diversity of approaches, the diversity of genome rearrangement events, or even how each work models the genomes and what assumptions are made by each of them, finding the ideal algorithm for each situation or simply knowing the range of applicable approaches can be challenging. In this work, we review these approaches having the algorithmic and combinatorial advances since 2010 as our main focus. This survey aims to organize the recently published papers using a concise notation and to indicate the gaps filled by each of them in the literature. This makes it easier to understand what still needs to be done and what has room for enhancement.<\/jats:p>","DOI":"10.1145\/3653295","type":"journal-article","created":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T12:07:07Z","timestamp":1710936427000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Rearrangement Distance Problems: An updated survey"],"prefix":"10.1145","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre Rodrigues","family":"Oliveira","sequence":"first","affiliation":[{"name":"Faculdade de Computa\u00e7\u00e3o e Inform\u00e1tica, Universidade Presbiteriana Mackenzie, S\u00e3o Paulo, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5287-2925","authenticated-orcid":false,"given":"Klairton Lima","family":"Brito","sequence":"additional","affiliation":[{"name":"Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (UNICAMP), S\u00e3o Paulo, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-9747","authenticated-orcid":false,"given":"Alexsandro Oliveira","family":"Alexandrino","sequence":"additional","affiliation":[{"name":"Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (UNICAMP), S\u00e3o Paulo, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5745-399X","authenticated-orcid":false,"given":"Gabriel","family":"Siqueira","sequence":"additional","affiliation":[{"name":"Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (UNICAMP), Campinas, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4763-3046","authenticated-orcid":false,"given":"Ulisses","family":"Dias","sequence":"additional","affiliation":[{"name":"Faculdade de Tecnologia, Universidade Estadual de Campinas (UNICAMP), Limeira, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3333-6822","authenticated-orcid":false,"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[{"name":"Instituto de Computa\u00e7\u00e3o, Universidade Estadual de Campinas (UNICAMP), Campinas, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2024,4,26]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2008.0080"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.013"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21175-1_16"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2022.3215615"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720020500067"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-020-00673-2"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.3897\/jucs.2020.057"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2020.0121"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720021400114"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2021.0279"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-23198-8_10"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1089\/106652701753216503"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.R006"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250627"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019528280X"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.008"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.5555\/1704846.1705128"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/11851561_16"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.09.008"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45749-6_21"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11538-018-0514-3"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230240402"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1093\/gbe\/evw083"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40189-8_4"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-1119(95)00878-0"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.5555\/1885783.1885793"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2022.3165443"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2019.0293"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-021-00203-7"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2021.11.007"},{"key":"e_1_3_1_32_2","first-page":"205","volume-title":"Proceedings of 19th Annual Satellite Conference of RECOMB on Comparative Genomics (RECOMB-CG\u20192022)","volume":"13234","author":"Brito Klairton Lima","year":"2022","unstructured":"Klairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias, and Zanoni Dias. 2022. A new approach for the reversal distance with indels and moves in intergenic regions. In Proceedings of 19th Annual Satellite Conference of RECOMB on Comparative Genomics (RECOMB-CG\u20192022), Vol. 13234. Springer International Publishing, 205\u2013220."},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.3390\/a14060169"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2016.05.002"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1137\/110851390"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2015.02.003"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-016-1264-6"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.3390\/a12120256"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-01022-x"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.5555\/307954.307964"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14031-0_47"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9369-8"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2005.48"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.07.059"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00155-X"},{"key":"e_1_3_1_46_2","first-page":"244","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u20191998)","author":"Christie David A.","year":"1998","unstructured":"David A. Christie. 1998. A 3\/2-Approximation algorithm for sorting by reversals. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u20191998), H. Karloff (Ed.). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 244\u2013252."},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.11.028"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00009-3"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2014.0298"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2474400"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00239-001-0087-9"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720013500133"},{"key":"e_1_3_1_53_2","first-page":"58","volume-title":"Proceedings of the 12th Brazilian Symposium on Bioinformatics (BSB\u20192019)","volume":"11347","author":"Dias Ulisses","year":"2019","unstructured":"Ulisses Dias, Andre Rodrigues Oliveira, Klairton Lima Brito, and Zanoni Dias. 2019. Block-interchange distance considering intergenic regions. In Proceedings of the 12th Brazilian Symposium on Bioinformatics (BSB\u20192019). Vol. 11347. Springer International Publishing, 58\u201369."},{"key":"e_1_3_1_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.09.004"},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45735-6_7"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.2307\/2318261"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45123-4_20"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.44"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00338-3"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.34"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.07.031"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-20643-6_13"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-017-0107-y"},{"key":"e_1_3_1_64_2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_38"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-015-0040-x"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2016.2515594"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90068-2"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00092-9"},{"key":"e_1_3_1_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/300515.300516"},{"key":"e_1_3_1_71_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.12.006"},{"key":"e_1_3_1_72_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2015.03.007"},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010041"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","DOI":"10.1089\/106652703322539097"},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","DOI":"10.1038\/nm.2988"},{"key":"e_1_3_1_76_2","doi-asserted-by":"publisher","DOI":"10.5555\/3929.3937"},{"key":"e_1_3_1_77_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13075-0_39"},{"key":"e_1_3_1_78_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.019"},{"key":"e_1_3_1_79_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISPAN.2002.1004278"},{"key":"e_1_3_1_80_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188586"},{"key":"e_1_3_1_81_2","volume-title":"Fundamental Algorithms: The Art of Computer Programming","author":"Knoth Donald E.","year":"1973","unstructured":"Donald E. Knoth. 1973. Fundamental Algorithms: The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts."},{"key":"e_1_3_1_82_2","doi-asserted-by":"publisher","DOI":"10.1137\/13090897X"},{"key":"e_1_3_1_83_2","first-page":"55:1\u201355:15","volume-title":"31st International Symposium on Algorithms and Computation (ISAAC\u20192020)","volume":"181","author":"Labarre Anthony","year":"2020","unstructured":"Anthony Labarre. 2020. Sorting by prefix block-interchanges. In 31st International Symposium on Algorithms and Computation (ISAAC\u20192020), Vol. 181. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Hong Kong (Virtual Conference), 55:1\u201355:15."},{"key":"e_1_3_1_84_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.11.004"},{"key":"e_1_3_1_85_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86692-1_5"},{"key":"e_1_3_1_86_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90054-O"},{"issue":"1","key":"e_1_3_1_87_2","first-page":"i190\u2013i196","article-title":"Detection and validation of single gene inversions","volume":"19","author":"Lefebvre Jean-Fran\u00e7ois","year":"2003","unstructured":"Jean-Fran\u00e7ois Lefebvre, Nadia El-Mabrouk, Elisabeth R. M. Tillier, and David Sankoff. 2003. Detection and validation of single gene inversions. Bioinformatics 19, 1 (2003), i190\u2013i196.","journal-title":"Bioinformatics"},{"key":"e_1_3_1_88_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00038-4"},{"key":"e_1_3_1_89_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-398"},{"key":"e_1_3_1_90_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.039"},{"key":"e_1_3_1_91_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219720017500020"},{"key":"e_1_3_1_92_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-020-00169-y"},{"key":"e_1_3_1_93_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.02.039"},{"key":"e_1_3_1_94_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.07.027"},{"key":"e_1_3_1_95_2","doi-asserted-by":"publisher","DOI":"10.3390\/a14060175"},{"key":"e_1_3_1_96_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91938-6_7"},{"key":"e_1_3_1_97_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1672-0229(05)03016-0"},{"key":"e_1_3_1_98_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-022-00937-z"},{"key":"e_1_3_1_99_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2019.0078"},{"key":"e_1_3_1_100_2","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2018.0257"},{"key":"e_1_3_1_101_2","first-page":"868","article-title":"On the sorting by reversals and transpositions problem","volume":"23","author":"Oliveira Andre Rodrigues","year":"2017","unstructured":"Andre Rodrigues Oliveira, Ulisses Dias, and Zanoni Dias. 2017. On the sorting by reversals and transpositions problem. Journal of Universal Computer Science 23 (2017), 868\u2013906.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_1_102_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-018-0131-6"},{"key":"e_1_3_1_103_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2020.2993002"},{"key":"e_1_3_1_104_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2021.3077418"},{"key":"e_1_3_1_105_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-019-0156-5"},{"key":"e_1_3_1_106_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.08.031"},{"key":"e_1_3_1_107_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13039-020-0470-0"},{"key":"e_1_3_1_108_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1995.377035"},{"key":"e_1_3_1_109_2","first-page":"103","article-title":"Genomic sorting with length-weighted reversals","volume":"13","author":"Pinter Ron Y.","year":"2002","unstructured":"Ron Y. Pinter and Steven Skiena. 2002. Genomic sorting with length-weighted reversals. Genome Informatics 13 (2002), 103\u2013111.","journal-title":"Genome Informatics"},{"key":"e_1_3_1_110_2","doi-asserted-by":"publisher","DOI":"10.1504\/IJBRA.2008.018343"},{"key":"e_1_3_1_111_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2007.09.002"},{"key":"e_1_3_1_112_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-017-0095-y"},{"key":"e_1_3_1_113_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.240462997"},{"key":"e_1_3_1_114_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.01.010"},{"key":"e_1_3_1_115_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-022-00205-z"},{"key":"e_1_3_1_116_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00834-5_3"},{"key":"e_1_3_1_117_2","first-page":"13:1\u201313:17","volume-title":"19th International Workshop on Algorithms in Bioinformatics (WABI\u20192019) (Leibniz International Proceedings in Informatics (LIPIcs))","volume":"143","author":"Simonaitis Pijus","year":"2019","unstructured":"Pijus Simonaitis, Annie Chateau, and Krister M. Swenson. 2019. Weighted minimum-length rearrangement scenarios. In 19th International Workshop on Algorithms in Bioinformatics (WABI\u20192019) (Leibniz International Proceedings in Informatics (LIPIcs)), Vol. 143. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 13:1\u201313:17."},{"key":"e_1_3_1_118_2","first-page":"21:1\u201321:22","volume-title":"22nd International Workshop on Algorithms in Bioinformatics (WABI\u20192022) (Leibniz International Proceedings in Informatics (LIPIcs))","volume":"242","author":"Simonaitis Pijus","year":"2022","unstructured":"Pijus Simonaitis and Benjamin J. Raphael. 2022. A maximum parsimony principle for multichromosomal complex genome rearrangements. In 22nd International Workshop on Algorithms in Bioinformatics (WABI\u20192022) (Leibniz International Proceedings in Informatics (LIPIcs)), Vol. 242. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 21:1\u201321:22."},{"key":"e_1_3_1_119_2","first-page":"31","volume-title":"Proceedings of 14th International Conference on Bioinformatics and Computational Biology (BICoB\u20192022)","volume":"83","author":"Siqueira Gabriel","year":"2022","unstructured":"Gabriel Siqueira, Alexsandro Oliveira Alexandrino, and Zanoni Dias. 2022. Signed rearrangement distances considering repeated genes and intergenic regions. In Proceedings of 14th International Conference on Bioinformatics and Computational Biology (BICoB\u20192022), Vol. 83. EasyChair, 31\u201342."},{"key":"e_1_3_1_120_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-021-00200-w"},{"key":"e_1_3_1_121_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2010.11.055"},{"key":"e_1_3_1_122_2","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM52615.2021.9669334"},{"key":"e_1_3_1_123_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-016-0065-9"},{"key":"e_1_3_1_124_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-018-0127-2"},{"key":"e_1_3_1_125_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_3"},{"key":"e_1_3_1_126_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_1"},{"key":"e_1_3_1_127_2","doi-asserted-by":"publisher","DOI":"10.5555\/287686"},{"key":"e_1_3_1_128_2","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.1998.712988"},{"key":"e_1_3_1_129_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2020.2988950"},{"key":"e_1_3_1_130_2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S15-S3"},{"key":"e_1_3_1_131_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti535"},{"key":"e_1_3_1_132_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-10837-3_10"},{"key":"e_1_3_1_133_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00814-x"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3653295","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3653295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:57:43Z","timestamp":1750294663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3653295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,26]]},"references-count":132,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,8,31]]}},"alternative-id":["10.1145\/3653295"],"URL":"https:\/\/doi.org\/10.1145\/3653295","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,26]]},"assertion":[{"value":"2023-02-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-07","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}