{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:09:20Z","timestamp":1725890960395},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319266"},{"type":"electronic","value":"9783642319273"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31927-3_1","type":"book-chapter","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T07:35:13Z","timestamp":1344584113000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Transposition Diameter and Lonely Permutations"],"prefix":"10.1007","author":[{"given":"Lu\u00eds Felipe I.","family":"Cunha","sequence":"first","affiliation":[]},{"given":"Luis Antonio B.","family":"Kowada","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"de A. Hausen","sequence":"additional","affiliation":[]},{"given":"Celina M. H.","family":"de Figueiredo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","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. Disc. Math.\u00a011, 224\u2013240 (1998)","journal-title":"SIAM J. Disc. Math."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Boore, J.L.: The duplication\/random loss model for gene rearrangement exemplified by mitochondrial genomes of deuterostome animals. In: Comparative Genomics, pp. 133\u2013148. Kluwer Academic Publishers (2000)","DOI":"10.1007\/978-94-011-4309-7_13"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-22006-7_55","volume-title":"Automata, Languages and Programming","author":"L. Bulteau","year":"2011","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by Transpositions Is Difficult. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 654\u2013665. Springer, Heidelberg (2011)"},{"key":"1_CR4","unstructured":"Christie, D.A.: Genome Rerrangement Problems. Ph.D. dissertation, University of Glasgow, Scotland (1999)"},{"key":"1_CR5","unstructured":"Dias, Z.: Rearranjo de genomas: uma colet\u00e2nea de artigos. Ph.D. dissertation, UNICAMP, Brazil (2002)"},{"issue":"4","key":"1_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1109\/TCBB.2006.44","volume":"3","author":"I. Elias","year":"2006","unstructured":"Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE\/ACM Trans. Comput. Biol. Bioninformatics\u00a03(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioninformatics"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0012-365X(01)00150-9","volume":"241","author":"H. Eriksson","year":"2001","unstructured":"Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., W\u00e4stlund, J.: Sorting a bridge hand. Discrete Math.\u00a0241(1), 289\u2013300 (2001)","journal-title":"Discrete Math."},{"key":"1_CR8","unstructured":"Fortuna, V.J.: Dist\u00e2ncias de Transposi\u00e7\u00e3o entre Genomas. Master dissertation, Instituto de Computa\u00e7\u00e3o \u2013 UNICAMP, Brazil (2005)"},{"key":"1_CR9","series-title":"LNBI","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-85557-6_8","volume-title":"Advances in Bioinformatics and Computational Biology","author":"R.A. Hausen","year":"2008","unstructured":"Hausen, R.A., Faria, L., de Figueiredo, C.M.H., Kowada, L.A.B.: On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions. In: Bazzan, A.L.C., Craven, M., Martins, N.F. (eds.) BSB 2008. LNCS (LNBI), vol.\u00a05167, pp. 79\u201391. Springer, Heidelberg (2008)"},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/08074413X","volume":"24","author":"R.A. Hausen","year":"2010","unstructured":"Hausen, R.A., Faria, L., de Figueiredo, C.M.H., Kowada, L.A.B.: Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions. SIAM J. Disc. Math.\u00a024(3), 792\u2013807 (2010)","journal-title":"SIAM J. Disc. Math."},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-15060-9_4","volume-title":"Advances in Bioinformatics and Computational Biology","author":"L.A.B. Kowada","year":"2010","unstructured":"Kowada, L.A.B., Hausen, R.A., de Figueiredo, C.M.H.: Bounds on the Transposition Distance for Lonely Permutations. In: Ferreira, C.E., Miyano, S., Stadler, P.F. (eds.) BSB 2010. LNCS, vol.\u00a06268, pp. 35\u201346. Springer, Heidelberg (2010)"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1137\/080741860","volume":"24","author":"L. Lu","year":"2010","unstructured":"Lu, L., Yang, Y.: A Lower Bound on the Transposition Diameter. SIAM J. Disc. Math.\u00a024(4), 1242\u20131249 (2010)","journal-title":"SIAM J. Disc. Math."},{"key":"1_CR13","first-page":"70","volume-title":"Proceedings of the 4th South American Workshop on String Processing","author":"J. Meidanis","year":"1997","unstructured":"Meidanis, J., Walter, M.E.M.T., Dias, Z.: Transposition distance between a permutation and its reverse. In: Proceedings of the 4th South American Workshop on String Processing, pp. 70\u201379. Carleton University Press, Valpara\u00edso (1997)"},{"issue":"14","key":"1_CR14","doi-asserted-by":"publisher","first-page":"6575","DOI":"10.1073\/pnas.89.14.6575","volume":"89","author":"D. Sankoff","year":"1992","unstructured":"Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F., Cedergren, R.: Gene sort comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc. Natl. Acad. Sci.\u00a089(14), 6575\u20136579 (1992)","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31927-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T20:32:12Z","timestamp":1557174732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31927-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319266","9783642319273"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31927-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}