{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:29Z","timestamp":1746331409859,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079523"},{"type":"electronic","value":"9783319079530"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07953-0_5","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:58:08Z","timestamp":1402419488000},"page":"59-70","source":"Crossref","is-referenced-by-count":3,"title":["Heuristics for the Sorting by Length-Weighted Inversions Problem on Signed Permutations"],"prefix":"10.1007","author":[{"given":"Thiago","family":"da Silva 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":"297","reference":[{"key":"5_CR1","first-page":"2003","volume":"29","author":"R.M. Aiex","year":"2002","unstructured":"Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel grasp with path-relinking for job shop scheduling. Parallel Computing\u00a029, 2003 (2002)","journal-title":"Parallel Computing"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-45784-4_23","volume-title":"Algorithms in Bioinformatics","author":"Y. Ajana","year":"2002","unstructured":"Ajana, Y., Lefebvre, J.F., Tillier, E.R.M., El-Mabrouk, N.: Exploring the set of all minimal sequences of reversals - an application to test the replication-directed reversal hypothesis. In: Guig\u00f3, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol.\u00a02452, pp. 300\u2013315. Springer, Heidelberg (2002)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Arruda, T.S., Dias, U., Dias, Z.: Heuristics for the sorting by length-weighted inversion problem. In: Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics, pp. 498\u2013507. ACM (2013)","DOI":"10.1145\/2506583.2506615"},{"key":"5_CR4","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":"T. B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford (1996)"},{"issue":"5","key":"5_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1089\/106652701753216503","volume":"8","author":"D.A. Bader","year":"2001","unstructured":"Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology\u00a08(5), 483\u2013491 (2001)","journal-title":"Journal of Computational Biology"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.dam.2004.04.010","volume":"146","author":"A. Bergeron","year":"2005","unstructured":"Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics\u00a0146, 134\u2013145 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Blanchette, M., Kunisawa, T., Sankoff, D.: Parametric genome rearrangement. Gene\u00a0172(1), C11\u2013C17 (1996)","DOI":"10.1016\/0378-1119(95)00878-0"},{"issue":"5","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1016\/j.cor.2012.09.007","volume":"40","author":"R.G. Cano","year":"2013","unstructured":"Cano, R.G., Kunigami, G., Souza, C.C., Rezende, P.J.: A hybrid grasp heuristic to construct effective drawings of proportional symbol maps. Computers and Operations Research\u00a040(5), 1435\u20131447 (2013)","journal-title":"Computers and Operations Research"},{"issue":"7","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1000128","DOI":"10.1371\/journal.pgen.1000128","volume":"4","author":"A.E. Darling","year":"2008","unstructured":"Darling, A.E., Mikl\u00f3s, I., Ragan, M.A.: Dynamics of genome rearrangement in bacterial populations. PLoS Genetics\u00a04(7), 1000128 (2008)","journal-title":"PLoS Genetics"},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization\u00a06(2), 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Feo, T.A., Pardalos, M.: A greedy randomized adaptive search procedure for the 2-partition problem. Operations Research (1994)","DOI":"10.1287\/opre.42.5.860"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s11235-010-9289-z","volume":"46","author":"P. Festa","year":"2011","unstructured":"Festa, P., Resende, M.: Grasp: basic components and enhancements. Telecommunication Systems\u00a046(3), 253\u2013271 (2011)","journal-title":"Telecommunication Systems"},{"issue":"1","key":"5_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. Journal of the ACM\u00a046(1), 1\u201327 (1999)","journal-title":"Journal of the ACM"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R.: Grasp and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing\u00a011, 44\u201352 (1999)","journal-title":"INFORMS Journal on Computing"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Lefebvre, J.F., El-Mabrouk, N., Tillier, E., Sankoff, D.: Detection and validation of single gene inversions. Bioinformatics\u00a019, i190\u2013i196 (2003)","DOI":"10.1093\/bioinformatics\/btg1025"},{"key":"5_CR16","first-page":"200","volume":"14","author":"C.C. Ribeiro","year":"2001","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid grasp with perturbations for the steiner problem in graphs. INFORMS Journal on Computing\u00a014, 200\u2013202 (2001)","journal-title":"INFORMS Journal on Computing"},{"issue":"10","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1093\/bioinformatics\/18.10.1305","volume":"18","author":"D. Sankoff","year":"2002","unstructured":"Sankoff, D.: Short inversions and conserved gene cluster. Bioinformatics\u00a018(10), 1305\u20131308 (2002)","journal-title":"Bioinformatics"},{"key":"5_CR18","series-title":"LNBI","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-32290-0_8","volume-title":"Comparative Genomics","author":"D. Sankoff","year":"2005","unstructured":"Sankoff, D., Lefebvre, J.F., Tillier, E., Maler, A., El-Mabrouk, N.: The distribution of inversion lengths in bacteria. In: Lagergren, J. (ed.) RECOMB-WS 2004. LNCS (LNBI), vol.\u00a03388, pp. 97\u2013108. Springer, Heidelberg (2005)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-27801-6_3","volume-title":"Combinatorial Pattern Matching","author":"F. Swidan","year":"2004","unstructured":"Swidan, F., Bender, M., Ge, D., He, S., Hu, H., Pinter, R.: Sorting by length-weighted reversals: Dealing with signs and circularity. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 32\u201346. Springer, Heidelberg (2004)"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-27801-6_1","volume-title":"Combinatorial Pattern Matching","author":"E. Tannier","year":"2004","unstructured":"Tannier, E., Sagot, M.-F.: Sorting by reversals in subquadratic time. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 1\u201313. Springer, Heidelberg (2004)"},{"issue":"3","key":"5_CR21","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1093\/bioinformatics\/18.3.492","volume":"18","author":"G. Tesler","year":"2002","unstructured":"Tesler, G.: Grimm: genome rearrangements web server. Bioinformatics\u00a018(3), 492\u2013493 (2002), http:\/\/bioinformatics.oxfordjournals.org\/content\/18\/3\/492.abstract","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07953-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:06:24Z","timestamp":1746263184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07953-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079523","9783319079530"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07953-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}