{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T12:11:13Z","timestamp":1753359073338,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031231971"},{"type":"electronic","value":"9783031231988"}],"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-23198-8_10","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"100-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Transposition Distance Considering Intergenic Regions for\u00a0Unbalanced Genomes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6320-9747","authenticated-orcid":false,"given":"Alexsandro","family":"Oliveira Alexandrino","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0568-1859","authenticated-orcid":false,"given":"Andre","family":"Rodrigues Oliveira","sequence":"additional","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-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":[[2023,1,1]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-030-74432-8_9","volume-title":"Algorithms for Computational Biology","author":"AO Alexandrino","year":"2021","unstructured":"Alexandrino, A.O., Brito, K.L., Oliveira, A.R., Dias, U., Dias, Z.: Reversal distance on genomes with different gene content and intergenic regions information. In: Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A., Wheeler, T. (eds.) AlCoB 2021. LNCS, vol. 12715, pp. 121\u2013133. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-74432-8_9"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1089\/cmb.2020.0121","volume":"28","author":"AO Alexandrino","year":"2021","unstructured":"Alexandrino, A.O., Oliveira, A.R., Dias, U., Dias, Z.: Genome rearrangement distance with reversals, transpositions, and indels. J. Comput. Biol. 28(3), 235\u2013247 (2021)","journal-title":"J. Comput. Biol."},{"issue":"06","key":"10_CR3","doi-asserted-by":"publisher","first-page":"2140011","DOI":"10.1142\/S0219720021400114","volume":"19","author":"AO Alexandrino","year":"2021","unstructured":"Alexandrino, A.O., Oliveira, A.R., Dias, U., Dias, Z.: Incorporating intergenic regions into reversal and transposition distances with indels. J. Bioinform. Comput. Biol. 19(06), 2140011 (2021)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"03","key":"10_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1089\/cmb.2021.0279","volume":"29","author":"AO Alexandrino","year":"2022","unstructured":"Alexandrino, A.O., Oliveira, A.R., Dias, U., Dias, Z.: Labeled cycle graph for transposition and indel distance. J. Comput. Biol. 29(03), 243\u2013256 (2022)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"10_CR5","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":"5","key":"10_CR6","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)","journal-title":"Genome Biol. Evol."},{"key":"10_CR7","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). https:\/\/doi.org\/10.1007\/978-3-319-40189-8_4"},{"issue":"9","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1089\/cmb.2011.0118","volume":"18","author":"MD Braga","year":"2011","unstructured":"Braga, M.D., Willing, E., Stoye, J.: Double cut and join with insertions and deletions. J. Comput. Biol. 18(9), 1167\u20131184 (2011)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"10_CR9","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)","journal-title":"J. Comput. Biol."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-031-06220-9_12","volume-title":"Comparative Genomics (RECOMB CG 2022)","author":"KL Brito","year":"2022","unstructured":"Brito, K.L., Oliveira, A.R., Alexandrino, A.O., Dias, U., Dias, Z.: A new approach for the reversal distance with indels and moves in intergenic regions. In: Jin, L., Durand, D. (eds.) Comparative Genomics (RECOMB CG 2022). LNCS, vol. 13234, pp. 205\u2013220. Springer, Cham (2022)"},{"issue":"14","key":"10_CR11","doi-asserted-by":"publisher","first-page":"426","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(14), 426 (2016)","journal-title":"BMC Bioinform."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-45123-4_20","volume-title":"Combinatorial Pattern Matching","author":"N El-Mabrouk","year":"2000","unstructured":"El-Mabrouk, N.: Genome rearrangement by reversals and insertions\/deletions of contiguous segments. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 222\u2013234. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45123-4_20"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1\u201327 (1999)","journal-title":"J. ACM"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/11970125_22","volume-title":"Approximation and Online Algorithms","author":"P Kolman","year":"2007","unstructured":"Kolman, P., Wale\u0144, T.: Reversal distance for strings with duplicates: linear time approximation using hitting set. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 279\u2013289. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/11970125_22"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-030-01722-4_4","volume-title":"Advances in Bioinformatics and Computational Biology","author":"AR Oliveira","year":"2018","unstructured":"Oliveira, A.R., Brito, K.L., Dias, Z., Dias, U.: Sorting by weighted reversals and transpositions. In: Alves, R. (ed.) BSB 2018. LNCS, vol. 11228, pp. 38\u201349. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01722-4_4"},{"issue":"6","key":"10_CR16","doi-asserted-by":"publisher","first-page":"2870","DOI":"10.1109\/TCBB.2020.2993002","volume":"18","author":"AR Oliveira","year":"2021","unstructured":"Oliveira, A.R., et al.: Sorting signed permutations by intergenic reversals. IEEE\/ACM Trans. Comput. Biol. Bioinf. 18(6), 2870\u20132876 (2021)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"6","key":"10_CR17","doi-asserted-by":"publisher","first-page":"2080","DOI":"10.1109\/TCBB.2021.3077418","volume":"18","author":"AR Oliveira","year":"2021","unstructured":"Oliveira, A.R., Jean, G., Fertin, G., Brito, K.L., Dias, U., Dias, Z.: Sorting permutations by intergenic operations. IEEE\/ACM Trans. Comput. Biol. Bioinf. 18(6), 2080\u20132093 (2021)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"S3","DOI":"10.1186\/1471-2105-14-S15-S3","volume":"14","author":"E Willing","year":"2013","unstructured":"Willing, E., Zaccaria, S., Braga, M.D., Stoye, J.: On the inversion-indel distance. BMC Bioinform. 14, S3 (2013)","journal-title":"BMC Bioinform."},{"issue":"16","key":"10_CR19","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinform. 21(16), 3340\u20133346 (2005)","journal-title":"Bioinform."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23198-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,18]],"date-time":"2023-07-18T18:03:37Z","timestamp":1689703417000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23198-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031231971","9783031231988"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23198-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISBRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Bioinformatics Research and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Haifa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","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":"14 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isbra2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mangul-lab-usc.github.io\/ISBRA","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":"72","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":"30","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":"4","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":"42% - 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":"5","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)"}}]}}