{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:19Z","timestamp":1759638679848},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734369"},{"type":"electronic","value":"9783540734376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73437-6_15","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T17:36:44Z","timestamp":1187026604000},"page":"131-141","source":"Crossref","is-referenced-by-count":5,"title":["A New and Faster Method of Sorting by Transpositions"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Beno\u00eet-Gagn\u00e9","sequence":"first","affiliation":[]},{"given":"Sylvie","family":"Hamel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"15_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. Discrete Math.\u00a011(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR2","unstructured":"Christie, D.A.: Genome rearrangements problems, PhD thesis, Glasgow University, Scotland (1998)"},{"key":"15_CR3","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":"15_CR4","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., et al.: Sorting a bridge hand. Discrete Mathematics\u00a0241, 289\u2013300 (2001)","journal-title":"Discrete Mathematics"},{"key":"15_CR5","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.A., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 156\u2013169. Springer, Heidelberg (2003)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/BF00176089","volume":"38","author":"S.B. Hoot","year":"1994","unstructured":"Hoot, S.B., Palmer, J.D.: Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related genera. Journal of Molecular Evolution\u00a038, 274\u2013281 (1994)","journal-title":"Journal of Molecular Evolution"},{"key":"15_CR7","doi-asserted-by":"crossref","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 (WSP 1997), pp. 70\u201379 (1997)","DOI":"10.1515\/9780773591400-008"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"9755","DOI":"10.1093\/nar\/14.24.9755","volume":"14","author":"J.D. Palmer","year":"1986","unstructured":"Palmer, J.D., Herbon, L.A.: Tricircular mitochondrial genomes of Brassica and Raphanus: reversal of repeat configurations by inversion. Nucleic Acid Research\u00a014, 9755\u20139764 (1986)","journal-title":"Nucleic Acid Research"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Walter, M.E.M.T., Dias, Z., Meidanis, J.: A new Approach for Approximating the Transposition Distance. In: Proceedings of SPIRE, pp. 199\u2013208 (2000)","DOI":"10.1109\/SPIRE.2000.878196"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.jda.2004.08.012","volume":"3","author":"M.E.M.T. Walter","year":"2005","unstructured":"Walter, M.E.M.T., et al.: Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach. Journal of Discrete Algorithms\u00a03, 342\u2013361 (2005)","journal-title":"Journal of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T10:54:37Z","timestamp":1708167277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734369","9783540734376"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}