{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:50:46Z","timestamp":1754110246303},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Center for Computational Engineering and Sciences at Unicamp","award":["2013\/08293-7"],"award-info":[{"award-number":["2013\/08293-7"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2018,3,1]]},"DOI":"10.1109\/tcbb.2015.2474400","type":"journal-article","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T18:48:45Z","timestamp":1440787725000},"page":"352-363","source":"Crossref","is-referenced-by-count":4,"title":["A GRASP-Based Heuristic for the Sorting by Length-Weighted Inversions Problem"],"prefix":"10.1109","volume":"15","author":[{"given":"Thiago da Silva","family":"Arruda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulisses","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Genome rearrangement problems","author":"christie","year":"1998"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_1"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","author":"b\u00e4ck","year":"1996","journal-title":"Evolutionary Algorithms in Theory and Practice Evolution Strategies Evolutionary Programming Genetic Algorithms"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s11235-010-9289-z"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2009.00663.x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2009.00664.x"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.3.492"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188586"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/565196.565233"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/9780470400531.eorms0281"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16181-0_20"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1101\/gr.2289704"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0378-1119(95)00878-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.10.1305"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg1025"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32290-0_8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1089\/106652701753216503"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.04.010"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019731994X"},{"key":"ref18","first-page":"200","article-title":"1.375-Approximation algorithm for sorting by reversals","author":"berman","year":"0","journal-title":"Proc 10th Eur Symp Algorithms"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_3"},{"key":"ref28","first-page":"181","article-title":"Greedy\n randomized search procedure to sort genomes using symmetric, Almost-symmetric and unitary inversions","author":"dias","year":"0","journal-title":"Proc Int Conf Bioinformat Comput Biol Biomed Informat"},{"key":"ref4","first-page":"239","article-title":"Sorting by reversals: Genome rearrangements in plant organelles and evolutionary history of X\n chromosome","volume":"12","author":"bafna","year":"1995","journal-title":"Mol Biol Evol"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.09.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02143500"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492588"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","article-title":"Grasp: An annotated bibliography","volume":"15","author":"festa","year":"2002","journal-title":"Essays and Surveys in Metaheuristics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/300515.300516"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.85.24.9801"},{"key":"ref7","first-page":"604","article-title":"Of mice and men: Algorithms for evolutionary distances between genomes with translocation","author":"kececioglu","year":"0","journal-title":"Proc 6th Symp on Discrete Algorithms"},{"key":"ref2","first-page":"448","article-title":"Inversions in the third chromosome of wild races of Drosophila\n pseudoobscura, and their use in the study of the history of the species","volume":"22","author":"dobzhansky","year":"0","journal-title":"Proc Nat Acad Sci USA"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pgen.1000128"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-319-07953-0_5","article-title":"Heuristics\n for the sorting by length-weighted inversions problem on signed permutations","volume":"8542","author":"arruda","year":"2014","journal-title":"Algorithms for Computational Biology"},{"key":"ref20","first-page":"2002","article-title":"Genomic sorting with Length-weighted reversals","volume":"13","author":"pinter","year":"2002","journal-title":"Genome Informat"},{"key":"ref22","first-page":"498","article-title":"Heuristics\n for the sorting by Length-weighted inversion problem","author":"arruda","year":"0","journal-title":"Proc Int Conf Bioinformat Comput Biol Biomed Informat"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2007.08.008"},{"key":"ref42","article-title":"Phylip (phylogeny inference package) version 3.5c","author":"felsenstein","year":"2007"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/opre.42.5.860","article-title":"A greedy randomized adaptive search procedure for the 2-partition problem","volume":"42","author":"feo","year":"1994","journal-title":"Oper Res"},{"key":"ref41","first-page":"406","article-title":"The neighbor-joining method: A new method for reconstructing phylogenetic trees","volume":"4","author":"saitou","year":"1987","journal-title":"Molecular Biol Evol"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00285-013-0702-6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.3.228.116"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1038\/nature10549"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(03)00014-0"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/8329158\/07229299.pdf?arnumber=7229299","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T07:04:10Z","timestamp":1643180650000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7229299\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,1]]},"references-count":44,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2015.2474400","relation":{},"ISSN":["1545-5963"],"issn-type":[{"value":"1545-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3,1]]}}}