{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:43Z","timestamp":1750306963128,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,22]],"date-time":"2013-09-22T00:00:00Z","timestamp":1379808000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,22]]},"DOI":"10.1145\/2506583.2506614","type":"proceedings-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T14:11:56Z","timestamp":1383055916000},"page":"181-190","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Greedy Randomized Search Procedure to Sort Genomes using Symmetric, Almost-Symmetric and Unitary Inversions"],"prefix":"10.1145","author":[{"given":"Ulisses","family":"Dias","sequence":"first","affiliation":[{"name":"Institute of Computing, University of Campinas, Campinas - SP, Brazil"}]},{"given":"Christian","family":"Baudet","sequence":"additional","affiliation":[{"name":"CNRS UMR 5558 LBBE, Universit\u00e9 Lyon I, INRIA Bamboo Team, Lyon, France"}]},{"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[{"name":"Institute of Computing, University of Campinas, Campinas - SP, Brazil"}]}],"member":"320","published-online":{"date-parts":[[2013,9,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(03)00014-0"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"B\u00e4ck T.","year":"1996","unstructured":"T. B\u00e4ck . Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms . Oxford University Press , Oxford, UK , 1996 . T. B\u00e4ck. Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford, UK, 1996."},{"issue":"2","key":"e_1_3_2_1_3_1","first-page":"239","article-title":"Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome","volume":"12","author":"Bafna V.","year":"1995","unstructured":"V. Bafna and P. A. Pevzner . Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome . Molecular Biology and Evolution , 12 ( 2 ): 239 -- 246 , 1995 . V. Bafna and P. A. Pevzner. Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X chromosome. Molecular Biology and Evolution, 12(2):239--246, 1995.","journal-title":"Molecular Biology and Evolution"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019528280X"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.04.010"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32589-2_24"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1007\/978-3-642-22006-7_55","volume-title":"Automata, Languages and Programming","author":"Bulteau L.","year":"2011","unstructured":"L. Bulteau , G. Fertin , and U. Rusu . Sorting by transpositions is difficult . In Automata, Languages and Programming , volume 6755 of Lecture Notes in Computer Science , pages 654 -- 665 . 2011 . L. Bulteau, G. Fertin, and U. Rusu. Sorting by transpositions is difficult. In Automata, Languages and Programming, volume 6755 of Lecture Notes in Computer Science, pages 654--665. 2011."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.09.007"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.1000128"},{"key":"e_1_3_2_1_10_1","first-page":"261","volume-title":"Proceedings of the 5th International Conference on Bioinformatics and Computational Biology (BICoB'2013)","author":"Dias U.","year":"2013","unstructured":"U. Dias and Z. Dias . Sorting genomes using symmetric, almost-symmetric and unitary inversions . In Proceedings of the 5th International Conference on Bioinformatics and Computational Biology (BICoB'2013) , pages 261 -- 268 , Honolulu, USA , 2013 . U. Dias and Z. Dias. Sorting genomes using symmetric, almost-symmetric and unitary inversions. In Proceedings of the 5th International Conference on Bioinformatics and Computational Biology (BICoB'2013), pages 261--268, Honolulu, USA, 2013."},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","first-page":"240","volume-title":"Comparative Genomics","author":"Dias U.","year":"2011","unstructured":"U. Dias , Z. Dias , and J. C. Setubal . A simulation tool for the study of symmetric inversions in bacterial genomes . In Comparative Genomics , volume 6398 of Lecture Notes in Computer Science , pages 240 -- 251 . 2011 . U. Dias, Z. Dias, and J. C. Setubal. A simulation tool for the study of symmetric inversions in bacterial genomes. In Comparative Genomics, volume 6398 of Lecture Notes in Computer Science, pages 240--251. 2011."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2245276.2231993"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.22.7.448"},{"key":"e_1_3_2_1_14_1","volume-title":"Evidence for symmetric chromosomal inversions around the replication origin in bacteria. Genome Biology, 1(6):research0011.1--0011.9","author":"Eisen J. A.","year":"2000","unstructured":"J. A. Eisen , J. F. Heidelberg , O. White , and S. L. Salzberg . Evidence for symmetric chromosomal inversions around the replication origin in bacteria. Genome Biology, 1(6):research0011.1--0011.9 , 2000 . J. A. Eisen, J. F. Heidelberg, O. White, and S. L. Salzberg. Evidence for symmetric chromosomal inversions around the replication origin in bacteria. Genome Biology, 1(6):research0011.1--0011.9, 2000."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2006.44"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"e_1_3_2_1_17_1","volume-title":"Operations Research","author":"Feo T. A.","year":"1994","unstructured":"T. A. Feo and M. Pardalos . A greedy randomized adaptive search procedure for the 2-partition problem . Operations Research , 1994 . T. A. Feo and M. Pardalos. A greedy randomized adaptive search procedure for the 2-partition problem. Operations Research, 1994."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-010-9289-z"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_38"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796277"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/300515.300516"},{"key":"e_1_3_2_1_22_1","first-page":"604","volume-title":"Proceedings of the 6th Annual Symposium on Discrete Algorithms","author":"Kececioglu J. D.","year":"1995","unstructured":"J. D. Kececioglu and R. Ravi . Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation . In Proceedings of the 6th Annual Symposium on Discrete Algorithms , pages 604 -- 613 , New York, USA , 1995 . J. D. Kececioglu and R. Ravi. Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. In Proceedings of the 6th Annual Symposium on Discrete Algorithms, pages 604--613, New York, USA, 1995."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2004-5-2-r12"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.11.1.44"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496656_11"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02143500"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.12.3.164.12639"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.3.228.116"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.85.24.9801"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_1"}],"event":{"name":"BCB'13: ACM-BCB2013","sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"],"location":"Wshington DC USA","acronym":"BCB'13"},"container-title":["Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2506583.2506614","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2506583.2506614","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:15Z","timestamp":1750235955000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2506583.2506614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,22]]},"references-count":30,"alternative-id":["10.1145\/2506583.2506614","10.1145\/2506583"],"URL":"https:\/\/doi.org\/10.1145\/2506583.2506614","relation":{},"subject":[],"published":{"date-parts":[[2013,9,22]]},"assertion":[{"value":"2013-09-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}