{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:27:00Z","timestamp":1738387620633,"version":"3.35.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540855569"},{"type":"electronic","value":"9783540855576"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85557-6_11","type":"book-chapter","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T14:23:10Z","timestamp":1219846990000},"page":"115-126","source":"Crossref","is-referenced-by-count":3,"title":["Transposition Distance Based on the Algebraic Formalism"],"prefix":"10.1007","author":[{"given":"Cleber V. G.","family":"Mira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hederson P.","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilherme A.","family":"Pinto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Emilia M. T.","family":"Walter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"11_CR1","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"},{"unstructured":"Bafna, V., Pevzner, P.A.: Sorting by transpositions. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, USA, January 1995, pp. 614\u2013623 (1995)","key":"11_CR2"},{"issue":"2","key":"11_CR3","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 Journal on Discrete Mathematics\u00a011(2), 224\u2013240 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-540-73437-6_15","volume-title":"Combinatorial Pattern Matching","author":"M. Beno\u00eet-Gagn\u00e9","year":"2007","unstructured":"Beno\u00eet-Gagn\u00e9, M., Hamel, S.: A new and faster method of sorting by transpositions. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 131\u2013141. Springer, Heidelberg (2007)"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0020-0190(96)00155-X","volume":"60","author":"D.A. Christie","year":"1996","unstructured":"Christie, D.A.: Sorting permutations by block-interchanges. Information Processing Letters\u00a060(4), 165\u2013169 (1996)","journal-title":"Information Processing Letters"},{"unstructured":"Christie, D.A.: Genome Rearrangement Problems. PhD thesis, Glasgow University (1998)","key":"11_CR6"},{"key":"11_CR7","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/11557067_17","volume-title":"Algorithms in Bioinformatics","author":"I. Elias","year":"2005","unstructured":"Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 204\u2013215. Springer, Heidelberg (2005)"},{"key":"11_CR8","first-page":"581","volume-title":"Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995)","author":"S. Hannenhalli","year":"1995","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), October 1995, pp. 581\u2013592. IEEE Computer Society Press, Los Alamitos (1995)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-44888-8_12","volume-title":"Combinatorial Pattern Matching","author":"T. Hartman","year":"2003","unstructured":"Hartman, T.: A simpler 1.5-approximation algorithm for sorting by transpositions. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 156\u2013169. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Hartman, T., Shamir, R.: A simpler and faster 1.5-approximation algorithm for sorting by transpositions. In: Proceedings of CPM 2003, pp. 156\u2013169 (2003) (extended version)","key":"11_CR10","DOI":"10.1007\/3-540-44888-8_12"},{"unstructured":"Honda, M.I.: Implementation of the algorithm of Hartman for the problem of sorting by transpositions. Master\u2019s thesis, Department of Computer Science, University of Brasilia (in portuguese) (2004)","key":"11_CR11"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-94-011-4309-7_20","volume-title":"Comparative Genomics: Empirical and Analyitical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families","author":"J. Meidanis","year":"2000","unstructured":"Meidanis, J., Dias, Z.: An alternative algebraic formalism for genome rearrangements. In: Sankoff, D., Nadeau, J.H. (eds.) Comparative Genomics: Empirical and Analyitical Approaches to Gene Order Dynamics, Map Alignment and Evolution of Gene Families, pp. 213\u2013223. Kluwer Academic Publishers, Dordrecht (November 2000)"},{"doi-asserted-by":"crossref","unstructured":"Meidanis, J., Walter, M.E.M.T., Dias, Z.: Transposition distance between a permutation and its reverse. In: Baeza-Yates, R. (ed.) Proceedings of the 4th South American Workshop on String Processing (WSP 1997), Valparaiso, Chile, pp. 70\u201379. Carleton University Press (1997)","key":"11_CR13","DOI":"10.1515\/9780773591400-008"},{"unstructured":"Mira, C., Meidanis, J.: Algebraic formalism for genome rearrangements (part 1). Technical Report IC-05-10, Institute of Computing - University of Campinas (June 2005)","key":"11_CR14"},{"unstructured":"Mira, C.V.G., Meidanis, J.: Analysis of sorting by transpositions based on algebraic formalism. In: The Eighth Annual International Conference on Research in Computational Molecular Biology (RECOMB 2004) (March 2004)","key":"11_CR15"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-44888-8_27","volume-title":"Combinatorial Pattern Matching","author":"M.E.M.T. Walter","year":"2003","unstructured":"Walter, M.E.M.T., Curado, L.R.A.F., Oliveira, A.G.: Working on the problem of sorting by transpositions on genome rearrangements. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 372\u2013383. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Walter, M.E.M.T., Dias, Z., Meidanis, J.: A new approach for approximating the transposition distance. In: String Processing and Information Retrieval - SPIRE 2000, pp. 199\u2013208 (2000)","key":"11_CR17","DOI":"10.1109\/SPIRE.2000.878196"},{"issue":"1","key":"11_CR18","first-page":"213","volume":"3","author":"M.E.M.T. Walter","year":"2002","unstructured":"Walter, M.E.M.T., Oliveira, E.T.G.: Extending the theory of Bafna and Pevzner for the problem of sorting by transpositions. Tend\u00eancias em Matem\u00e1tica Aplicada e Computacional - TEMA - SBMAC\u00a03(1), 213\u2013222 (2002) (in portuguese)","journal-title":"Tend\u00eancias em Matem\u00e1tica Aplicada e Computacional - TEMA - SBMAC"},{"unstructured":"Walter, M.E.M.T., Soares, L.S.N., Dias, Z.: Branch-and-bound algorithms for the problem of sorting by transpositions on genome rearrangements. In: Proceedings of the 26th Congress of the Brazilian Computer Society, XXXIII Semin\u00e1rio integrado de hardware e software \u2013 SEMISH, pp. 69\u201381 (2006)","key":"11_CR19"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85557-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T18:07:12Z","timestamp":1738346832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85557-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540855569","9783540855576"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85557-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}