{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:09:23Z","timestamp":1725890963127},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_3","type":"book-chapter","created":{"date-parts":[[2012,8,10]],"date-time":"2012-08-10T11:35:13Z","timestamp":1344598513000},"page":"25-36","source":"Crossref","is-referenced-by-count":2,"title":["On the Approximation Ratio of Algorithms for Sorting by Transpositions without Using Cycle Graphs"],"prefix":"10.1007","author":[{"given":"Gustavo Rodrigues","family":"Galv\u00e3o","sequence":"first","affiliation":[]},{"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"3_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 Journal on Discrete Mathematics\u00a011(2), 224\u2013240 (1998)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"3_CR2","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)"},{"key":"3_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":"3_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1722024.1722051","volume-title":"Proceedings of the International Symposium on Biocomputing (ISB 2010)","author":"U. Dias","year":"2010","unstructured":"Dias, U., Dias, Z.: Extending Bafna-Pevzner algorithm. In: Proceedings of the International Symposium on Biocomputing (ISB 2010), pp. 1\u20138. ACM, New York (2010)"},{"issue":"4","key":"3_CR5","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 Transactions on Computational Biology and Bioinformatics (TCBB)\u00a03(4), 369\u2013379 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. The MIT Press (2009)","DOI":"10.7551\/mitpress\/9780262062824.001.0001"},{"key":"3_CR7","unstructured":"Galv\u00e3o, G.R., Dias, Z.: GRAAu: Genome Rearrangement Algorithm Auditor. In: Proceedings of the 4th International Conference on Bioinformatics and Computational Biology (BICoB 2012), Las Vegas, NV, USA, pp. 97\u2013101 (2012)"},{"key":"3_CR8","unstructured":"Galv\u00e3o, G.R., Dias, Z.: On the performance of sorting permutations by prefix operations. In: Proceedings of the 4th International Conference on Bioinformatics and Computational Biology (BICoB 2012), Las Vegas, NV, USA, pp. 102\u2013107 (2012)"},{"key":"3_CR9","unstructured":"Guyer, S.A., Heath, L.S., Vergara, J.P.: Subsequence and run heuristics for sorting by transpositions. Technical Report TR-97-20, Computer Science, Virginia Polytechnic Institute and State University (1997)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/SPIRE.2000.878196","volume-title":"Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE 2000)","author":"M.E.M.T. Walter","year":"2000","unstructured":"Walter, M.E.M.T., Dias, Z., Meidanis, J.: A new approach for approximating the transposition distance. In: Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE 2000), pp. 199\u2013208. IEEE Computer Society, Washington, DC (2000)"}],"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_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T00:29:09Z","timestamp":1557188949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31927-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319266","9783642319273"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31927-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}