{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:33:08Z","timestamp":1757543588277,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030422653"},{"type":"electronic","value":"9783030422660"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-42266-0_2","type":"book-chapter","created":{"date-parts":[[2020,3,23]],"date-time":"2020-03-23T14:03:01Z","timestamp":1584972181000},"page":"16-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre Rodrigues","family":"Oliveira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1534-2682","authenticated-orcid":false,"given":"G\u00e9raldine","family":"Jean","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8251-2012","authenticated-orcid":false,"given":"Guillaume","family":"Fertin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5287-2925","authenticated-orcid":false,"given":"Klairton Lima","family":"Brito","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4763-3046","authenticated-orcid":false,"given":"Ulisses","family":"Dias","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3333-6822","authenticated-orcid":false,"given":"Zanoni","family":"Dias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,3]]},"reference":[{"issue":"2","key":"2_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. 11(2), 224\u2013240 (1998). \nhttps:\/\/doi.org\/10.1137\/S089548019528280X","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1093\/molbev\/msi134","volume":"22","author":"E Belda","year":"2005","unstructured":"Belda, E., Moya, A., Silva, F.J.: Genome rearrangement distances and gene order phylogeny in $$\\gamma $$-proteobacteria. Mol. Biol. Evol. 22(6), 1456\u20131467 (2005). \nhttps:\/\/doi.org\/10.1093\/molbev\/msi134","journal-title":"Mol. Biol. Evol."},{"issue":"5","key":"2_CR3","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1093\/gbe\/evw083","volume":"8","author":"P Biller","year":"2016","unstructured":"Biller, P., Gu\u00e9guen, L., Knibbe, C., Tannier, E.: Breaking good: accounting for fragility of genomic regions in rearrangement distance estimation. Genome Biol. Evol. 8(5), 1427\u20131439 (2016). \nhttps:\/\/doi.org\/10.1093\/gbe\/evw083","journal-title":"Genome Biol. Evol."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-40189-8_4","volume-title":"Pursuit of the Universal","author":"P Biller","year":"2016","unstructured":"Biller, P., Knibbe, C., Beslon, G., Tannier, E.: Comparative genomics on artificial life. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 35\u201344. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-40189-8_4"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1089\/cmb.2019.0293","volume":"27","author":"KL Brito","year":"2020","unstructured":"Brito, K.L., Jean, G., Fertin, G., Oliveira, A.R., Dias, U., Dias, Z.: Sorting by genome rearrangements on both gene order and intergenic sizes. J. Comput. Biol. 27(2), 156\u2013174 (2020). \nhttps:\/\/doi.org\/10.1089\/cmb.2019.0293","journal-title":"J. Comput. Biol."},{"issue":"3","key":"2_CR6","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. Comput. 26(3), 1148\u20131180 (2012). \nhttps:\/\/doi.org\/10.1137\/110851390","journal-title":"SIAM J. Comput."},{"issue":"S14","key":"2_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1186\/s12859-016-1264-6","volume":"17","author":"L Bulteau","year":"2016","unstructured":"Bulteau, L., Fertin, G., Tannier, E.: Genome rearrangements with indels in intergenes restrict the scenario space. BMC Bioinform. 17(S14), 225\u2013231 (2016). \nhttps:\/\/doi.org\/10.1186\/s12859-016-1264-6","journal-title":"BMC Bioinform."},{"issue":"4","key":"2_CR8","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. Bioinform. 3(4), 369\u2013379 (2006). \nhttps:\/\/doi.org\/10.1109\/TCBB.2006.44","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"16","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-017-0107-y","volume":"12","author":"G Fertin","year":"2017","unstructured":"Fertin, G., Jean, G., Tannier, E.: Algorithms for computing the double cut and join distance on both gene order and intergenic sizes. Algorithm Mol. Biol. 12(16), 1\u201311 (2017). \nhttps:\/\/doi.org\/10.1186\/s13015-017-0107-y","journal-title":"Algorithm Mol. Biol."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of the 36th Annual IEEE Symposium Foundations of Computer Science (FOCS 1995), pp. 581\u2013592. IEEE Computer Society Press, Washington, DC (1995). \nhttps:\/\/doi.org\/10.1109\/SFCS.1995.492588","DOI":"10.1109\/SFCS.1995.492588"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01188586","volume":"13","author":"JD Kececioglu","year":"1995","unstructured":"Kececioglu, J.D., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13, 180\u2013210 (1995). \nhttps:\/\/doi.org\/10.1007\/BF01188586","journal-title":"Algorithmica"},{"issue":"24","key":"2_CR12","doi-asserted-by":"publisher","first-page":"3324","DOI":"10.1093\/bioinformatics\/bts603","volume":"28","author":"Y Lin","year":"2012","unstructured":"Lin, Y., Rajan, V., Moret, B.M.E.: TIBA: a tool for phylogeny inference from rearrangement data with bootstrap analysis. Bioinformatics 28(24), 3324\u20133325 (2012). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/bts603","journal-title":"Bioinformatics"},{"issue":"21","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-019-0156-5","volume":"14","author":"AR Oliveira","year":"2019","unstructured":"Oliveira, A.R., Jean, G., Fertin, G., Dias, U., Dias, Z.: Super short operations on both gene order and intergenic sizes. Algorithm Mol. Biol. 14(21), 1\u201317 (2019). \nhttps:\/\/doi.org\/10.1186\/s13015-019-0156-5","journal-title":"Algorithm Mol. Biol."},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s00239-005-0216-y","volume":"63","author":"LS Wang","year":"2006","unstructured":"Wang, L.S., Warnow, T., Moret, B.M.E., Jansen, R.K., Raubeson, L.A.: Distance-based genome rearrangement phylogeny. J. Mol. Evol. 63(4), 473\u2013483 (2006). \nhttps:\/\/doi.org\/10.1007\/s00239-005-0216-y","journal-title":"J. Mol. Evol."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-42266-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T13:04:06Z","timestamp":1588597446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-42266-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030422653","9783030422660"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-42266-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"3 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AlCoB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms for Computational Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Missoula, MT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alcob2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/alcob2020.irdta.eu\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","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":"15","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":"0","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":"63% - 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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was postponed to be held together with AlCoB 2021 due to the coronavirus pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}