{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:43:24Z","timestamp":1756464204737,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T00:00:00Z","timestamp":1717113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["2013\/08293-7"],"award-info":[{"award-number":["2013\/08293-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["2015\/11937-9"],"award-info":[{"award-number":["2015\/11937-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["2021\/13824-8"],"award-info":[{"award-number":["2021\/13824-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"crossref","award":["2022\/13555-0"],"award-info":[{"award-number":["2022\/13555-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10732-024-09528-z","type":"journal-article","created":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T12:02:27Z","timestamp":1717156947000},"page":"269-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5745-399X","authenticated-orcid":false,"given":"Gabriel","family":"Siqueira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre Rodrigues","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-9747","authenticated-orcid":false,"given":"Alexsandro Oliveira","family":"Alexandrino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1534-2682","authenticated-orcid":false,"given":"G\u00e9raldine","family":"Jean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8251-2012","authenticated-orcid":false,"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3333-6822","authenticated-orcid":false,"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,31]]},"reference":[{"issue":"3","key":"9528_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1089\/cmb.2020.0121","volume":"28","author":"AO Alexandrino","year":"2021","unstructured":"Alexandrino, A.O., Oliveira, A.R., Dias, U., Dias, Z.: Genome rearrangement distance with reversals, transpositions, and indels. J. Comput. Biol. 28(3), 235\u2013247 (2021)","journal-title":"J. Comput. Biol."},{"issue":"03","key":"9528_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1089\/cmb.2021.0279","volume":"29","author":"AO Alexandrino","year":"2022","unstructured":"Alexandrino, A.O., Oliveira, A.R., Dias, U., Dias, Z.: Labeled cycle graph for transposition and indel distance. J. Comput. Biol. 29(03), 243\u2013256 (2022)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"9528_CR3","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1137\/S0097539793250627","volume":"25","author":"V Bafna","year":"1996","unstructured":"Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM J. Comput. 25(2), 272\u2013289 (1996)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9528_CR4","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S089548019528280X","volume":"11","author":"V Bafna","year":"1998","unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"9528_CR5","doi-asserted-by":"crossref","unstructured":"Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: International Workshop on Algorithms in Bioinformatics, pp. 163\u2013173 (2006). Springer, Berlin","DOI":"10.1007\/11851561_16"},{"issue":"4","key":"9528_CR6","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1089\/cmb.2020.0434","volume":"28","author":"L Bohnenk\u00e4mper","year":"2021","unstructured":"Bohnenk\u00e4mper, L., Braga, M.D.V., Doerr, D., Stoye, J.: Computing the rearrangement distance of natural genomes. J. Comput. Biol. 28(4), 410\u2013431 (2021)","journal-title":"J. Comput. Biol."},{"issue":"9","key":"9528_CR7","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"MD Braga","year":"2011","unstructured":"Braga, M.D., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comput. Biol. 18(9), 1167\u20131184 (2011)","journal-title":"J. Comput. Biol."},{"issue":"04","key":"9528_CR8","doi-asserted-by":"publisher","first-page":"2150013","DOI":"10.1142\/S021972002150013X","volume":"19","author":"KL Brito","year":"2021","unstructured":"Brito, K.L., Alexandrino, A.O., Oliveira, A.R., Dias, U., Dias, Z.: Reversals and transpositions distance with proportion restriction. J. Bioinform. Comput. Biol. 19(04), 2150013 (2021)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"4","key":"9528_CR9","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TCBB.2005.48","volume":"2","author":"X Chen","year":"2005","unstructured":"Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement. IEEE\/ACM Trans. Comput. Biol. Bioinf. 2(4), 302\u2013315 (2005)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"9528_CR10","unstructured":"Christie, D.A.: Genome Rearrangement Problems. Ph.D. thesis, Department of Computing Science, University of Glasgow (1998)"},{"issue":"9","key":"9528_CR11","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1089\/cmb.2007.0048","volume":"14","author":"Z Fu","year":"2007","unstructured":"Fu, Z., Chen, X., Vacic, V., Nan, P., Zhong, Y., Jiang, T.: MSOAR: a high-throughput ortholog assignment system based on genome rearrangement. J. Comput. Biol. 14(9), 1160\u20131175 (2007)","journal-title":"J. Comput. Biol."},{"key":"9528_CR12","doi-asserted-by":"crossref","unstructured":"Garczarek, L., Guyet, U., Dor\u00e9, H., Farrant, G.K., Hoebeke, M., Brillet-Gu\u00e9guen, L., Bisch, A., Ferrieux, M., Siltanen, J., Corre, E., et\u00a0al.: Cyanorak v2. 1: a scalable information system dedicated to the visualization and expert curation of marine and brackish picocyanobacteria genomes. Nucleic Acids Res. 49, 1 (2020)","DOI":"10.1093\/nar\/gkaa958"},{"issue":"1","key":"9528_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"issue":"16","key":"9528_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/bioinformatics\/btn292","volume":"24","author":"C Kahn","year":"2008","unstructured":"Kahn, C., Raphael, B.: Analysis of segmental duplications via duplication distance. Bioinformatics 24(16), 133\u2013138 (2008)","journal-title":"Bioinformatics"},{"key":"9528_CR15","doi-asserted-by":"crossref","unstructured":"Makarenkov, V., Leclerc, B.: Circular orders of tree metrics, and their uses for the reconstruction and fitting of phylogenetic trees. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 183\u2013208 (1997)","DOI":"10.1090\/dimacs\/037\/11"},{"key":"9528_CR16","volume-title":"Introduction to Genetic Algorithms","author":"M Mitchell","year":"2008","unstructured":"Mitchell, M.: Introduction to Genetic Algorithms. Springer, Cambridge (2008)"},{"key":"9528_CR17","doi-asserted-by":"crossref","unstructured":"Oliveira, A.R., Brito, K.L., Alexandrino, A.O., Siqueira, G., Dias, U., Dias, Z.: Rearrangement distance problems: an updated survey. ACM Comput. Surv. 56(8) (2024)","DOI":"10.1145\/3653295"},{"key":"9528_CR18","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1089\/cmb.2019.0078","volume":"26","author":"AR Oliveira","year":"2019","unstructured":"Oliveira, A.R., Brito, K.L., Dias, U., Dias, Z.: On the complexity of sorting by reversals and transpositions problems. J. Comput. Biol. 26, 1223\u20131229 (2019)","journal-title":"J. Comput. Biol."},{"issue":"1","key":"9528_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.2307\/2413347","volume":"34","author":"D Penny","year":"1985","unstructured":"Penny, D., Hendy, M.: The use of tree comparison metrics. Syst. Zool. 34(1), 75\u201382 (1985)","journal-title":"Syst. Zool."},{"key":"9528_CR20","doi-asserted-by":"crossref","unstructured":"Pinheiro, P.O., Alexandrino, A.O., Oliveira, A.R., de Souza, C.C., Dias, Z.: Heuristics for breakpoint graph decomposition with applications in genome rearrangement problems. In: Proceedings of the 13th Brazilian Symposium on Bioinformatics (BSB\u20192020), pp. 129\u2013140 (2020)","DOI":"10.1007\/978-3-030-65775-8_12"},{"issue":"1","key":"9528_CR21","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1137\/S0895480103433550","volume":"19","author":"AJ Radcliffe","year":"2005","unstructured":"Radcliffe, A.J., Scott, A.D., Wilmer, E.L.: Reversals and transpositions over finite alphabets. SIAM J. Discrete Math. 19(1), 224\u2013244 (2005)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"9528_CR22","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1089\/cmb.2014.0096","volume":"22","author":"M Shao","year":"2015","unstructured":"Shao, M., Lin, Y., Moret, B.M.: An exact algorithm to compute the double-cut-and-join distance for genomes with duplicate genes. J. Comput. Biol. 22(5), 425\u2013435 (2015)","journal-title":"J. Comput. Biol."},{"key":"9528_CR23","doi-asserted-by":"crossref","unstructured":"Siqueira, G., Oliveira, A.R., Alexandrino, A.O., Dias, Z.: Heuristics for cycle packing of adjacency graphs for genomes with repeated genes. In: Proceedings of the 14th Brazilian Symposium on Bioinformatics (BSB\u20192021), pp. 93\u2013105 (2021)","DOI":"10.1007\/978-3-030-91814-9_9"},{"key":"9528_CR24","unstructured":"Walter, M.E.M.T., Dias, Z., Meidanis, J.: Reversal and transposition distance of linear chromosomes. In: Proceedings of the 5th International Symposium on String Processing and Information Retrieval (SPIRE\u20191998), pp. 96\u2013102. IEEE Computer Society, Los Alamitos, CA, USA (1998)"},{"issue":"2","key":"9528_CR25","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1093\/molbev\/msz240","volume":"37","author":"L-G Wang","year":"2020","unstructured":"Wang, L.-G., Lam, T.T.-Y., Xu, S., Dai, Z., Zhou, L., Feng, T., Guo, P., Dunn, C.W., Jones, B.R., Bradley, T., et al.: Treeio: an R package for phylogenetic tree input and output with richly annotated and associated data. Mol. Biol. Evol. 37(2), 599\u2013603 (2020)","journal-title":"Mol. Biol. Evol."},{"issue":"6","key":"9528_CR26","doi-asserted-by":"publisher","first-page":"2314","DOI":"10.1109\/TCBB.2020.2988950","volume":"18","author":"E Willing","year":"2021","unstructured":"Willing, E., Stoye, J., Braga, M.: Computing the inversion-indel distance. IEEE\/ACM Trans. Comput. Biol. Bioinf. 18(6), 2314\u20132326 (2021)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"4","key":"9528_CR27","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1007\/s10878-018-0346-y","volume":"37","author":"S Zhai","year":"2019","unstructured":"Zhai, S., Zhang, P., Zhu, D., Tong, W., Xu, Y., Lin, G.: An approximation algorithm for genome sorting by reversals to recover all adjacencies. J. Comb. Optim. 37(4), 1170\u20131190 (2019)","journal-title":"J. Comb. Optim."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09528-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-024-09528-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09528-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T07:08:12Z","timestamp":1729062492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-024-09528-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,31]]},"references-count":27,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["9528"],"URL":"https:\/\/doi.org\/10.1007\/s10732-024-09528-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2024,5,31]]},"assertion":[{"value":"31 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}