{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:19Z","timestamp":1770972379626,"version":"3.50.1"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031211744","type":"print"},{"value":"9783031211751","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21175-1_16","type":"book-chapter","created":{"date-parts":[[2022,12,15]],"date-time":"2022-12-15T08:03:53Z","timestamp":1671091433000},"page":"147-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A 1.375-Approximation Algorithm for\u00a0Sorting by\u00a0Transpositions with\u00a0Faster Running Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-9747","authenticated-orcid":false,"given":"Alexsandro Oliveira","family":"Alexandrino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5287-2925","authenticated-orcid":false,"given":"Klairton Lima","family":"Brito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre Rodrigues","family":"Oliveira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4763-3046","authenticated-orcid":false,"given":"Ulisses","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3333-6822","authenticated-orcid":false,"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,16]]},"reference":[{"issue":"2","key":"16_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. Discret. Math. 11(2), 224\u2013240 (1998)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1137\/110851390","volume":"26","author":"L Bulteau","year":"2012","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discret. Math. 26(3), 1148\u20131180 (2012)","journal-title":"SIAM J. Discret. Math."},{"key":"16_CR3","unstructured":"Christie, D.A.: Genome Rearrangement Problems. Ph.D. thesis, Department of Computing Science, University of Glasgow (1998)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Dias, U., Dias, Z.: An improved $$1.375$$-approximation algorithm for the transposition distance problem. In: Proceeding of the 1st ACM International Conference on Bioinformatics and Computational Biology (BCB\u20192010), pp. 334\u2013337. ACM, New York (2010)","DOI":"10.1145\/1854776.1854823"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Dias, U., Dias, Z.: Extending bafna-pevzner algorithm. In: Proceedings of the 1st International Symposium on Biocomputing (ISB\u20192010), pp. 1\u20138. ACM, New York (2010)","DOI":"10.1145\/1722024.1722051"},{"key":"16_CR6","unstructured":"Dias, U.M.: Problemas de Compara\u00e7\u00e3o de Genomas. Ph.D. thesis, Institute of Computing, University of Campinas (2012). In Portuguese"},{"issue":"4","key":"16_CR7","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. Bioinf. 3(4), 369\u2013379 (2006)","journal-title":"IEEE ACM Trans. Comput. Biol. Bioinf."},{"key":"16_CR8","first-page":"1","volume":"19","author":"GR Galv\u00e3o","year":"2014","unstructured":"Galv\u00e3o, G.R., Dias, Z.: An audit tool for genome rearrangement algorithms. J. Exp. Algorithmics 19, 1\u201334 (2014)","journal-title":"J. Exp. Algorithmics"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-022-00205-z","volume":"17","author":"LAG Silva","year":"2022","unstructured":"Silva, L.A.G., Kowada, L.A.B., Rocco, N.R., Walter, M.E.M.T.: A new 1.375-approximation algorithm for sorting by transpositions. Algorithms Mol. Biol. 17(1), 1\u201317 (2022). https:\/\/doi.org\/10.1186\/s13015-022-00205-z","journal-title":"Algorithms Mol. Biol."},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Walter, M.E.M.T., Dias, Z., Meidanis, J.: A new approach for approximating the transposition distance. In: Titsworth, F.M. (ed.) Proceedings of the 7th String Processing and Information Retrieval (SPIRE\u20192000), pp. 199\u2013208. IEEE Computer Society, Los Alamitos (2000)","DOI":"10.1109\/SPIRE.2000.878196"}],"container-title":["Lecture Notes in Computer Science","Advances in Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21175-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T12:59:47Z","timestamp":1728565187000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21175-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031211744","9783031211751"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21175-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BSB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Bioinformatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buzios","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wob2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bsb.sbc.org.br\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}